Triple
T6800958
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Lagrange's theorem in group theory |
E156184
|
entity |
| Predicate | isRelatedTo |
P37
|
FINISHED |
| Object | Burnside's lemma |
E586575
|
NE FINISHED |
How this triple was built (2 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 lemma | Statement: [Lagrange's theorem in group theory, isRelatedTo, Burnside's lemma]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Burnside's lemma Context triple: [Lagrange's theorem in group theory, isRelatedTo, Burnside's lemma]
-
A.
Burnside's lemma
chosen
Burnside's lemma is a result in group theory and combinatorics that counts distinct configurations under symmetries by averaging the number of fixed points of group actions.
-
B.
Pólya enumeration theorem
The Pólya enumeration theorem is a fundamental result in combinatorics that counts distinct configurations of objects under group actions by using cycle index polynomials and generating functions.
-
C.
Lagrange's theorem in group theory
Lagrange's theorem in group theory is a fundamental result stating that the order of any subgroup of a finite group divides the order of the group.
-
D.
The Twelvefold Way
The Twelvefold Way is a framework in combinatorics that systematically classifies twelve fundamental ways of counting functions between finite sets under various labeling and structural constraints.
-
E.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69c68826e6a48190a3d220b541e639de |
completed | March 27, 2026, 1:37 p.m. |
| NER | Named-entity recognition | batch_69c6d2e595188190a0bb4b595df3adb2 |
completed | March 27, 2026, 6:56 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c71a9b0cc48190819380aeaf0228e7 |
completed | March 28, 2026, 12:02 a.m. |
Created at: March 27, 2026, 2:16 p.m.