Triple
T6327843
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | enumerative combinatorics |
E141901
|
entity |
| Predicate | usesConcept |
P531
|
FINISHED |
| Object |
Burnside's lemma
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.
|
E586575
|
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: Burnside's lemma | Statement: [enumerative combinatorics, usesConcept, Burnside's lemma]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Burnside's lemma Context triple: [enumerative combinatorics, usesConcept, Burnside's lemma]
-
A.
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.
-
B.
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.
-
C.
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.
-
D.
Alexander–Briggs notation
Alexander–Briggs notation is a classical system for naming and classifying knots in knot theory, assigning each distinct knot a unique label based on its crossing number and order in knot tables.
-
E.
Euler’s theorem
Euler’s theorem is a fundamental result in number theory stating that for any integer a coprime to n, a raised to the power of φ(n) is congruent to 1 modulo n.
- 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: Burnside's lemma Triple: [enumerative combinatorics, usesConcept, Burnside's lemma]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Burnside's lemma Target entity description: 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.
-
A.
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.
-
B.
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.
-
C.
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.
-
D.
Alexander–Briggs notation
Alexander–Briggs notation is a classical system for naming and classifying knots in knot theory, assigning each distinct knot a unique label based on its crossing number and order in knot tables.
-
E.
Euler’s theorem
Euler’s theorem is a fundamental result in number theory stating that for any integer a coprime to n, a raised to the power of φ(n) is congruent to 1 modulo n.
- 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_69c008d201748190917e69c41ba3f978 |
completed | March 22, 2026, 3:20 p.m. |
| NER | Named-entity recognition | batch_69c064e9532081908277f10ec380a486 |
completed | March 22, 2026, 9:53 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c60410223081908c1cf3663d4b14c0 |
completed | March 27, 2026, 4:14 a.m. |
| NEDg | Description generation | batch_69c60626724881908e6270c2d3652c16 |
completed | March 27, 2026, 4:23 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69c606bd2228819082fcb63493664927 |
completed | March 27, 2026, 4:25 a.m. |
Created at: March 22, 2026, 4:29 p.m.