Triple
T20505621
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | William Burnside |
E503420
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | Burnside's lemma |
—
|
NE NERFINISHED |
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: [William Burnside, knownFor, Burnside's lemma]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Burnside's lemma Context triple: [William Burnside, knownFor, 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.
orbit-stabilizer theorem
The orbit-stabilizer theorem is a fundamental result in group theory that relates the size of a group acting on a set to the sizes of the orbit of an element and its stabilizer subgroup.
-
D.
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.
-
E.
Sylow theorems
The Sylow theorems are fundamental results in finite group theory that describe the existence, conjugacy, and number of subgroups whose orders are powers of a prime dividing the group order.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
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.