Triple

T22423370
Position Surface form Disambiguated ID Type / Status
Subject Erdős–Turán conjecture E554303 entity
Predicate strongerThan P24323 FINISHED
Object Green–Tao theorem for primes 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: Green–Tao theorem for primes | Statement: [Erdős–Turán conjecture, strongerThan, Green–Tao theorem for primes]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Green–Tao theorem for primes
Context triple: [Erdős–Turán conjecture, strongerThan, Green–Tao theorem for primes]
  • 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. Bounded gaps between primes
    "Bounded gaps between primes" is a landmark 2013 result in analytic number theory proving that there exist infinitely many pairs of distinct prime numbers separated by a finite, fixed upper bound.
  • 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 (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.