Triple
T20505622
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | William Burnside |
E503420
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | Burnside's problem |
—
|
NE NERFINISHED |
How this triple was built (3 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: Burnside's problem | Statement: [William Burnside, knownFor, Burnside's problem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Burnside's problem Context triple: [William Burnside, knownFor, Burnside's problem]
-
A.
Feit–Thompson theorem
The Feit–Thompson theorem is a landmark result in group theory that proves every finite group of odd order is solvable, marking the first major classification of a broad class of finite simple groups.
-
B.
Zassenhaus conjecture
The Zassenhaus conjecture is a prominent open problem in group theory concerning the structure of units in integral group rings and their relation to the underlying finite group.
-
C.
Hilbert’s second problem
Hilbert’s second problem is one of David Hilbert’s famous list of 23 problems, asking for a proof of the consistency of arithmetic from a finite set of axioms using finitary methods.
-
D.
Hilbert’s twenty-third problem
Hilbert’s twenty-third problem is one of David Hilbert’s famous list of unsolved problems, focusing on the further development and systematic application of the calculus of variations.
-
E.
Hilbert's first problem
Hilbert's first problem is one of David Hilbert’s famous list of 23 problems, asking whether there exists a set whose size is strictly between that of the integers and the real numbers, i.e., the status of the continuum hypothesis.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Burnside's problem Target entity description: Burnside's problem is a famous question in group theory asking whether a finitely generated group in which every element has finite order must necessarily be finite.
-
A.
Feit–Thompson theorem
The Feit–Thompson theorem is a landmark result in group theory that proves every finite group of odd order is solvable, marking the first major classification of a broad class of finite simple groups.
-
B.
Zassenhaus conjecture
The Zassenhaus conjecture is a prominent open problem in group theory concerning the structure of units in integral group rings and their relation to the underlying finite group.
-
C.
Hilbert’s second problem
Hilbert’s second problem is one of David Hilbert’s famous list of 23 problems, asking for a proof of the consistency of arithmetic from a finite set of axioms using finitary methods.
-
D.
Hilbert’s twenty-third problem
Hilbert’s twenty-third problem is one of David Hilbert’s famous list of unsolved problems, focusing on the further development and systematic application of the calculus of variations.
-
E.
Hilbert's first problem
Hilbert's first problem is one of David Hilbert’s famous list of 23 problems, asking whether there exists a set whose size is strictly between that of the integers and the real numbers, i.e., the status of the continuum hypothesis.
- F. None of above. chosen
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_69e0b4b1e52c8190894281cf7e3283ab |
completed | April 16, 2026, 10:06 a.m. |
| NER | Named-entity recognition | batch_69e69dc66f00819083c804535e045545 |
completed | April 20, 2026, 9:42 p.m. |
Created at: April 16, 2026, 11:35 a.m.