Triple
T36199051
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Prim's minimum spanning tree algorithm |
E1047207
|
entity |
| Predicate | requiresGraphProperty |
P42360
|
FINISHED |
| Object | connectedness for full spanning tree |
—
|
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: connectedness for full spanning tree | Statement: [Prim's minimum spanning tree algorithm, requiresGraphProperty, connectedness for full spanning tree]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: requiresGraphProperty Context triple: [Prim's minimum spanning tree algorithm, requiresGraphProperty, connectedness for full spanning tree]
-
A.
requiresProperty
chosen
Indicates that one entity depends on another entity possessing a specific property or attribute in order for a condition, action, or relationship to hold.
-
B.
existenceConditionUndirectedGraph
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.
-
C.
usesGraphType
Indicates that one entity employs or is configured to operate with a specific type of graph representation or graph model.
-
D.
hasEdgeGraph
Indicates that there is an edge (a direct connection or link) present within a graph between specified nodes or components.
-
E.
requiresConnectivityUndirected
Indicates that an undirected (bidirectional) connectivity relationship must exist between the involved entities.
- 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_69f76e414bdc8190996f15a544220a3d |
completed | May 3, 2026, 3:48 p.m. |
| NER | Named-entity recognition | batch_69ffe12ee59c8190bc7da386e6d5332d |
completed | May 10, 2026, 1:36 a.m. |
| PD | Predicate disambiguation | batch_69ffe0a138bc8190a3d4b48cd579e985 |
completed | May 10, 2026, 1:34 a.m. |
Created at: May 3, 2026, 4:08 p.m.