Triple
T6293421
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Jakob Bernoulli |
E141073
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | Bernoulli numbers |
E141076
|
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: Bernoulli numbers | Statement: [Jakob Bernoulli, knownFor, Bernoulli numbers]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Bernoulli numbers Context triple: [Jakob Bernoulli, knownFor, Bernoulli numbers]
-
A.
Bernoulli numbers
chosen
Bernoulli numbers are a sequence of rational numbers that play a central role in number theory and analysis, especially in formulas for sums of powers of integers and in the study of special functions like the Riemann zeta function.
-
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.
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.
-
D.
Bernstein polynomials
Bernstein polynomials are a family of polynomials used in approximation theory that provide a constructive proof of the Weierstrass approximation theorem by uniformly approximating continuous functions on a closed interval.
-
E.
Chebyshev functions
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.
- 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_69c008cdf2ac8190bb640c94478fb4ed |
completed | March 22, 2026, 3:20 p.m. |
| NER | Named-entity recognition | batch_69c0642017588190b6c99c685653f6c2 |
completed | March 22, 2026, 9:50 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c51988f1388190b36212b0d9756863 |
completed | March 26, 2026, 11:33 a.m. |
Created at: March 22, 2026, 4:27 p.m.