Triple

T12026558
Position Surface form Disambiguated ID Type / Status
Subject Green–Tao theorem E286292 entity
Predicate relatedTo P37 FINISHED
Object Hardy–Littlewood prime tuples conjecture E120396 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: Hardy–Littlewood prime tuples conjecture | Statement: [Green–Tao theorem, relatedTo, Hardy–Littlewood prime tuples conjecture]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Hardy–Littlewood prime tuples conjecture
Context triple: [Green–Tao theorem, relatedTo, Hardy–Littlewood prime tuples conjecture]
  • A. Hardy–Littlewood conjectures chosen
    The Hardy–Littlewood conjectures are a collection of influential unproven hypotheses in analytic number theory that generalize the prime number theorem to describe the distribution of prime numbers and prime constellations.
  • B. Bateman–Horn conjecture
    The Bateman–Horn conjecture is a far-reaching unproven statement in number theory that predicts how often sets of polynomial expressions simultaneously take prime values, generalizing several earlier conjectures about the distribution of prime numbers.
  • C. 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.
  • D. twin prime conjecture
    The twin prime conjecture is an unsolved problem in number theory asserting that there are infinitely many pairs of prime numbers that differ by 2.
  • E. 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.
  • 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_69d6ab4669e48190b59246358b0383ab completed April 8, 2026, 7:23 p.m.
NER Named-entity recognition batch_69d903f02638819091e0cc0e93fa5ea7 completed April 10, 2026, 2:06 p.m.
NED1 Entity disambiguation (via context triple) batch_69f48b8111b88190a42a8904a2d26862 completed May 1, 2026, 11:16 a.m.
Created at: April 8, 2026, 9:47 p.m.