Triple
T24806906
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | rhombicuboctahedron |
E620678
|
entity |
| Predicate | hasEdgeGraph |
P157731
|
FINISHED |
| Object | 4-regular graph on 24 vertices |
—
|
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: 4-regular graph on 24 vertices | Statement: [rhombicuboctahedron, hasEdgeGraph, 4-regular graph on 24 vertices]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hasEdgeGraph Context triple: [rhombicuboctahedron, hasEdgeGraph, 4-regular graph on 24 vertices]
-
A.
hasEdge
Indicates that there exists a direct connection or link (an edge) between two entities in a graph or network.
-
B.
hasEdgeCount
Indicates that there is a specified number of edges associated with an entity, such as a graph or geometric shape.
-
C.
areEdgeTransitive
Indicates that the relation is invariant under all edge-preserving automorphisms, meaning any edge can be mapped to any other edge by a symmetry of the structure.
-
D.
hasEdgeConnectivity
Indicates that there exists a connection or link (such as a graph edge or network link) between two entities.
-
E.
hasEdgeCountRelation
Indicates a relationship where entities are compared or linked based on the number of edges they have (e.g., in a graph or network structure).
- F. None of above. chosen
Provenance (4 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_69e2fabf26bc8190b191faac8f67065b |
completed | April 18, 2026, 3:30 a.m. |
| NER | Named-entity recognition | batch_69f44a417a58819081777e18dda149fd |
completed | May 1, 2026, 6:37 a.m. |
| PD | Predicate disambiguation | batch_69f442a977b08190b44eac040cb90211 |
completed | May 1, 2026, 6:05 a.m. |
| PDg | Predicate description generation | batch_69f44a3adb7c8190941572f718b3b93c |
completed | May 1, 2026, 6:37 a.m. |
Created at: April 18, 2026, 4:50 a.m.