Triple
T34302645
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Bellman–Ford algorithm |
E880220
|
entity |
| Predicate | requiresEdgeWeightsToBe |
P184758
|
FINISHED |
| Object | finite |
—
|
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: finite | Statement: [Bellman–Ford algorithm, requiresEdgeWeightsToBe, finite]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: requiresEdgeWeightsToBe Context triple: [Bellman–Ford algorithm, requiresEdgeWeightsToBe, finite]
-
A.
assumesEdgeWeights
chosen
Indicates that a method, algorithm, or process operates under the assumption that the edges in a graph have associated weights that influence its behavior or results.
-
B.
edgeWeights
Indicates a relationship where each edge in a graph is associated with a specific numerical weight or cost.
-
C.
requiresConnectivityUndirected
Indicates that an undirected (bidirectional) connectivity relationship must exist between the involved entities.
-
D.
hasEdgeGraph
Indicates that there is an edge (a direct connection or link) present within a graph between specified nodes or components.
-
E.
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.
- 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_69f349b79f6c81909cb468c92c39c74d |
completed | April 30, 2026, 12:23 p.m. |
| NER | Named-entity recognition | batch_69ff63e6b61081909c648bf0ff279481 |
completed | May 9, 2026, 4:42 p.m. |
| PD | Predicate disambiguation | batch_69ff6381867881908ae0545df4b71df5 |
completed | May 9, 2026, 4:40 p.m. |
Created at: May 1, 2026, 1:57 a.m.