Triple
T26131203
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Harada–Norton group |
E659250
|
entity |
| Predicate | hasPermutationRepresentationDegree |
P97228
|
FINISHED |
| Object | various large degrees |
—
|
LITERAL 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: various large degrees | Statement: [Harada–Norton group, hasPermutationRepresentationDegree, various large degrees]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hasPermutationRepresentationDegree Context triple: [Harada–Norton group, hasPermutationRepresentationDegree, various large degrees]
-
A.
degreeOfNaturalPermutationRepresentation
chosen
Indicates the degree (dimension) of the natural permutation representation associated with a given permutation action or group.
-
B.
hasMinimalFaithfulPermutationDegree
Indicates that there exists a faithful permutation representation of the given structure whose degree (the size of the set it acts on) is minimal among all such faithful permutation representations.
-
C.
minimalFaithfulPermutationDegree
Indicates the smallest degree (number of points) of a permutation representation on which a group can act faithfully (injectively) via permutations.
-
D.
hasMinimalFaithfulPermutationRepresentation
Indicates that there exists a faithful permutation representation of the structure (e.g., a group acting on a set) whose degree is minimal among all such faithful permutation representations.
-
E.
hasMinimalFaithfulComplexRepresentationDegree
Indicates the smallest dimension in which a faithful (injective) complex linear representation of the given object exists.
- F. None of above.
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_69ee5bc3c20c8190bf2cf272f4170e95 |
completed | April 26, 2026, 6:38 p.m. |
| NER | Named-entity recognition | batch_69f6aaf50be08190a2b62a6d881f8aee |
completed | May 3, 2026, 1:55 a.m. |
| PD | Predicate disambiguation | batch_69f6aa1c555081908787dbf76147f180 |
completed | May 3, 2026, 1:51 a.m. |
Created at: April 26, 2026, 8:15 p.m.