Triple
T18628475
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Hamiltonian cycle |
E455347
|
entity |
| Predicate | complexityOfRecognition |
P28756
|
FINISHED |
| Object | NP-complete in general graphs |
—
|
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: NP-complete in general graphs | Statement: [Hamiltonian cycle, complexityOfRecognition, NP-complete in general graphs]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: complexityOfRecognition Context triple: [Hamiltonian cycle, complexityOfRecognition, NP-complete in general graphs]
-
A.
complexityClassRelation
Indicates a relationship between two computational complexity classes, such as inclusion, equivalence, or separation, within the hierarchy of complexity theory.
-
B.
isUnconditionalPolynomialTime
Indicates that an algorithm or computation runs in polynomial time without relying on any unproven assumptions or conjectures.
-
C.
hasComplexity
chosen
Indicates that something possesses a certain level or type of complexity, often in terms of structure, behavior, or difficulty.
-
D.
firstNPCompleteProblem
Indicates that the subject is the earliest or original problem proven to be NP-complete within a given context or theory.
-
E.
leafComplexity
Indicates the degree of division or elaboration in a leaf’s structure, such as whether it is simple, lobed, or compound.
- 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_69d8d38cc7948190a55ea64e5638994e |
completed | April 10, 2026, 10:40 a.m. |
| NER | Named-entity recognition | batch_69e54f063a1c819087e544c64f5cf80f |
completed | April 19, 2026, 9:54 p.m. |
| PD | Predicate disambiguation | batch_69e478d4a7948190a4bb9223bb5dddfc |
completed | April 19, 2026, 6:40 a.m. |
Created at: April 10, 2026, 11:46 a.m.