Triple
T21817903
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Max Planck Institute for Software Systems |
E538649
|
entity |
| Predicate | abbreviation |
P43
|
FINISHED |
| Object |
MPI-SWS
MPI-SWS is a research institute of the Max Planck Society focused on foundational and applied research in software systems, including areas such as distributed systems, security, verification, and programming languages.
|
E1503172
|
NE FINISHED |
How this triple was built (4 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: MPI-SWS | Statement: [Max Planck Institute for Software Systems, abbreviation, MPI-SWS]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: MPI-SWS Context triple: [Max Planck Institute for Software Systems, abbreviation, MPI-SWS]
-
A.
Isabelle/ML
Isabelle/ML is the ML-based implementation and extension language used to develop and script the Isabelle interactive theorem prover.
-
B.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
-
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.
TLA+ proof system
The TLA+ proof system is a formal verification framework that allows users to mechanically check the correctness of TLA+ specifications using machine-checked logical proofs.
-
E.
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.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: MPI-SWS Triple: [Max Planck Institute for Software Systems, abbreviation, MPI-SWS]
Generated description
MPI-SWS is a research institute of the Max Planck Society focused on foundational and applied research in software systems, including areas such as distributed systems, security, verification, and programming languages.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: MPI-SWS Target entity description: MPI-SWS is a research institute of the Max Planck Society focused on foundational and applied research in software systems, including areas such as distributed systems, security, verification, and programming languages.
-
A.
Isabelle/ML
Isabelle/ML is the ML-based implementation and extension language used to develop and script the Isabelle interactive theorem prover.
-
B.
Boyer–Moore theorem prover
The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.
-
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.
TLA+ proof system
The TLA+ proof system is a formal verification framework that allows users to mechanically check the correctness of TLA+ specifications using machine-checked logical proofs.
-
E.
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.
- F. None of above. chosen
Provenance (5 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_69e0c475038c8190abb9b1a20eb8ff50 |
completed | April 16, 2026, 11:13 a.m. |
| NER | Named-entity recognition | batch_69f07ccbf3308190a5b3993737b939c4 |
completed | April 28, 2026, 9:24 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a0a45df38a881908f7864c53c1bbb0b |
completed | May 17, 2026, 10:49 p.m. |
| NEDg | Description generation | batch_6a0a46a16de88190a930f98921d41239 |
completed | May 17, 2026, 10:52 p.m. |
| NED2 | Entity disambiguation (via description) | batch_6a0a471f6d3481908108ceea4ff1c47b |
completed | May 17, 2026, 10:54 p.m. |
Created at: April 16, 2026, 6:54 p.m.