Triple

T12026623
Position Surface form Disambiguated ID Type / Status
Subject Ben Green E286293 entity
Predicate notableTheorem P29208 FINISHED
Object Green–Tao theorem E286292 NE FINISHED

How this triple was built (3 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: Green–Tao theorem | Statement: [Ben Green, notableTheorem, Green–Tao theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Green–Tao theorem
Context triple: [Ben Green, notableTheorem, Green–Tao theorem]
  • A. Green–Tao theorem chosen
    The Green–Tao theorem is a landmark result in number theory proving that the sequence of prime numbers contains arbitrarily long arithmetic progressions.
  • B. 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.
  • C. Dirichlet's theorem on arithmetic progressions
    Dirichlet's theorem on arithmetic progressions is a fundamental result in number theory stating that any arithmetic progression with first term and difference coprime contains infinitely many prime numbers.
  • D. Erdős–Turán conjecture
    The Erdős–Turán conjecture is an unsolved problem in additive number theory asserting that any subset of the positive integers with divergent sum of reciprocals must contain arbitrarily long arithmetic progressions.
  • E. 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.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
PD Predicate disambiguation gpt-5-mini-2025-08-07
Target predicate: notableTheorem
Context triple: [Ben Green, notableTheorem, Green–Tao theorem]
  • A. hasTheorem
    Indicates that one entity (typically a mathematical theory, field, or work) includes, establishes, or is associated with a particular theorem.
  • B. notableTheorist
    Indicates that the subject is recognized as a significant or influential theorist in relation to the object or specified field.
  • C. hasTheoremNamedAfter chosen
    Indicates that a theorem is named in honor of or after a particular person or entity.
  • D. notableFor
    Indicates that an entity is especially recognized or distinguished for a particular quality, achievement, characteristic, or role.
  • E. notableProposition
    Indicates that a subject is associated with a proposition, statement, or claim that is considered notable or significant in some context.
  • F. None of above.

Provenance (4 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_69d6ab4669e48190b59246358b0383ab completed April 8, 2026, 7:23 p.m.
NER Named-entity recognition batch_69d9100b4ca8819084845ca4c13e34ce completed April 10, 2026, 2:58 p.m.
NED1 Entity disambiguation (via context triple) batch_69f60a5f724c819082aa589372dff020 completed May 2, 2026, 2:29 p.m.
PD Predicate disambiguation batch_69d902b6ebbc8190b13c44a61c6f81b9 completed April 10, 2026, 2:01 p.m.
Created at: April 8, 2026, 9:47 p.m.