Triple
T19108803
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Eulerian trail |
E467732
|
entity |
| Predicate | hasEulerianCircuitConditionDirected |
P134433
|
FINISHED |
| Object | in-degree equals out-degree for every vertex and all vertices with nonzero degree lie in a single strongly connected component of the underlying graph |
—
|
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: in-degree equals out-degree for every vertex and all vertices with nonzero degree lie in a single strongly connected component of the underlying graph | Statement: [Eulerian trail, hasEulerianCircuitConditionDirected, in-degree equals out-degree for every vertex and all vertices with nonzero degree lie in a single strongly connected component of the underlying graph]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hasEulerianCircuitConditionDirected Context triple: [Eulerian trail, hasEulerianCircuitConditionDirected, in-degree equals out-degree for every vertex and all vertices with nonzero degree lie in a single strongly connected component of the underlying graph]
-
A.
isCyclic
Indicates that a structure, process, or sequence forms a closed loop in which elements or states repeat in a cycle.
-
B.
hasCycleAccess
Indicates that an entity is permitted to use or access a bicycle or cycling-related resource.
-
C.
hasCycleInfrastructure
Indicates that a location or route is equipped with infrastructure designed for cycling, such as bike lanes, paths, or related facilities.
-
D.
hasArc
Indicates that there is a directed connection or edge from one entity to another, often representing a link in a graph or network.
-
E.
hasEdgeConnectivity
Indicates that there exists a connection or link (such as a graph edge or network link) between two entities.
- 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_69d8dd06a26481908039e2a1bae8c597 |
completed | April 10, 2026, 11:20 a.m. |
| NER | Named-entity recognition | batch_69e5e391f00c8190881a5977dd3728ed |
completed | April 20, 2026, 8:28 a.m. |
| PD | Predicate disambiguation | batch_69e4b9ac41848190afd0f33b42cebe99 |
completed | April 19, 2026, 11:17 a.m. |
| PDg | Predicate description generation | batch_69e4bfe8a06081909fd5c28a33e9f218 |
completed | April 19, 2026, 11:43 a.m. |
Created at: April 10, 2026, 12:04 p.m.