Triple
T11507793
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Arthur Cayley |
E272830
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Cayley graph |
E911229
|
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: Cayley graph | Statement: [Arthur Cayley, notableWork, Cayley graph]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Cayley graph Context triple: [Arthur Cayley, notableWork, Cayley graph]
-
A.
Cayley graph
chosen
A Cayley graph is a graphical representation of a group where vertices correspond to group elements and edges represent multiplication by chosen generators, widely used in group theory and geometric group theory.
-
B.
Coxeter–Dynkin diagrams
Coxeter–Dynkin diagrams are graphical representations that encode the structure of reflection groups and root systems, widely used in the classification of regular polytopes, Lie algebras, and symmetries.
-
C.
van Kampen diagram
A van Kampen diagram is a planar, combinatorial 2-complex used in combinatorial group theory to visually represent relations in a group presentation and to prove that a word equals the identity.
-
D.
Conway's 99-graph problem
Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
-
E.
Graham–Pollak theorem
The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
- 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_69d6aae2c3748190bed2ea50dfb160dc |
completed | April 8, 2026, 7:22 p.m. |
| NER | Named-entity recognition | batch_69d86db43a648190be859bec2fe9f43b |
completed | April 10, 2026, 3:25 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e624f5c9608190bde28a59860b3c93 |
completed | April 20, 2026, 1:07 p.m. |
Created at: April 8, 2026, 9:36 p.m.