Triple

T890978
Position Surface form Disambiguated ID Type / Status
Subject Königsberg E19236 entity
Predicate famousFor P22 FINISHED
Object 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.
E105766 NE FINISHED

How this triple was built (4 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: Seven Bridges of Königsberg problem | Statement: [Königsberg, famousFor, Seven Bridges of Königsberg problem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Seven Bridges of Königsberg problem
Context triple: [Königsberg, famousFor, Seven Bridges of Königsberg problem]
  • A. Königsberg
    Königsberg was a historic Prussian city on the Baltic Sea, renowned as a major cultural and intellectual center of East Prussia and later known as Kaliningrad.
  • B. Mathematical Bridge
    The Mathematical Bridge is a famous wooden footbridge at Queens' College, Cambridge, known for its elegant arch that is constructed entirely from straight timbers.
  • C. Entscheidungsproblem
    The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
  • D. Marco Polo Bridge
    Marco Polo Bridge is a historic stone bridge near Beijing, China, renowned both for its distinctive carved stone lions and as the site of the 1937 clash that marked the start of full-scale war between China and Japan.
  • E. Magere Brug
    Magere Brug is a historic and picturesque white wooden drawbridge in Amsterdam, renowned as one of the city's most iconic canal crossings.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Seven Bridges of Königsberg problem
Triple: [Königsberg, famousFor, Seven Bridges of Königsberg problem]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Seven Bridges of Königsberg problem
Target entity description: 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.
  • A. Königsberg
    Königsberg was a historic Prussian city on the Baltic Sea, renowned as a major cultural and intellectual center of East Prussia and later known as Kaliningrad.
  • B. Mathematical Bridge
    The Mathematical Bridge is a famous wooden footbridge at Queens' College, Cambridge, known for its elegant arch that is constructed entirely from straight timbers.
  • C. Entscheidungsproblem
    The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
  • D. Marco Polo Bridge
    Marco Polo Bridge is a historic stone bridge near Beijing, China, renowned both for its distinctive carved stone lions and as the site of the 1937 clash that marked the start of full-scale war between China and Japan.
  • E. Magere Brug
    Magere Brug is a historic and picturesque white wooden drawbridge in Amsterdam, renowned as one of the city's most iconic canal crossings.
  • F. None of above. chosen

Provenance (5 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_69a4939d37188190848be3d426ebc9ae completed March 1, 2026, 7:29 p.m.
NER Named-entity recognition batch_69a4ad019e448190ab991e85dc6d7708 completed March 1, 2026, 9:17 p.m.
NED1 Entity disambiguation (via context triple) batch_69a7c023464481909759c457e87266ab completed March 4, 2026, 5:16 a.m.
NEDg Description generation batch_69a7c1509a8c81909b8cf074e1ce7169 completed March 4, 2026, 5:21 a.m.
NED2 Entity disambiguation (via description) batch_69a7c21f163881908f7cb02a68ad1220 completed March 4, 2026, 5:24 a.m.
Created at: March 1, 2026, 7:39 p.m.