Triple
T5213909
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Blum axioms |
E117701
|
entity |
| Predicate | publishedIn |
P309
|
FINISHED |
| Object | A Machine-Independent Theory of the Complexity of Recursive Functions |
E117702
|
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 Machine-Independent Theory of the Complexity of Recursive Functions | Statement: [Blum axioms, publishedIn, A Machine-Independent Theory of the Complexity of Recursive Functions]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: A Machine-Independent Theory of the Complexity of Recursive Functions Context triple: [Blum axioms, publishedIn, A Machine-Independent Theory of the Complexity of Recursive Functions]
-
A.
Computing with Register Machines
"Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
-
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.
Computability and Unsolvability
Computability and Unsolvability is a classic 1958 textbook by Martin Davis that systematically develops the theory of computable functions and undecidable problems, helping to shape modern computability theory.
-
D.
"The Complexity of Theorem-Proving Procedures"
"The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
-
E.
Blum complexity measures
chosen
Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
- 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_69bd4464ba3c8190bc16b2ebbe42ddb0 |
completed | March 20, 2026, 12:58 p.m. |
| NER | Named-entity recognition | batch_69bd7a911d40819086621537274dc0f0 |
completed | March 20, 2026, 4:49 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69beefe325988190b35e3502f147c9c2 |
completed | March 21, 2026, 7:22 p.m. |
Created at: March 20, 2026, 1:47 p.m.