Triple
T32258052
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | μ-calculus |
E824073
|
entity |
| Predicate | complexityOfModelChecking |
P142021
|
FINISHED |
| Object | EXPTIME-complete for general formulas |
—
|
LITERAL 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: EXPTIME-complete for general formulas | Statement: [μ-calculus, complexityOfModelChecking, EXPTIME-complete for general formulas]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: complexityOfModelChecking Context triple: [μ-calculus, complexityOfModelChecking, EXPTIME-complete for general formulas]
-
A.
complexityOfkSATForK≥3
Indicates the computational complexity classification of the k-SAT decision problem when the clause size k is at least 3.
-
B.
parameterizedComplexity
Indicates that the relationship or action is analyzed or characterized in terms of its computational complexity as a function of one or more explicit parameters.
-
C.
hasReasoningComplexity
Indicates that an action, process, or decision involves a certain level or type of cognitive or logical complexity in its reasoning.
-
D.
yearNPCompletenessProved
Indicates the year in which the NP-completeness of a given problem was formally proved.
-
E.
complexityStatus
chosen
Indicates the current level or state of complexity associated with an entity or process.
- F. None of above.
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_69f3490db0748190bfef6e50c95d39d3 |
completed | April 30, 2026, 12:20 p.m. |
| NER | Named-entity recognition | batch_69f71422adac8190a5ceb32dcf820833 |
completed | May 3, 2026, 9:23 a.m. |
| PD | Predicate disambiguation | batch_69f712764d2c819081b64b27e5de4a13 |
completed | May 3, 2026, 9:16 a.m. |
Created at: May 1, 2026, 12:41 a.m.