Triple
T1489782
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Noether's problem |
E29549
|
entity |
| Predicate | knownResult |
P28576
|
FINISHED |
| Object |
Swan constructed counterexamples over the rational numbers
Swan constructed counterexamples over the rational numbers refers to Richard G. Swan’s landmark result showing that certain invariant fields under finite group actions over the rational numbers are not rational, thereby disproving a general affirmative answer to Noether’s problem in this setting.
|
E171228
|
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: Swan constructed counterexamples over the rational numbers | Statement: [Noether's problem, knownResult, Swan constructed counterexamples over the rational numbers]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Swan constructed counterexamples over the rational numbers Context triple: [Noether's problem, knownResult, Swan constructed counterexamples over the rational numbers]
-
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.
Kronecker’s finitism
Kronecker’s finitism is a philosophical and mathematical stance asserting that only finite, constructible mathematical objects and proofs are legitimate, rejecting the existence of actual infinities.
-
C.
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.
-
D.
Israel–Carter–Robinson uniqueness theorems
The Israel–Carter–Robinson uniqueness theorems are a set of results in general relativity showing that stationary, asymptotically flat black holes in four-dimensional spacetime are completely characterized by just their mass, charge, and angular momentum.
-
E.
Surreal numbers
Surreal numbers are a class of numbers introduced by John H. Conway that form an extensive ordered field encompassing the real numbers, infinite quantities, and infinitesimals within a unified framework.
- 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: Swan constructed counterexamples over the rational numbers Triple: [Noether's problem, knownResult, Swan constructed counterexamples over the rational numbers]
Generated description
Swan constructed counterexamples over the rational numbers refers to Richard G. Swan’s landmark result showing that certain invariant fields under finite group actions over the rational numbers are not rational, thereby disproving a general affirmative answer to Noether’s problem in this setting.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Swan constructed counterexamples over the rational numbers Target entity description: Swan constructed counterexamples over the rational numbers refers to Richard G. Swan’s landmark result showing that certain invariant fields under finite group actions over the rational numbers are not rational, thereby disproving a general affirmative answer to Noether’s problem in this setting.
-
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.
Kronecker’s finitism
Kronecker’s finitism is a philosophical and mathematical stance asserting that only finite, constructible mathematical objects and proofs are legitimate, rejecting the existence of actual infinities.
-
C.
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.
-
D.
Israel–Carter–Robinson uniqueness theorems
The Israel–Carter–Robinson uniqueness theorems are a set of results in general relativity showing that stationary, asymptotically flat black holes in four-dimensional spacetime are completely characterized by just their mass, charge, and angular momentum.
-
E.
Surreal numbers
Surreal numbers are a class of numbers introduced by John H. Conway that form an extensive ordered field encompassing the real numbers, infinite quantities, and infinitesimals within a unified framework.
- 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_69a498da82e08190ba833330d05f380f |
completed | March 1, 2026, 7:51 p.m. |
| NER | Named-entity recognition | batch_69a4c9e02c188190b87c0aac939eafdd |
completed | March 1, 2026, 11:21 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ad1ca98e64819097916eb7717e6364 |
completed | March 8, 2026, 6:52 a.m. |
| NEDg | Description generation | batch_69ad1d34656481909949b4bfd83c6142 |
completed | March 8, 2026, 6:54 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69ad1dd7b34c8190b6957be2112506dd |
completed | March 8, 2026, 6:57 a.m. |
Created at: March 1, 2026, 8:12 p.m.