Triple
T22445311
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | PLT Scheme |
E554848
|
entity |
| Predicate | usedIn |
P98
|
FINISHED |
| Object | How to Design Programs |
—
|
NE NERFINISHED |
How this triple was built (3 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: How to Design Programs | Statement: [PLT Scheme, usedIn, How to Design Programs]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: How to Design Programs Context triple: [PLT Scheme, usedIn, How to Design Programs]
-
A.
Structure and Interpretation of Computer Programs
Structure and Interpretation of Computer Programs is a seminal computer science textbook by Harold Abelson and Gerald Jay Sussman that uses the Scheme language to teach fundamental principles of programming and software design.
-
B.
The Practice of Programming
The Practice of Programming is a widely respected book by Brian W. Kernighan and Rob Pike that teaches practical software development techniques, emphasizing clear code, debugging, testing, and performance.
-
C.
The Scheme Programming Language (book examples)
The Scheme Programming Language (book examples) is a collection of illustrative code samples demonstrating the features and idioms of the Scheme language, specifically written for and run on the Chez Scheme implementation.
-
D.
Algorithms + Data Structures = Programs
"Algorithms + Data Structures = Programs" is a classic computer science textbook by Niklaus Wirth that systematically teaches how combining appropriate data structures with algorithms leads to effective and efficient programs.
-
E.
A Discipline of Programming
A Discipline of Programming is a seminal 1976 book by Edsger W. Dijkstra that rigorously develops program construction using formal mathematical reasoning and correctness proofs.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: How to Design Programs Target entity description: How to Design Programs is an influential introductory computer science textbook that teaches systematic program design and problem-solving using the Scheme programming language.
-
A.
Structure and Interpretation of Computer Programs
Structure and Interpretation of Computer Programs is a seminal computer science textbook by Harold Abelson and Gerald Jay Sussman that uses the Scheme language to teach fundamental principles of programming and software design.
-
B.
The Practice of Programming
The Practice of Programming is a widely respected book by Brian W. Kernighan and Rob Pike that teaches practical software development techniques, emphasizing clear code, debugging, testing, and performance.
-
C.
The Scheme Programming Language (book examples)
The Scheme Programming Language (book examples) is a collection of illustrative code samples demonstrating the features and idioms of the Scheme language, specifically written for and run on the Chez Scheme implementation.
-
D.
Algorithms + Data Structures = Programs
"Algorithms + Data Structures = Programs" is a classic computer science textbook by Niklaus Wirth that systematically teaches how combining appropriate data structures with algorithms leads to effective and efficient programs.
-
E.
A Discipline of Programming
A Discipline of Programming is a seminal 1976 book by Edsger W. Dijkstra that rigorously develops program construction using formal mathematical reasoning and correctness proofs.
- F. None of above. chosen
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_69e11e5113208190ab58c6b595f9d1d0 |
completed | April 16, 2026, 5:37 p.m. |
| NER | Named-entity recognition | batch_69f15b46e8ac8190bfa8c611ffcba822 |
completed | April 29, 2026, 1:13 a.m. |
Created at: April 16, 2026, 8:47 p.m.