Triple
T15889216
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Notes on Structured Programming |
E385271
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | A Discipline of Programming |
E385270
|
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: A Discipline of Programming | Statement: [Notes on Structured Programming, relatedTo, A Discipline of Programming]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: A Discipline of Programming Context triple: [Notes on Structured Programming, relatedTo, A Discipline of Programming]
-
A.
A Discipline of Programming
chosen
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.
-
B.
An Axiomatic Basis for Computer Programming
"An Axiomatic Basis for Computer Programming" is a seminal 1969 paper by C.A.R. Hoare that introduced the formal logical system now known as Hoare logic for reasoning about program correctness.
-
C.
Dijkstra weakest precondition calculus
Dijkstra weakest precondition calculus is a formal method for reasoning about program correctness by computing the weakest conditions that must hold before execution to guarantee a desired postcondition.
-
D.
Hoare logic
Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
-
E.
Notes on Structured Programming
Notes on Structured Programming is a seminal work by Edsger W. Dijkstra that advocates for disciplined, mathematically grounded program design and helped popularize the principles of structured programming.
- 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_69d86da5b800819083a31be937d738b0 |
completed | April 10, 2026, 3:25 a.m. |
| NER | Named-entity recognition | batch_69e1561d5c28819094c3541d917a4433 |
completed | April 16, 2026, 9:35 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ffb04598e0819094274868941195b9 |
completed | May 9, 2026, 10:08 p.m. |
Created at: April 10, 2026, 4:51 a.m.