Triple

T18628462
Position Surface form Disambiguated ID Type / Status
Subject Hamiltonian cycle E455347 entity
Predicate contrastedWith P278 FINISHED
Object Eulerian 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: Eulerian cycle | Statement: [Hamiltonian cycle, contrastedWith, Eulerian cycle]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Eulerian cycle
Context triple: [Hamiltonian cycle, contrastedWith, Eulerian cycle]
  • A. Eulerian trail chosen
    An Eulerian trail is a path in a graph that traverses every edge exactly once, possibly revisiting vertices.
  • B. Hamiltonian cycle concept
    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.
  • C. 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.
  • D. Eulerian digraph
    An Eulerian digraph is a directed graph in which every vertex has equal in-degree and out-degree, allowing for a closed trail that traverses each edge exactly once.
  • E. Seven Bridges of Königsberg problem
    The Seven Bridges of Königsberg problem is a historic puzzle in graph theory that asks whether one can walk through the city of Königsberg crossing each of its seven bridges exactly once, leading Euler to found the field of topology.
  • 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_69d8d38cc7948190a55ea64e5638994e completed April 10, 2026, 10:40 a.m.
NER Named-entity recognition batch_69e54f063a1c819087e544c64f5cf80f completed April 19, 2026, 9:54 p.m.
Created at: April 10, 2026, 11:46 a.m.