Triple
T12597117
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Chebyshev functions |
E300761
|
entity |
| Predicate | includes |
P1393
|
FINISHED |
| Object | Chebyshev function θ(x) |
E300761
|
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: Chebyshev function θ(x) | Statement: [Chebyshev functions, includes, Chebyshev function θ(x)]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Chebyshev function θ(x) Context triple: [Chebyshev functions, includes, Chebyshev function θ(x)]
-
A.
Chebyshev functions
chosen
Chebyshev functions are arithmetic functions in number theory that encode information about the distribution of prime numbers and play a key role in analytic approaches to the prime number theorem.
-
B.
Riemann–Siegel theta function
The Riemann–Siegel theta function is a special function that appears in the study of the Riemann zeta function, used to express its values on the critical line in a form suitable for high-precision numerical computation.
-
C.
Chebyshev’s estimates for π(x)
Chebyshev’s estimates for π(x) are 19th-century bounds on the prime-counting function that showed it grows on the order of x/log x and provided a crucial precursor to the prime number theorem.
-
D.
Euler’s totient function φ(n)
Euler’s totient function φ(n) is a fundamental arithmetic function in number theory that counts the positive integers up to n that are relatively prime to n and plays a key role in topics such as modular arithmetic and cryptography.
-
E.
Siegel–Walfisz theorem
The Siegel–Walfisz theorem is a result in analytic number theory that gives strong uniform estimates for the distribution of prime numbers in arithmetic progressions with relatively small moduli.
- 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_69d7bdea2ca881908f379526c13b1145 |
completed | April 9, 2026, 2:55 p.m. |
| NER | Named-entity recognition | batch_69d954cf33b88190bff339fcd3142cc8 |
completed | April 10, 2026, 7:51 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f65ec75fc08190aa13cbb0161eb35c |
completed | May 2, 2026, 8:29 p.m. |
Created at: April 9, 2026, 5:08 p.m.