Triple

T18479631
Position Surface form Disambiguated ID Type / Status
Subject Waring's problem E451523 entity
Predicate hasVariant P455 FINISHED
Object Waring–Goldbach problem 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: Waring–Goldbach problem | Statement: [Waring's problem, hasVariant, Waring–Goldbach problem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Waring–Goldbach problem
Context triple: [Waring's problem, hasVariant, Waring–Goldbach problem]
  • A. Waring's problem chosen
    Waring's problem is a famous conjecture in number theory that concerns representing natural numbers as sums of fixed powers of integers and determining how many such powers are needed.
  • B. 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.
  • C. Fermat polygonal number theorem
    The Fermat polygonal number theorem is a result in number theory stating that every positive integer can be expressed as a sum of a fixed number of polygonal numbers of a given order.
  • D. Hardy–Littlewood circle method
    The Hardy–Littlewood circle method is a powerful analytic number theory technique that uses complex analysis and Fourier series to study additive problems such as Waring’s problem and the Goldbach conjecture.
  • E. Hardy–Ramanujan asymptotic formula
    The Hardy–Ramanujan asymptotic formula is a landmark result in number theory that gives an approximate expression for the partition function p(n), describing how the number of integer partitions of n grows rapidly with n.
  • 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_69e53065e8388190bb216dae89f8cf75 completed April 19, 2026, 7:43 p.m.
Created at: April 10, 2026, 11:35 a.m.