Triple
T21088304
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Karp reduction |
E519560
|
entity |
| Predicate | canonicalExampleTo |
P135707
|
FINISHED |
| Object | HAMILTONIAN CYCLE |
—
|
NE NERFINISHED |
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: HAMILTONIAN CYCLE | Statement: [Karp reduction, canonicalExampleTo, HAMILTONIAN CYCLE]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: HAMILTONIAN CYCLE Context triple: [Karp reduction, canonicalExampleTo, HAMILTONIAN CYCLE]
-
A.
Hamiltonian cycle concept
chosen
The Hamiltonian cycle concept is a fundamental idea in graph theory describing a cycle that visits each vertex of a graph exactly once and returns to the starting point.
-
B.
Hamiltonian path
A Hamiltonian path is a route through a graph that visits each vertex exactly once without necessarily returning to the starting point.
-
C.
Eulerian trail
An Eulerian trail is a path in a graph that traverses every edge exactly once, possibly revisiting vertices.
-
D.
Orientzyklus
Orientzyklus is a series of adventure novels by Karl May set in the Middle East, featuring the narrator Kara Ben Nemsi and his companion Hadschi Halef Omar.
-
E.
Clique problem
The Clique problem is a classic NP-complete decision problem in graph theory that asks whether a graph contains a fully connected subgraph (clique) of at least a given size.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
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_69e0b507dd9081908fb8bfcbef4c8b46 |
completed | April 16, 2026, 10:08 a.m. |
| NER | Named-entity recognition | batch_69e7094cebe08190bb10f51a45c244ec |
completed | April 21, 2026, 5:21 a.m. |
Created at: April 16, 2026, 2:50 p.m.