Triple

T18479632
Position Surface form Disambiguated ID Type / Status
Subject Waring's problem E451523 entity
Predicate hasVariant P455 FINISHED
Object Waring's problem 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: Waring's problem for primes | Statement: [Waring's problem, hasVariant, Waring's problem for primes]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Waring's problem for primes
Context triple: [Waring's problem, hasVariant, Waring's problem for primes]
  • A. 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.
  • B. 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.
  • C. Piatetski-Shapiro prime number theorem
    The Piatetski-Shapiro prime number theorem is a result in analytic number theory that establishes the existence of infinitely many primes among the values of certain non-integer power sequences, such as ⌊n^c⌋ for suitable real exponents c.
  • D. Linnik’s theorem on the least prime in an arithmetic progression
    Linnik’s theorem on the least prime in an arithmetic progression is a result in analytic number theory that gives an explicit upper bound, depending only on the modulus, for the size of the smallest prime in any given coprime residue class.
  • E. results of Chen Jingrun on Goldbach-type problems
    The results of Chen Jingrun on Goldbach-type problems are landmark achievements in analytic number theory, most notably his theorem showing that every sufficiently large even integer can be expressed as the sum of a prime and a number with at most two prime factors (a “Chen prime” representation).
  • 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.