Triple
T1365192
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | William H. Press |
E29185
|
entity |
| Predicate | hasNotableTextbook |
P25606
|
FINISHED |
| Object | Numerical Recipes in Fortran |
E156518
|
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: Numerical Recipes in Fortran | Statement: [William H. Press, hasNotableTextbook, Numerical Recipes in Fortran]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Numerical Recipes in Fortran Context triple: [William H. Press, hasNotableTextbook, Numerical Recipes in Fortran]
-
A.
Numerical Recipes
chosen
Numerical Recipes is a widely used series of books that provides practical algorithms and explanations for numerical methods in scientific computing.
-
B.
Fortran
Fortran is a high-level programming language, particularly strong in numerical and scientific computing, widely used for engineering, physics, and high-performance applications.
-
C.
Algol 68R
Algol 68R is a revised, more practical and implementable version of the Algol 68 programming language, created to simplify and clarify the original language’s complex design.
-
D.
Euler’s method for numerical integration
Euler’s method for numerical integration is a simple first-order numerical procedure used to approximate solutions to ordinary differential equations by stepping forward in small increments.
-
E.
Successive Over-Relaxation
Successive Over-Relaxation is an iterative numerical method that accelerates the convergence of the Gauss–Seidel algorithm for solving large systems of linear equations by introducing a relaxation factor.
- 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_69a498d77abc8190913bf57e5f51d2c4 |
completed | March 1, 2026, 7:51 p.m. |
| NER | Named-entity recognition | batch_69a4c48e6534819090d23f3cc25093ae |
completed | March 1, 2026, 10:58 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ad01518d5481908cf14b24dde8342b |
completed | March 8, 2026, 4:55 a.m. |
Created at: March 1, 2026, 7:57 p.m.