Triple
T19112196
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | DISC |
E467814
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | SODA (for algorithms community overlap) |
—
|
NE NERFINISHED |
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: SODA (for algorithms community overlap) | Statement: [DISC, relatedTo, SODA (for algorithms community overlap)]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: SODA (for algorithms community overlap) Context triple: [DISC, relatedTo, SODA (for algorithms community overlap)]
-
A.
ACM SODA
chosen
ACM SODA is a premier annual research conference focused on algorithms and discrete mathematics, jointly sponsored by the ACM and SIAM.
-
B.
Graph Algorithms (book)
"Graph Algorithms" is a foundational textbook by Shimon Even that systematically presents the theory, design, and analysis of algorithms for solving fundamental problems on graphs.
-
C.
Count of Louvain
The Count of Louvain was a medieval noble title in what is now Belgium, held by a powerful dynasty that played a key role in the politics of the Low Countries.
-
D.
Algorithms (with Sanjoy Dasgupta and Umesh Vazirani)
"Algorithms (with Sanjoy Dasgupta and Umesh Vazirani)" is a widely used introductory textbook that presents the design and analysis of algorithms with an emphasis on clarity, rigor, and practical applications in computer science.
-
E.
Kleinberg
Kleinberg is a surname most notably associated with Jon Kleinberg, a prominent computer scientist known for his work in algorithms and network science.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 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_69d8dd06a26481908039e2a1bae8c597 |
completed | April 10, 2026, 11:20 a.m. |
| NER | Named-entity recognition | batch_69e5e394969c81909d09b2300ea0e041 |
completed | April 20, 2026, 8:28 a.m. |
Created at: April 10, 2026, 12:04 p.m.