Triple
T20836455
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | NP-hardness |
E512971
|
entity |
| Predicate | relatedClass |
P25008
|
FINISHED |
| Object | co-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: co-NP | Statement: [NP-hardness, relatedClass, co-NP]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: co-NP Context triple: [NP-hardness, relatedClass, co-NP]
-
A.
NP-completeness
NP-completeness is a central concept in computational complexity theory that classifies decision problems believed to be among the hardest in NP, such that a polynomial-time solution to any one of them would yield polynomial-time solutions to all problems in NP.
-
B.
NP
NP was the reporting mark used by the historic Northern Pacific Railway, a major transcontinental railroad in the northern United States.
-
C.
NP
NP is the abbreviation commonly used for the National Party, the former ruling political party of apartheid-era South Africa.
-
D.
NP
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.
NP
NP is a UK postcode area covering parts of Newport and surrounding regions in south-east Wales.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: co-NP Target entity description: co-NP is the complexity class containing decision problems whose complements are in NP, typically characterized by efficiently verifiable proofs of "no" instances.
-
A.
NP-completeness
NP-completeness is a central concept in computational complexity theory that classifies decision problems believed to be among the hardest in NP, such that a polynomial-time solution to any one of them would yield polynomial-time solutions to all problems in NP.
-
B.
NP
NP was the reporting mark used by the historic Northern Pacific Railway, a major transcontinental railroad in the northern United States.
-
C.
NP
NP is the abbreviation commonly used for the National Party, the former ruling political party of apartheid-era South Africa.
-
D.
NP
NP is a UK postcode area covering parts of Newport and surrounding regions in south-east Wales.
-
E.
NP
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.
- F. None of above. chosen
Provenance (2 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. |
Created at: April 16, 2026, 12:42 p.m.