Triple

T10462076
Position Surface form Disambiguated ID Type / Status
Subject Selberg sieve E246699 entity
Predicate hasVariant P455 FINISHED
Object Selberg upper bound sieve E246699 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: Selberg upper bound sieve | Statement: [Selberg sieve, hasVariant, Selberg upper bound sieve]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Selberg upper bound sieve
Context triple: [Selberg sieve, hasVariant, Selberg upper bound sieve]
  • A. Selberg sieve chosen
    The Selberg sieve is a powerful analytic number theory method developed by Atle Selberg for estimating the size of sets of integers filtered by divisibility conditions, particularly in the study of prime numbers.
  • B. Selberg–Delange method results
    Selberg–Delange method results are asymptotic formulas in analytic number theory that precisely describe the average order and distribution of multiplicative arithmetic functions using complex-analytic techniques.
  • C. Bombieri–Vinogradov theorem
    The Bombieri–Vinogradov theorem is a major result in analytic number theory that gives strong average estimates for the distribution of prime numbers in arithmetic progressions, approaching what is predicted by the Generalized Riemann Hypothesis.
  • 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. Siegel’s theorem on zeros of L-functions
    Siegel’s theorem on zeros of L-functions is a result in analytic number theory that gives strong bounds on how close nontrivial zeros of Dirichlet L-functions can approach 1, with deep implications for the distribution of primes in arithmetic progressions.
  • 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_69d381c16c248190a2fe5b471e584e9c completed April 6, 2026, 9:49 a.m.
NER Named-entity recognition batch_69d50884fac48190af22e181b1492557 completed April 7, 2026, 1:37 p.m.
NED1 Entity disambiguation (via context triple) batch_69d89fcc84b48190a39de0d9b9111ebd completed April 10, 2026, 6:59 a.m.
Created at: April 6, 2026, 12:19 p.m.