Triple
T36151355
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Kruskal’s minimum spanning tree algorithm |
E1045593
|
entity |
| Predicate | algorithmParadigm |
P21840
|
FINISHED |
| Object | greedy |
—
|
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: greedy | Statement: [Kruskal’s minimum spanning tree algorithm, algorithmParadigm, greedy]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: algorithmParadigm Context triple: [Kruskal’s minimum spanning tree algorithm, algorithmParadigm, greedy]
-
A.
codingParadigm
Indicates the programming paradigm or style (e.g., object-oriented, functional, procedural) that characterizes how code is structured and organized in a given context.
-
B.
algorithmType
chosen
Indicates the specific kind or category of algorithm associated with an entity or process.
-
C.
softwareParadigm
Indicates that a piece of software or a programming language follows or is based on a particular programming paradigm or style of development.
-
D.
algorithmVariant
Indicates that one algorithm is a variant or modified version of another algorithm.
-
E.
relatedAlgorithm
Indicates that one algorithm has a meaningful connection or association with another algorithm, such as similarity, dependency, or complementary function.
- 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_69f76e37ace88190a906b107d388f5d1 |
completed | May 3, 2026, 3:48 p.m. |
| NER | Named-entity recognition | batch_69f7b3e2f3c08190be4fd1ae4fa1266d |
completed | May 3, 2026, 8:45 p.m. |
| PD | Predicate disambiguation | batch_69f7b1bcc47081909fe7d592ac69006c |
completed | May 3, 2026, 8:36 p.m. |
Created at: May 3, 2026, 4:08 p.m.