Triple
T12516944
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Scheme R5RS |
E299212
|
entity |
| Predicate | fullName |
P16
|
FINISHED |
| Object | Revised^5 Report on the Algorithmic Language Scheme |
E131744
|
NE FINISHED |
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: Revised^5 Report on the Algorithmic Language Scheme | Statement: [Scheme R5RS, fullName, Revised^5 Report on the Algorithmic Language Scheme]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Revised^5 Report on the Algorithmic Language Scheme Context triple: [Scheme R5RS, fullName, Revised^5 Report on the Algorithmic Language Scheme]
-
A.
Revised^n Report on the Algorithmic Language Scheme
chosen
The Revised^n Report on the Algorithmic Language Scheme is the series of formal documents that define and evolve the official specification of the Scheme programming language.
-
B.
Scheme: An Interpreter for Extended Lambda Calculus
"Scheme: An Interpreter for Extended Lambda Calculus" is the seminal 1975 technical report by Gerald Jay Sussman and Guy L. Steele Jr. that introduced the Scheme programming language and demonstrated the power of lexical scoping and first-class procedures in a minimalist Lisp dialect.
-
C.
Rabbit: A Compiler for Scheme (thesis)
"Rabbit: A Compiler for Scheme" is Guy L. Steele Jr.'s influential doctoral thesis that introduced one of the earliest optimizing compilers for the Scheme programming language, helping to establish Scheme as a practical vehicle for language and compiler research.
-
D.
Landin’s SECD machine
Landin’s SECD machine is an early abstract machine for functional programming languages that introduced a systematic model for evaluating expressions using a stack, environment, control, and dump.
-
E.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69d6ada5cdd48190860d9ce30aff69be |
completed | April 8, 2026, 7:33 p.m. |
| NER | Named-entity recognition | batch_69d9541f80148190976d1d912fe155d0 |
completed | April 10, 2026, 7:48 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f64bbd58b88190baeb99380babf64f |
completed | May 2, 2026, 7:08 p.m. |
Created at: April 8, 2026, 9:57 p.m.