Triple
T3771967
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Martin David Kruskal |
E83217
|
entity |
| Predicate | sibling |
P363
|
FINISHED |
| Object | Joseph Kruskal |
E386036
|
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: Joseph Kruskal | Statement: [Martin David Kruskal, sibling, Joseph Kruskal]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Joseph Kruskal Context triple: [Martin David Kruskal, sibling, Joseph Kruskal]
-
A.
John Kruskal
chosen
John Kruskal was an American mathematician and computer scientist best known for Kruskal's algorithm in graph theory and for foundational work in combinatorics and statistics.
-
B.
F. M. Fulkerson
F. M. Fulkerson is a central figure in William Dean Howells’s novel "A Hazard of New Fortunes," known as the energetic, entrepreneurial promoter who helps launch the magazine around which much of the story revolves.
-
C.
Robert Tarjan
Robert Tarjan is an American computer scientist renowned for his pioneering work in algorithms and data structures, including the development of efficient graph algorithms and the union–find data structure.
-
D.
S. Rao Kosaraju
S. Rao Kosaraju is a computer scientist known for his contributions to algorithm design and graph theory, including early work on strongly connected components algorithms.
-
E.
David S. Johnson
David S. Johnson was a prominent American computer scientist known for his influential work in algorithms and computational complexity, particularly in the study of NP-completeness and approximation algorithms.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
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_69ad8b235e608190b5a2b1d1bfcef50b |
completed | March 8, 2026, 2:43 p.m. |
| NER | Named-entity recognition | batch_69adcc3219b881908a2f82126f9a679d |
completed | March 8, 2026, 7:21 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b4f039cd9c81908ea1428f2c328cdb |
completed | March 14, 2026, 5:20 a.m. |
Created at: March 8, 2026, 3:36 p.m.