Triple
T22423387
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Erdős–Turán conjecture |
E554303
|
entity |
| Predicate | contrastWith |
P278
|
FINISHED |
| Object | Szemerédi's theorem, which uses combinatorial density conditions |
—
|
NE NERFINISHED |
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: Szemerédi's theorem, which uses combinatorial density conditions | Statement: [Erdős–Turán conjecture, contrastWith, Szemerédi's theorem, which uses combinatorial density conditions]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Szemerédi's theorem, which uses combinatorial density conditions Context triple: [Erdős–Turán conjecture, contrastWith, Szemerédi's theorem, which uses combinatorial density conditions]
-
A.
Szemerédi's theorem
chosen
Szemerédi's theorem is a fundamental result in combinatorial number theory stating that any subset of the integers with positive upper density contains arbitrarily long arithmetic progressions.
-
B.
Green–Tao theorem
The Green–Tao theorem is a landmark result in number theory proving that the sequence of prime numbers contains arbitrarily long arithmetic progressions.
-
C.
Hales–Jewett theorem
The Hales–Jewett theorem is a fundamental result in Ramsey theory that guarantees the existence of large monochromatic combinatorial lines in high-dimensional grids under any finite coloring.
-
D.
Roth theorem
Roth's theorem is a fundamental result in Diophantine approximation that gives an essentially optimal bound on how well algebraic irrational numbers can be approximated by rational numbers.
-
E.
Graham–Rothschild theorem
The Graham–Rothschild theorem is a fundamental result in Ramsey theory that generalizes classical partition theorems to higher-dimensional combinatorial structures.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 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_69e11e4f2d0c819091aa3558ea2ee630 |
completed | April 16, 2026, 5:37 p.m. |
| NER | Named-entity recognition | batch_69f15a2af620819083338127e78137dc |
completed | April 29, 2026, 1:08 a.m. |
Created at: April 16, 2026, 8:47 p.m.