Triple
T5658020
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Emil Artin |
E124666
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Artin–Wedderburn theorem
The Artin–Wedderburn theorem is a fundamental result in ring theory that classifies all semisimple rings as finite direct products of matrix rings over division rings.
|
E537779
|
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: Artin–Wedderburn theorem | Statement: [Emil Artin, notableWork, Artin–Wedderburn theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Artin–Wedderburn theorem Context triple: [Emil Artin, notableWork, Artin–Wedderburn theorem]
-
A.
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.
-
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.
Gelfand–Naimark theorem
The Gelfand–Naimark theorem is a foundational result in functional analysis that characterizes C*-algebras as algebras of bounded operators on a Hilbert space (and, in the commutative case, as algebras of continuous functions on a locally compact Hausdorff space).
-
D.
Hilbert’s syzygy theorem
Hilbert’s syzygy theorem is a fundamental result in commutative algebra that describes the finite length and structure of free resolutions of modules over polynomial rings.
-
E.
Kronecker–Weber theorem
The Kronecker–Weber theorem is a fundamental result in algebraic number theory stating that every finite abelian extension of the rational numbers is contained in a cyclotomic field generated by roots of unity.
- 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: Artin–Wedderburn theorem Triple: [Emil Artin, notableWork, Artin–Wedderburn theorem]
Generated description
The Artin–Wedderburn theorem is a fundamental result in ring theory that classifies all semisimple rings as finite direct products of matrix rings over division rings.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Artin–Wedderburn theorem Target entity description: The Artin–Wedderburn theorem is a fundamental result in ring theory that classifies all semisimple rings as finite direct products of matrix rings over division rings.
-
A.
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.
-
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.
Gelfand–Naimark theorem
The Gelfand–Naimark theorem is a foundational result in functional analysis that characterizes C*-algebras as algebras of bounded operators on a Hilbert space (and, in the commutative case, as algebras of continuous functions on a locally compact Hausdorff space).
-
D.
Hilbert’s syzygy theorem
Hilbert’s syzygy theorem is a fundamental result in commutative algebra that describes the finite length and structure of free resolutions of modules over polynomial rings.
-
E.
Kronecker–Weber theorem
The Kronecker–Weber theorem is a fundamental result in algebraic number theory stating that every finite abelian extension of the rational numbers is contained in a cyclotomic field generated by roots of unity.
- 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_69c0082774a481909d7e63fb2aad56ac |
completed | March 22, 2026, 3:17 p.m. |
| NER | Named-entity recognition | batch_69c022fd9b148190bd4aa9c43500949f |
completed | March 22, 2026, 5:12 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c04da37ffc819095f33e7e66e7c1d0 |
completed | March 22, 2026, 8:14 p.m. |
| NEDg | Description generation | batch_69c04edf30448190a60eda49b8b031a0 |
completed | March 22, 2026, 8:19 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69c04fb62690819083327781cb857ccc |
completed | March 22, 2026, 8:23 p.m. |
Created at: March 22, 2026, 3:42 p.m.