Triple
T22668826
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Chevalley–Warning theorem |
E559864
|
entity |
| Predicate | hasVariant |
P455
|
FINISHED |
| Object | Warning’s second theorem |
—
|
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: Warning’s second theorem | Statement: [Chevalley–Warning theorem, hasVariant, Warning’s second theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Warning’s second theorem Context triple: [Chevalley–Warning theorem, hasVariant, Warning’s second theorem]
-
A.
Chevalley–Warning theorem
chosen
The Chevalley–Warning theorem is a result in number theory and algebraic geometry that gives conditions under which systems of polynomial equations over finite fields must have nontrivial solutions.
-
B.
Szekeres–Lindström theorem
The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
-
C.
Kesten’s theorem
Kesten’s theorem is a fundamental result in probability theory that characterizes when a random walk on a group is transient or recurrent, with deep implications for random walks on groups and percolation theory.
-
D.
Reynolds abstraction theorem
The Reynolds abstraction theorem is a foundational result in type theory and programming language semantics that formally characterizes parametric polymorphism and explains why polymorphic functions behave uniformly across all their type instantiations.
-
E.
Doignon’s theorem
Doignon’s theorem is a discrete analogue of Helly’s theorem that characterizes when a family of convex sets in Euclidean space has an integer point in common based on the intersections of small subfamilies.
- 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_69e2454a158c819093b8e35f5045efb6 |
completed | April 17, 2026, 2:35 p.m. |
| NER | Named-entity recognition | batch_69f1781de1d48190947cb1bb9d0890d9 |
completed | April 29, 2026, 3:16 a.m. |
Created at: April 17, 2026, 3:09 p.m.