Triple
T15918584
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Szekeres snark |
E386032
|
entity |
| Predicate | isComparedWith |
P278
|
FINISHED |
| Object |
Flower snark
The Flower snark is a well-known example of a snark graph in graph theory, notable for being a bridgeless cubic graph with chromatic index four that serves as a counterexample in edge-coloring problems.
|
E1182412
|
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: Flower snark | Statement: [Szekeres snark, isComparedWith, Flower snark]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Flower snark Context triple: [Szekeres snark, isComparedWith, Flower snark]
-
A.
Szekeres snark
The Szekeres snark is a famous cubic graph in graph theory that serves as a counterexample in edge-coloring problems and helped advance the study of snark graphs.
-
B.
Conway's 99-graph problem
Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
-
C.
Graham–Pollak theorem
The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
-
D.
Szekeres configuration
The Szekeres configuration is a notable geometric arrangement in projective geometry consisting of points and lines with specific incidence properties, studied for its combinatorial and symmetry characteristics.
-
E.
Sierpiński graph
The Sierpiński graph is a self-similar, fractal-like graph structure closely related to the Sierpiński triangle and studied in graph theory and fractal geometry.
- 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: Flower snark Triple: [Szekeres snark, isComparedWith, Flower snark]
Generated description
The Flower snark is a well-known example of a snark graph in graph theory, notable for being a bridgeless cubic graph with chromatic index four that serves as a counterexample in edge-coloring problems.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Flower snark Target entity description: The Flower snark is a well-known example of a snark graph in graph theory, notable for being a bridgeless cubic graph with chromatic index four that serves as a counterexample in edge-coloring problems.
-
A.
Szekeres snark
The Szekeres snark is a famous cubic graph in graph theory that serves as a counterexample in edge-coloring problems and helped advance the study of snark graphs.
-
B.
Conway's 99-graph problem
Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
-
C.
Graham–Pollak theorem
The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
-
D.
Szekeres configuration
The Szekeres configuration is a notable geometric arrangement in projective geometry consisting of points and lines with specific incidence properties, studied for its combinatorial and symmetry characteristics.
-
E.
Sierpiński graph
The Sierpiński graph is a self-similar, fractal-like graph structure closely related to the Sierpiński triangle and studied in graph theory and fractal geometry.
- 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_69d86da686e4819097cbf3b1fc2d881d |
completed | April 10, 2026, 3:25 a.m. |
| NER | Named-entity recognition | batch_69e1567ff9e48190b73cb101fc3f7b2b |
completed | April 16, 2026, 9:37 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ffb05d1fb481909b42bea774a15c70 |
completed | May 9, 2026, 10:08 p.m. |
| NEDg | Description generation | batch_69ffb0cfac808190b32bb25659603fb4 |
completed | May 9, 2026, 10:10 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69ffb15b987c8190ae9c96f15fc55b27 |
completed | May 9, 2026, 10:12 p.m. |
Created at: April 10, 2026, 4:52 a.m.