Triple
T26966609
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | EXPTIME |
E679188
|
entity |
| Predicate | relationshipStatusWithPSPACE |
P62369
|
FINISHED |
| Object | PSPACE vs EXPTIME is open |
—
|
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: PSPACE vs EXPTIME is open | Statement: [EXPTIME, relationshipStatusWithPSPACE, PSPACE vs EXPTIME is open]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: relationshipStatusWithPSPACE Context triple: [EXPTIME, relationshipStatusWithPSPACE, PSPACE vs EXPTIME is open]
-
A.
complexityClassRelation
chosen
Indicates a relationship between two computational complexity classes, such as inclusion, equivalence, or separation, within the hierarchy of complexity theory.
-
B.
relationToNPCompleteness
Indicates that the subject has a defined conceptual or formal connection to the notion of NP-completeness (e.g., being NP-complete, related to NP-complete problems, or used in reasoning about NP-completeness).
-
C.
yearNPCompletenessProved
Indicates the year in which the NP-completeness of a given problem was formally proved.
-
D.
isUnconditionalPolynomialTime
Indicates that an algorithm or computation runs in polynomial time without relying on any unproven assumptions or conjectures.
-
E.
isNPComplete
Indicates that a decision problem is both in NP and NP-hard, meaning it can be verified in polynomial time and is at least as hard as any problem in NP.
- 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_69eeeb4f3a448190b1e94b2d4776c16e |
completed | April 27, 2026, 4:51 a.m. |
| NER | Named-entity recognition | batch_69ff16775a9881909d26dbc1f0ef3e1c |
completed | May 9, 2026, 11:11 a.m. |
| PD | Predicate disambiguation | batch_69ff158e61708190a1c581d0d306cfce |
completed | May 9, 2026, 11:07 a.m. |
Created at: April 27, 2026, 6:36 a.m.