Triple
T6117022
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | G. H. Hardy |
E136383
|
entity |
| Predicate | notableFor |
P22
|
FINISHED |
| Object | Hardy–Littlewood conjectures |
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 conjectures | Statement: [G. H. Hardy, notableFor, Hardy–Littlewood conjectures]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hardy–Littlewood conjectures Context triple: [G. H. Hardy, notableFor, Hardy–Littlewood conjectures]
-
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.
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.
-
D.
Vinogradov's three-primes theorem
Vinogradov's three-primes theorem is a landmark result in analytic number theory proving that every sufficiently large odd integer can be expressed as the sum of three prime numbers.
-
E.
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.
- 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_69c0089f851c81909e5e189a617dcff6 |
completed | March 22, 2026, 3:19 p.m. |
| NER | Named-entity recognition | batch_69c05beb4cfc8190ab67a5338ec59cea |
completed | March 22, 2026, 9:15 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c1256ddb38819095f582b6468db407 |
completed | March 23, 2026, 11:35 a.m. |
Created at: March 22, 2026, 4:14 p.m.