Triple

T18479664
Position Surface form Disambiguated ID Type / Status
Subject Goldbach conjecture E451524 entity
Predicate isPartOf P10 FINISHED
Object Landau problems NE NERFINISHED

How this triple was built (3 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: Landau problems | Statement: [Goldbach conjecture, isPartOf, Landau problems]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Landau problems
Context triple: [Goldbach conjecture, isPartOf, Landau problems]
  • A. Unsolved Problems in Number Theory
    *Unsolved Problems in Number Theory* is a classic reference book that surveys a wide range of open questions and conjectures in number theory, often with historical context and extensive bibliographic notes.
  • B. Waring's problem
    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. Riemann hypothesis
    The Riemann hypothesis is a famous unsolved conjecture in number theory asserting that all nontrivial zeros of the Riemann zeta function lie on a critical line in the complex plane, with deep implications for the distribution of prime numbers.
  • D. Hardy–Littlewood conjectures
    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.
  • E. Hilbert problems
    The Hilbert problems are a famous list of 23 unsolved mathematical problems presented by David Hilbert in 1900 that profoundly influenced the development of 20th-century mathematics.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Landau problems
Target entity description: Landau problems are a set of four famous unsolved problems in number theory highlighted by Edmund Landau in 1912, each concerning the distribution of prime numbers.
  • A. Unsolved Problems in Number Theory
    *Unsolved Problems in Number Theory* is a classic reference book that surveys a wide range of open questions and conjectures in number theory, often with historical context and extensive bibliographic notes.
  • B. Waring's problem
    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. Riemann hypothesis
    The Riemann hypothesis is a famous unsolved conjecture in number theory asserting that all nontrivial zeros of the Riemann zeta function lie on a critical line in the complex plane, with deep implications for the distribution of prime numbers.
  • D. Hardy–Littlewood conjectures
    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.
  • E. Hilbert problems
    The Hilbert problems are a famous list of 23 unsolved mathematical problems presented by David Hilbert in 1900 that profoundly influenced the development of 20th-century mathematics.
  • F. None of above. chosen

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_69e53066a7108190a50eda9b489c90ca completed April 19, 2026, 7:43 p.m.
Created at: April 10, 2026, 11:35 a.m.