Triple
T6801014
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Lagrange's four-square theorem |
E156185
|
entity |
| Predicate | hasGeneralization |
P2372
|
FINISHED |
| Object | Waring's problem for k-th powers |
E451523
|
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: Waring's problem for k-th powers | Statement: [Lagrange's four-square theorem, hasGeneralization, Waring's problem for k-th powers]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Waring's problem for k-th powers Context triple: [Lagrange's four-square theorem, hasGeneralization, Waring's problem for k-th powers]
-
A.
Waring's problem
chosen
Waring's problem is a famous conjecture in number theory that concerns representing natural numbers as sums of fixed powers of integers and determining how many such powers are needed.
-
B.
Vinogradov's three-primes theorem
Vinogradov's three-primes theorem is a landmark result in analytic number theory proving that every sufficiently large odd integer can be expressed as the sum of three prime numbers.
-
C.
Fermat polygonal number theorem
The Fermat polygonal number theorem is a result in number theory stating that every positive integer can be expressed as a sum of a fixed number of polygonal numbers of a given order.
-
D.
Jacobi’s four-square theorem
Jacobi’s four-square theorem is a fundamental result in number theory that gives a precise formula for the number of ways an integer can be expressed as a sum of four squares.
-
E.
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.
- 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_69c68826e6a48190a3d220b541e639de |
completed | March 27, 2026, 1:37 p.m. |
| NER | Named-entity recognition | batch_69c6d2e595188190a0bb4b595df3adb2 |
completed | March 27, 2026, 6:56 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c71a9b0cc48190819380aeaf0228e7 |
completed | March 28, 2026, 12:02 a.m. |
Created at: March 27, 2026, 2:16 p.m.