Triple
T19050472
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Dirichlet |
E466243
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | Dirichlet hyperbola method |
—
|
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: Dirichlet hyperbola method | Statement: [Dirichlet, knownFor, Dirichlet hyperbola method]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Dirichlet hyperbola method Context triple: [Dirichlet, knownFor, Dirichlet hyperbola method]
-
A.
Dirichlet hyperbola method
chosen
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.
-
B.
Ramanujan’s sum
Ramanujan’s sum is a number-theoretic function introduced by Srinivasa Ramanujan, expressing certain periodic arithmetic functions as finite trigonometric sums over primitive roots of unity.
-
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.
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.
-
E.
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.
- 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_69d8dd040fb881909af2a964f65ad208 |
completed | April 10, 2026, 11:20 a.m. |
| NER | Named-entity recognition | batch_69e5dc02597c8190b39fd2c7b7e42258 |
completed | April 20, 2026, 7:55 a.m. |
Created at: April 10, 2026, 12:03 p.m.