Triple
T10462078
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Selberg sieve |
E246699
|
entity |
| Predicate | contrastedWith |
P278
|
FINISHED |
| Object |
Brun combinatorial sieve
The Brun combinatorial sieve is a classical number-theoretic sieving method, developed by Viggo Brun, that uses combinatorial techniques to estimate the distribution of integers free of small prime factors and was historically applied to problems like twin primes.
|
E865105
|
NE FINISHED |
How this triple was built (4 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: Brun combinatorial sieve | Statement: [Selberg sieve, contrastedWith, Brun combinatorial sieve]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Brun combinatorial sieve Context triple: [Selberg sieve, contrastedWith, Brun combinatorial sieve]
-
A.
Selberg sieve
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.
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.
-
D.
Turán–Kubilius inequality
The Turán–Kubilius inequality is a fundamental result in probabilistic number theory that provides bounds on the distribution of additive arithmetic functions.
-
E.
Dirichlet hyperbola method
The Dirichlet hyperbola method is a technique in analytic number theory used to estimate sums of arithmetic functions by splitting double sums along a hyperbola to obtain asymptotic formulas.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Brun combinatorial sieve Triple: [Selberg sieve, contrastedWith, Brun combinatorial sieve]
Generated description
The Brun combinatorial sieve is a classical number-theoretic sieving method, developed by Viggo Brun, that uses combinatorial techniques to estimate the distribution of integers free of small prime factors and was historically applied to problems like twin primes.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Brun combinatorial sieve Target entity description: The Brun combinatorial sieve is a classical number-theoretic sieving method, developed by Viggo Brun, that uses combinatorial techniques to estimate the distribution of integers free of small prime factors and was historically applied to problems like twin primes.
-
A.
Selberg sieve
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.
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.
-
D.
Turán–Kubilius inequality
The Turán–Kubilius inequality is a fundamental result in probabilistic number theory that provides bounds on the distribution of additive arithmetic functions.
-
E.
Dirichlet hyperbola method
The Dirichlet hyperbola method is a technique in analytic number theory used to estimate sums of arithmetic functions by splitting double sums along a hyperbola to obtain asymptotic formulas.
- F. None of above. chosen
Provenance (5 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. |
| NEDg | Description generation | batch_69d8a1656b348190ba932d03402d6a4d |
completed | April 10, 2026, 7:06 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69d8a2b82bb48190899f37a967fef444 |
completed | April 10, 2026, 7:11 a.m. |
Created at: April 6, 2026, 12:19 p.m.