Triple
T20512739
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Yao’s next-bit test |
E503604
|
entity |
| Predicate | namedAfter |
P63
|
FINISHED |
| Object | Andrew Chi-Chih Yao |
—
|
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: Andrew Chi-Chih Yao | Statement: [Yao’s next-bit test, namedAfter, Andrew Chi-Chih Yao]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Andrew Chi-Chih Yao Context triple: [Yao’s next-bit test, namedAfter, Andrew Chi-Chih Yao]
-
A.
Andrew Yao
chosen
Andrew Yao is a Chinese-American computer scientist renowned for his foundational contributions to computational complexity theory and as a recipient of the Turing Award.
-
B.
Manuel Blum
Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
-
C.
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."
-
D.
Leonard Adleman
Leonard Adleman is an American computer scientist and cryptographer best known as one of the co-inventors of the RSA public-key cryptosystem.
-
E.
Richard Karp
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.
- 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_69e0b4b2aa788190ae9eb37c1d73b1f1 |
completed | April 16, 2026, 10:06 a.m. |
| NER | Named-entity recognition | batch_69e69dcd74c48190b050e25c20154c09 |
completed | April 20, 2026, 9:42 p.m. |
Created at: April 16, 2026, 11:36 a.m.