Triple
T2866567
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Princeton Science Library |
E63453
|
entity |
| Predicate | hasNotableAuthor |
P4244
|
FINISHED |
| Object |
Scott Aaronson
Scott Aaronson is a prominent theoretical computer scientist known for his work on quantum computing and computational complexity, as well as for his accessible popular science writing.
|
E305932
|
NE FINISHED |
How this triple was built (4 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: Scott Aaronson | Statement: [Princeton Science Library, hasNotableAuthor, Scott Aaronson]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Scott Aaronson Context triple: [Princeton Science Library, hasNotableAuthor, Scott Aaronson]
-
A.
Lance Fortnow
Lance Fortnow is an American theoretical computer scientist known for his contributions to computational complexity theory and for his expository work on the P vs NP problem.
-
B.
Avi Wigderson
Avi Wigderson is a prominent Israeli-American computer scientist renowned for his foundational contributions to computational complexity theory and for receiving the Turing Award.
-
C.
Omer Reingold
Omer Reingold is a prominent theoretical computer scientist known for his influential work in computational complexity and cryptography, including a landmark log-space algorithm for undirected graph connectivity.
-
D.
David Deutsch
David Deutsch is a British physicist and philosopher best known as a pioneer of quantum computation and a leading proponent of the many-worlds interpretation of quantum mechanics.
-
E.
Iftach Haitner
Iftach Haitner is an Israeli computer scientist and cryptographer known for his contributions to the foundations of cryptography and computational complexity.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
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: Scott Aaronson Triple: [Princeton Science Library, hasNotableAuthor, Scott Aaronson]
Generated description
Scott Aaronson is a prominent theoretical computer scientist known for his work on quantum computing and computational complexity, as well as for his accessible popular science writing.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Scott Aaronson Target entity description: Scott Aaronson is a prominent theoretical computer scientist known for his work on quantum computing and computational complexity, as well as for his accessible popular science writing.
-
A.
Lance Fortnow
Lance Fortnow is an American theoretical computer scientist known for his contributions to computational complexity theory and for his expository work on the P vs NP problem.
-
B.
Avi Wigderson
Avi Wigderson is a prominent Israeli-American computer scientist renowned for his foundational contributions to computational complexity theory and for receiving the Turing Award.
-
C.
Omer Reingold
Omer Reingold is a prominent theoretical computer scientist known for his influential work in computational complexity and cryptography, including a landmark log-space algorithm for undirected graph connectivity.
-
D.
David Deutsch
David Deutsch is a British physicist and philosopher best known as a pioneer of quantum computation and a leading proponent of the many-worlds interpretation of quantum mechanics.
-
E.
Iftach Haitner
Iftach Haitner is an Israeli computer scientist and cryptographer known for his contributions to the foundations of cryptography and computational complexity.
- F. None of above. chosen
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_69ab4c42fb8c8190b36e161d47c03b81 |
completed | March 6, 2026, 9:50 p.m. |
| NER | Named-entity recognition | batch_69abdfbb7ed4819096ca65391077e2af |
completed | March 7, 2026, 8:20 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b01da85930819092d19a5e712cfa18 |
completed | March 10, 2026, 1:33 p.m. |
| NEDg | Description generation | batch_69b01e34639c8190b1c6e8a14cd31d96 |
completed | March 10, 2026, 1:35 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69b01f5a6784819089499926fb115d9c |
completed | March 10, 2026, 1:40 p.m. |
Created at: March 6, 2026, 10:02 p.m.