Triple
T20836506
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Cook–Levin theorem |
E512972
|
entity |
| Predicate | complexityClassInvolved |
P29141
|
FINISHED |
| Object | NP |
—
|
NE NERFINISHED |
How this triple was built (3 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: NP | Statement: [Cook–Levin theorem, complexityClassInvolved, NP]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: NP Context triple: [Cook–Levin theorem, complexityClassInvolved, NP]
-
A.
NP
NP was the reporting mark used by the historic Northern Pacific Railway, a major transcontinental railroad in the northern United States.
-
B.
NP
NP is a UK postcode area covering parts of Newport and surrounding regions in south-east Wales.
-
C.
NP
NP is the abbreviation commonly used for the National Party, the former ruling political party of apartheid-era South Africa.
-
D.
NP
chosen
NP (nondeterministic polynomial time) is the complexity class of decision problems for which proposed solutions can be verified in polynomial time by a deterministic Turing machine.
-
E.
PN
PN is the vehicle registration code used for the Italian city and province of Pordenone in the Friuli Venezia Giulia region.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: complexityClassInvolved Context triple: [Cook–Levin theorem, complexityClassInvolved, NP]
-
A.
complexityClassRelation
Indicates a relationship between two computational complexity classes, such as inclusion, equivalence, or separation, within the hierarchy of complexity theory.
-
B.
hasComplexity
Indicates that something possesses a certain level or type of complexity, often in terms of structure, behavior, or difficulty.
-
C.
computationalClass
chosen
Indicates that two entities share the same computational complexity class or that one entity is categorized within a specified computational complexity class.
-
D.
hasReasoningComplexity
Indicates that an action, process, or decision involves a certain level or type of cognitive or logical complexity in its reasoning.
-
E.
typicalComplexity
Indicates the usual or characteristic level of complexity associated with an entity, process, or situation.
- 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_69e0b4cf62a88190bbf92351e9e57259 |
completed | April 16, 2026, 10:07 a.m. |
| NER | Named-entity recognition | batch_69e6c326daec8190bd4caa41a4b38833 |
completed | April 21, 2026, 12:21 a.m. |
| PD | Predicate disambiguation | batch_69e5c9a1f4f48190aa9fb4ef8f8aea5a |
completed | April 20, 2026, 6:37 a.m. |
Created at: April 16, 2026, 12:42 p.m.