Triple
T22959660
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Symanzik polynomials |
E570857
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Kirchhoff polynomial |
—
|
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: Kirchhoff polynomial | Statement: [Symanzik polynomials, relatedTo, Kirchhoff polynomial]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Kirchhoff polynomial Context triple: [Symanzik polynomials, relatedTo, Kirchhoff polynomial]
-
A.
Tutte polynomial
The Tutte polynomial is a fundamental graph invariant in combinatorics that encodes extensive structural information about a graph, unifying and generalizing numerous other graph invariants such as the chromatic and flow polynomials.
-
B.
R-polynomials
R-polynomials are certain recursively defined polynomials associated with pairs of elements in a Coxeter group that play a key role in the combinatorial and representation-theoretic structure underlying Kazhdan–Lusztig theory.
-
C.
matrix-tree theorem
chosen
The matrix-tree theorem is a fundamental result in algebraic graph theory that expresses the number of spanning trees of a graph as a determinant of a matrix derived from the graph’s Laplacian.
-
D.
Symanzik polynomials
Symanzik polynomials are graph-based polynomials that arise in the parametric representation of Feynman integrals in quantum field theory, encoding the topology and kinematic dependence of Feynman diagrams.
-
E.
Conway polynomial
The Conway polynomial is an invariant of knots and links in topology that assigns a polynomial to each knot, capturing essential information about its structure and helping distinguish non-equivalent knots.
- 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_69e245b212a88190b5259caf51606084 |
completed | April 17, 2026, 2:37 p.m. |
| NER | Named-entity recognition | batch_69f181f3c96081909abd6ec32103d4c3 |
completed | April 29, 2026, 3:58 a.m. |
Created at: April 17, 2026, 3:47 p.m.