Triple
T1862418
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Helmut Hasse |
E34844
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Hasse–Arf theorem
The Hasse–Arf theorem is a fundamental result in algebraic number theory that precisely characterizes the jumps in the ramification filtration of abelian extensions of local fields, showing they occur at integer values.
|
E207315
|
NE FINISHED |
How this triple was built (4 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: Hasse–Arf theorem | Statement: [Helmut Hasse, notableWork, Hasse–Arf theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hasse–Arf theorem Context triple: [Helmut Hasse, notableWork, Hasse–Arf theorem]
-
A.
Hilbert’s irreducibility theorem
Hilbert’s irreducibility theorem is a fundamental result in number theory and algebraic geometry that ensures many polynomial equations with parameterized coefficients retain irreducibility for infinitely many specializations of those parameters.
-
B.
Gauss’s lemma in number theory
Gauss’s lemma in number theory is a result that relates the Legendre symbol to the number of sign changes in a certain sequence of multiples, providing a practical criterion for determining quadratic residues modulo an odd prime.
-
C.
Deuring reduction theorem
The Deuring reduction theorem is a result in number theory that relates the reduction of elliptic curves with complex multiplication modulo primes to the theory of quaternion algebras and endomorphism rings.
-
D.
Hilbert’s Nullstellensatz
Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
-
E.
Birch and Swinnerton-Dyer Conjecture
The Birch and Swinnerton-Dyer Conjecture is a central unsolved problem in number theory that predicts a deep connection between the arithmetic of rational points on an elliptic curve and the behavior of its associated L-function at a specific value.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Hasse–Arf theorem Triple: [Helmut Hasse, notableWork, Hasse–Arf theorem]
Generated description
The Hasse–Arf theorem is a fundamental result in algebraic number theory that precisely characterizes the jumps in the ramification filtration of abelian extensions of local fields, showing they occur at integer values.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Hasse–Arf theorem Target entity description: The Hasse–Arf theorem is a fundamental result in algebraic number theory that precisely characterizes the jumps in the ramification filtration of abelian extensions of local fields, showing they occur at integer values.
-
A.
Hilbert’s irreducibility theorem
Hilbert’s irreducibility theorem is a fundamental result in number theory and algebraic geometry that ensures many polynomial equations with parameterized coefficients retain irreducibility for infinitely many specializations of those parameters.
-
B.
Gauss’s lemma in number theory
Gauss’s lemma in number theory is a result that relates the Legendre symbol to the number of sign changes in a certain sequence of multiples, providing a practical criterion for determining quadratic residues modulo an odd prime.
-
C.
Deuring reduction theorem
The Deuring reduction theorem is a result in number theory that relates the reduction of elliptic curves with complex multiplication modulo primes to the theory of quaternion algebras and endomorphism rings.
-
D.
Hilbert’s Nullstellensatz
Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
-
E.
Birch and Swinnerton-Dyer Conjecture
The Birch and Swinnerton-Dyer Conjecture is a central unsolved problem in number theory that predicts a deep connection between the arithmetic of rational points on an elliptic curve and the behavior of its associated L-function at a specific value.
- F. None of above. chosen
Provenance (5 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_69a88600b2f88190bc09303e68ab517e |
completed | March 4, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69abb09e714881909cef0f7e77b5b3b9 |
completed | March 7, 2026, 4:59 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69add1d026748190a507872de85c908d |
completed | March 8, 2026, 7:45 p.m. |
| NEDg | Description generation | batch_69add27390b08190942b1fa6fcab1e44 |
completed | March 8, 2026, 7:48 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69add305bd108190b5e7e0f3d30a2c58 |
completed | March 8, 2026, 7:50 p.m. |
Created at: March 4, 2026, 7:34 p.m.