Triple
T18359800
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Rabin–Karp algorithm |
E439883
|
entity |
| Predicate | introducedBy |
P513
|
FINISHED |
| Object | Richard M. Karp |
—
|
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: Richard M. Karp | Statement: [Rabin–Karp algorithm, introducedBy, Richard M. Karp]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Richard M. Karp Context triple: [Rabin–Karp algorithm, introducedBy, Richard M. Karp]
-
A.
Richard Karp
chosen
Richard Karp is a renowned American computer scientist best known for his foundational work in computational complexity theory and combinatorial algorithms, including the theory of NP-completeness.
-
B.
John E. Hopcroft
John E. Hopcroft is an American computer scientist renowned for his foundational contributions to algorithms and automata theory and as a coauthor of the classic textbook "Introduction to Automata Theory, Languages, and Computation."
-
C.
Stephen A. Cook
Stephen A. Cook is a Canadian-American computer scientist best known for founding the theory of NP-completeness and making seminal contributions to computational complexity theory.
-
D.
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.
-
E.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
- 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_69d8b918221c8190a9f7b563d64ac677 |
completed | April 10, 2026, 8:47 a.m. |
| NER | Named-entity recognition | batch_69e516d9dba8819088c5d772e3ee670d |
completed | April 19, 2026, 5:54 p.m. |
Created at: April 10, 2026, 10:37 a.m.