Triple
T26797306
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Jack Edmonds |
E670991
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Edmonds' branching algorithm for optimum branchings
Edmonds' branching algorithm for optimum branchings is a foundational combinatorial optimization algorithm that efficiently finds maximum or minimum weight directed spanning trees (branchings) in a directed graph.
|
E1739867
|
NE 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: Edmonds' branching algorithm for optimum branchings | Statement: [Jack Edmonds, knownFor, Edmonds' branching algorithm for optimum branchings]
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Edmonds' branching algorithm for optimum branchings Triple: [Jack Edmonds, knownFor, Edmonds' branching algorithm for optimum branchings]
Generated description
Edmonds' branching algorithm for optimum branchings is a foundational combinatorial optimization algorithm that efficiently finds maximum or minimum weight directed spanning trees (branchings) in a directed graph.
Provenance (5 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_69eeb31fbd888190a82dac5822e453bc |
completed | April 27, 2026, 12:51 a.m. |
| NER | Named-entity recognition | batch_69f619c19144819094d191712d58958a |
completed | May 2, 2026, 3:35 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a12096b4ccc8190a5bc807da6ea28d9 |
completed | May 23, 2026, 8:09 p.m. |
| NEDg | Description generation | batch_6a1209f2329c819090e9cc1a4a66cce7 |
completed | May 23, 2026, 8:11 p.m. |
| NED2 | Entity disambiguation (via description) | batch_6a120a7acb6081909b538b1a351a92bd |
completed | May 23, 2026, 8:13 p.m. |
Created at: April 27, 2026, 4:20 a.m.