Triple
T10991440
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Simpson's rule |
E259761
|
entity |
| Predicate | exactForPolynomialsUpToDegree |
P81377
|
FINISHED |
| Object | 3 |
—
|
LITERAL 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: 3 | Statement: [Simpson's rule, exactForPolynomialsUpToDegree, 3]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: exactForPolynomialsUpToDegree Context triple: [Simpson's rule, exactForPolynomialsUpToDegree, 3]
-
A.
appliesToPolynomialsOf
chosen
Indicates that a rule, operation, or property is defined for and relevant to polynomials of a specified type or form.
-
B.
arePolynomialsIn
Indicates that the specified expressions are polynomials in the given variable(s) or over the given ring/field.
-
C.
hasAssociatedPolynomial
Indicates that one entity is linked to another entity that serves as its associated polynomial, typically representing or characterizing some of its properties or behavior.
-
D.
minimalPolynomialOverR
Indicates that one element is the minimal (monic) polynomial over the real numbers for which another element is a root, capturing the smallest-degree real-coefficient polynomial that annihilates it.
-
E.
hasMinimalPolynomialOverQ
Indicates that one element is the minimal polynomial over the rational numbers ℚ of another element, i.e., the monic irreducible polynomial in ℚ[x] for which that element is a root.
- F. None of above.
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_69d6aa8a6a548190a750f944ccdc8064 |
completed | April 8, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69d795d1e918819090c71f5a077fa15a |
completed | April 9, 2026, 12:04 p.m. |
| PD | Predicate disambiguation | batch_69d72e93ac648190b46c5d12bf3eb1e9 |
completed | April 9, 2026, 4:44 a.m. |
Created at: April 8, 2026, 9:24 p.m.