Triple

T16474853
Position Surface form Disambiguated ID Type / Status
Subject Tychonoff theorem for products of compact spaces E400161 entity
Predicate canBeProvedUsing P27215 FINISHED
Object Alexander subbase theorem E1215847 NE FINISHED

How this triple was built (2 steps)

Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.

NER Named-entity recognition gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Alexander subbase theorem | Statement: [Tychonoff theorem for products of compact spaces, canBeProvedUsing, Alexander subbase theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Alexander subbase theorem
Context triple: [Tychonoff theorem for products of compact spaces, canBeProvedUsing, Alexander subbase theorem]
  • A. Alexander subbase theorem chosen
    The Alexander subbase theorem is a fundamental result in general topology that characterizes compactness by requiring that every cover of a space by subbasic open sets has a finite subcover.
  • B. Subspace theorem
    The Subspace theorem is a fundamental result in Diophantine approximation that describes how solutions to certain inequalities involving linear forms over algebraic numbers must lie in a finite union of proper subspaces.
  • C. Szekeres–Lindström theorem
    The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
  • D. Hindman theorem
    Hindman theorem is a fundamental result in Ramsey theory stating that for any finite coloring of the natural numbers, there exists an infinite subset whose finite sums of distinct elements are all the same color.
  • E. Bose–Nair theorem
    The Bose–Nair theorem is a result in combinatorial design theory that provides conditions for the existence and construction of certain balanced incomplete block designs, contributing to the foundations of modern combinatorics and coding theory.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (3 batches)

The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.

Step Stage Batch ID Status When
creating Elicitation batch_69d883813098819084f5409539723b59 completed April 10, 2026, 4:58 a.m.
NER Named-entity recognition batch_69e32dd32e048190a9eadd32d6b9374c completed April 18, 2026, 7:08 a.m.
NED1 Entity disambiguation (via context triple) batch_6a00581c24508190b4888357828fed80 completed May 10, 2026, 10:04 a.m.
Created at: April 10, 2026, 5:13 a.m.