Triple
T18479914
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | twin prime conjecture |
E451529
|
entity |
| Predicate | historicalAttribution |
P9909
|
FINISHED |
| Object | studied by Terence Tao |
—
|
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: studied by Terence Tao | Statement: [twin prime conjecture, historicalAttribution, studied by Terence Tao]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: studied by Terence Tao Context triple: [twin prime conjecture, historicalAttribution, studied by Terence Tao]
-
A.
Terence Tao
chosen
Terence Tao is an Australian-American mathematician renowned for his groundbreaking work in harmonic analysis, partial differential equations, additive combinatorics, and analytic number theory.
-
B.
Gowers blog on mathematics
Gowers blog on mathematics is a widely read online mathematics blog by Fields Medalist Timothy Gowers, featuring expository posts, research discussions, and commentary on mathematical practice and culture.
-
C.
Polymath Project
The Polymath Project is a large-scale online collaboration in which mathematicians and enthusiasts worldwide work together openly to solve difficult mathematical problems.
-
D.
Erdős discrepancy problem
The Erdős discrepancy problem is a famous question in combinatorial number theory that asks whether every infinite ±1 sequence has arbitrarily large discrepancy along some homogeneous arithmetic progression.
-
E.
Szemerédi's theorem
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.
- 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_69d8d38465a0819099b9b42d2a662ac1 |
completed | April 10, 2026, 10:40 a.m. |
| NER | Named-entity recognition | batch_69e53066a7108190a50eda9b489c90ca |
completed | April 19, 2026, 7:43 p.m. |
Created at: April 10, 2026, 11:35 a.m.