Triple
T9867907
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Hans Zassenhaus |
E239880
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
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.
|
E827066
|
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: Zassenhaus conjecture | Statement: [Hans Zassenhaus, notableWork, Zassenhaus conjecture]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Zassenhaus conjecture Context triple: [Hans Zassenhaus, notableWork, Zassenhaus conjecture]
-
A.
Schreier refinement theorem
The Schreier refinement theorem is a result in group theory stating that any two subnormal series of a group admit equivalent refinements, serving as a precursor and companion to the Jordan–Hölder theorem.
-
B.
Noether's isomorphism theorems
Noether's isomorphism theorems are fundamental results in abstract algebra that relate quotient structures and substructures of groups, rings, and modules, providing a unifying framework for understanding homomorphic images and factor structures.
-
C.
Jordan–Hölder theorem
The Jordan–Hölder theorem is a fundamental result in group theory stating that any two composition series of a finite group have the same length and the same (up to order and isomorphism) simple factor groups.
-
D.
Noether's problem
Noether's problem is a fundamental question in invariant theory and field theory that asks whether the fixed field of a finite group acting on a rational function field is itself a purely transcendental (rational) extension.
-
E.
Conway–Norton collaboration
The Conway–Norton collaboration was a joint mathematical effort, led by John Conway and Simon Norton, that played a key role in developing the theory of monstrous moonshine and the construction of the Monster group.
- 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: Zassenhaus conjecture Triple: [Hans Zassenhaus, notableWork, Zassenhaus conjecture]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Zassenhaus conjecture Target entity description: 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.
-
A.
Schreier refinement theorem
The Schreier refinement theorem is a result in group theory stating that any two subnormal series of a group admit equivalent refinements, serving as a precursor and companion to the Jordan–Hölder theorem.
-
B.
Noether's isomorphism theorems
Noether's isomorphism theorems are fundamental results in abstract algebra that relate quotient structures and substructures of groups, rings, and modules, providing a unifying framework for understanding homomorphic images and factor structures.
-
C.
Jordan–Hölder theorem
The Jordan–Hölder theorem is a fundamental result in group theory stating that any two composition series of a finite group have the same length and the same (up to order and isomorphism) simple factor groups.
-
D.
Noether's problem
Noether's problem is a fundamental question in invariant theory and field theory that asks whether the fixed field of a finite group acting on a rational function field is itself a purely transcendental (rational) extension.
-
E.
Conway–Norton collaboration
The Conway–Norton collaboration was a joint mathematical effort, led by John Conway and Simon Norton, that played a key role in developing the theory of monstrous moonshine and the construction of the Monster group.
- 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_69ca84e7506c819095cbde4ff16512bb |
completed | March 30, 2026, 2:12 p.m. |
| NER | Named-entity recognition | batch_69cdb3d34e4c81908c0fc14dd6d015cc |
completed | April 2, 2026, 12:09 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d1e45add0481909a0416035054a563 |
completed | April 5, 2026, 4:26 a.m. |
| NEDg | Description generation | batch_69d1e62832b081908de7872f62505f6c |
completed | April 5, 2026, 4:33 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69d1e69041e881909fc31e35e9bfc4f3 |
completed | April 5, 2026, 4:35 a.m. |
Created at: March 30, 2026, 8:36 p.m.