Triple
T36871371
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Cayley graph |
E911229
|
entity |
| Predicate | isUndirectedIf |
P134431
|
FINISHED |
| Object | generating set is symmetric |
—
|
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: generating set is symmetric | Statement: [Cayley graph, isUndirectedIf, generating set is symmetric]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: isUndirectedIf Context triple: [Cayley graph, isUndirectedIf, generating set is symmetric]
-
A.
requiresConnectivityUndirected
Indicates that an undirected (bidirectional) connectivity relationship must exist between the involved entities.
-
B.
isUnorientedVersionOf
Indicates that one entity is a version of another in which orientation or directionality has been removed or is not taken into account.
-
C.
isSimpleConnected
Indicates that a topological space is path-connected and every loop within it can be continuously contracted to a point (i.e., it has trivial fundamental group).
-
D.
existenceConditionUndirectedGraph
chosen
Indicates that a specified condition holds for the existence of an undirected graph (or a structure modeled as one), typically constraining when such a graph can or must exist.
-
E.
hasEulerianCircuitConditionUndirected
Indicates that an undirected graph satisfies the necessary and sufficient conditions to contain an Eulerian circuit (typically being connected and having all vertices of even degree).
- 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_69f76e82339881909607a65c0503d941 |
completed | May 3, 2026, 3:49 p.m. |
| NER | Named-entity recognition | batch_69f9fd6834cc8190aa27153d6a99f3bb |
completed | May 5, 2026, 2:23 p.m. |
| PD | Predicate disambiguation | batch_69f7cf7890008190a8bc355ff2d61c86 |
completed | May 3, 2026, 10:43 p.m. |
Created at: May 3, 2026, 4:13 p.m.