Triple
T18117814
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | James Stirling |
E433653
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Stirling’s approximation |
—
|
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: Stirling’s approximation | Statement: [James Stirling, notableWork, Stirling’s approximation]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Stirling’s approximation Context triple: [James Stirling, notableWork, Stirling’s approximation]
-
A.
Stirling's approximation
chosen
Stirling's approximation is a classical formula in mathematics that provides an efficient asymptotic estimate for factorials and the gamma function, especially for large arguments.
-
B.
Euler–Maclaurin summation formula
The Euler–Maclaurin summation formula is a fundamental result in analysis that connects sums and integrals, providing powerful asymptotic expansions and error estimates for approximating series by integrals.
-
C.
Legendre’s formula for valuations of factorials
Legendre’s formula for valuations of factorials is a number-theoretic result that expresses the exponent of a prime in the prime factorization of n! as a sum of integer divisions of n by successive powers of that prime.
-
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.
Euler–Mascheroni constant γ
The Euler–Mascheroni constant γ is a mathematical constant that arises in analysis and number theory, defined as the limiting difference between the harmonic series and the natural logarithm.
- 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_69d8b909e8cc81908df4cc2b8ea6d11f |
completed | April 10, 2026, 8:47 a.m. |
| NER | Named-entity recognition | batch_69e4ddd737708190863fba97cdc20d88 |
completed | April 19, 2026, 1:51 p.m. |
Created at: April 10, 2026, 10:28 a.m.