Triple
T15502767
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Continued Fractions |
E379001
|
entity |
| Predicate | includes |
P1393
|
FINISHED |
| Object | Khintchine’s constant |
E378994
|
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: Khintchine’s constant | Statement: [Continued Fractions, includes, Khintchine’s constant]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Khintchine’s constant Context triple: [Continued Fractions, includes, Khintchine’s constant]
-
A.
Khinchin's constant
chosen
Khinchin's constant is a mathematical constant that arises in metric number theory, describing the almost-sure geometric mean of the partial quotients in the continued fraction expansions of real numbers.
-
B.
Khinchin–Lévy constant
The Khinchin–Lévy constant is a mathematical constant arising in metric number theory and continued fractions, describing the typical exponential growth rate of the denominators of convergents for almost all real numbers.
-
C.
Khintchine theorem
Khintchine theorem is a fundamental result in metric Diophantine approximation that characterizes, via a simple convergence–divergence criterion, when almost all real numbers admit infinitely many rational approximations of a prescribed quality.
-
D.
Khinchin's representation theorem
Khinchin's representation theorem is a result in probability theory that characterizes stationary stochastic processes by representing them in terms of simpler, more fundamental random components.
-
E.
Gauss–Kuzmin distribution
The Gauss–Kuzmin distribution is a probability distribution that describes the limiting frequency of digits in the continued fraction expansions of almost all real numbers.
- 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_69d85cd53a7c819080f5b9042c4c199e |
completed | April 10, 2026, 2:13 a.m. |
| NER | Named-entity recognition | batch_69e03fcc5bb88190b8a9a81419a9a38b |
completed | April 16, 2026, 1:47 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ff56b9238081908fb2e6a7dcc2296f |
completed | May 9, 2026, 3:46 p.m. |
Created at: April 10, 2026, 3:54 a.m.