Triple
T26992451
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | SAT |
E679891
|
entity |
| Predicate | npCompletenessProofYear |
P142030
|
FINISHED |
| Object | 1971 |
—
|
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: 1971 | Statement: [SAT, npCompletenessProofYear, 1971]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: npCompletenessProofYear Context triple: [SAT, npCompletenessProofYear, 1971]
-
A.
yearNPCompletenessProved
chosen
Indicates the year in which the NP-completeness of a given problem was formally proved.
-
B.
NPCompletenessProvedBy
Indicates that the NP-completeness of a problem is established through a proof provided by a particular person, work, or method.
-
C.
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.
-
D.
NPCompletenessProvedIndependentlyBy
Indicates that the NP-completeness of a problem was established in a separate, independent proof by the specified agent or source.
-
E.
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).
- 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_69eeeb5138ac8190b3c273ddc659a54f |
completed | April 27, 2026, 4:51 a.m. |
| NER | Named-entity recognition | batch_69f625411c14819086492062e86ba8d5 |
completed | May 2, 2026, 4:24 p.m. |
| PD | Predicate disambiguation | batch_69f623a91b9c8190b2e2fdbc55cb89b6 |
completed | May 2, 2026, 4:17 p.m. |
Created at: April 27, 2026, 6:52 a.m.