Triple
T2139697
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Tobias Nipkow |
E46732
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Isabelle/HOL tutorial and reference manuals |
E238246
|
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: Isabelle/HOL tutorial and reference manuals | Statement: [Tobias Nipkow, notableWork, Isabelle/HOL tutorial and reference manuals]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Isabelle/HOL tutorial and reference manuals Context triple: [Tobias Nipkow, notableWork, Isabelle/HOL tutorial and reference manuals]
-
A.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
chosen
"Isabelle/HOL: A Proof Assistant for Higher-Order Logic" is a foundational book and system documentation that presents the Isabelle/HOL interactive theorem prover, widely used for formal verification and higher-order logic reasoning in computer science and mathematics.
-
B.
Isabelle proof assistant
Isabelle proof assistant is a widely used interactive theorem prover and generic proof assistant designed for formal verification and mathematical logic, particularly known for its support of higher-order logic.
-
C.
LCF theorem prover
The LCF theorem prover is an early interactive proof system that pioneered the use of higher-order logic and the LCF-style architecture, forming the conceptual basis for later provers like HOL and Isabelle.
-
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.
The Definition of Standard ML
The Definition of Standard ML is the formal language specification that rigorously defines the syntax and semantics of the Standard ML functional programming language.
- 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_69a88a174ab48190a5db20c132e5dccf |
completed | March 4, 2026, 7:37 p.m. |
| NER | Named-entity recognition | batch_69abbe025d3c81908bcb33a7ff09eae8 |
completed | March 7, 2026, 5:56 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ae58d5535c8190b59293afe3a10834 |
completed | March 9, 2026, 5:21 a.m. |
Created at: March 4, 2026, 7:44 p.m.