Triple
T9838898
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | de Bruijn–van Aardenne–Ehrenfest theorem |
E239170
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
matrix-tree theorem
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.
|
E824090
|
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: matrix-tree theorem | Statement: [de Bruijn–van Aardenne–Ehrenfest theorem, relatedTo, matrix-tree theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: matrix-tree theorem Context triple: [de Bruijn–van Aardenne–Ehrenfest theorem, relatedTo, matrix-tree theorem]
-
A.
Sylvester determinant
The Sylvester determinant is a mathematical construct introduced by James Joseph Sylvester, typically referring to a determinant associated with resultants and elimination theory in algebra.
-
B.
Cauchy determinant
The Cauchy determinant is a classical determinant formula in linear algebra that gives a closed-form expression for matrices with entries of the form 1/(x_i + y_j), named after the French mathematician Augustin-Louis Cauchy.
-
C.
Cayley–Hamilton theorem
The Cayley–Hamilton theorem is a fundamental result in linear algebra stating that every square matrix satisfies its own characteristic polynomial.
-
D.
Cauchy matrix
A Cauchy matrix is a structured matrix whose entries are defined by the reciprocals of pairwise differences of two sequences, widely used in numerical analysis, interpolation, and algebra.
-
E.
Pólya enumeration theorem
The Pólya enumeration theorem is a fundamental result in combinatorics that counts distinct configurations of objects under group actions by using cycle index polynomials and generating functions.
- 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: matrix-tree theorem Triple: [de Bruijn–van Aardenne–Ehrenfest theorem, relatedTo, matrix-tree theorem]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: matrix-tree theorem Target entity description: 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.
-
A.
Sylvester determinant
The Sylvester determinant is a mathematical construct introduced by James Joseph Sylvester, typically referring to a determinant associated with resultants and elimination theory in algebra.
-
B.
Cauchy determinant
The Cauchy determinant is a classical determinant formula in linear algebra that gives a closed-form expression for matrices with entries of the form 1/(x_i + y_j), named after the French mathematician Augustin-Louis Cauchy.
-
C.
Cayley–Hamilton theorem
The Cayley–Hamilton theorem is a fundamental result in linear algebra stating that every square matrix satisfies its own characteristic polynomial.
-
D.
Cauchy matrix
A Cauchy matrix is a structured matrix whose entries are defined by the reciprocals of pairwise differences of two sequences, widely used in numerical analysis, interpolation, and algebra.
-
E.
Pólya enumeration theorem
The Pólya enumeration theorem is a fundamental result in combinatorics that counts distinct configurations of objects under group actions by using cycle index polynomials and generating functions.
- 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_69ca84e314108190978324a4bdb959f8 |
completed | March 30, 2026, 2:12 p.m. |
| NER | Named-entity recognition | batch_69cdb34921b881909836ba0f5b42a27b |
completed | April 2, 2026, 12:07 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d1d5d145ac8190ad10a4328216ef54 |
completed | April 5, 2026, 3:24 a.m. |
| NEDg | Description generation | batch_69d1d6bb23cc81909efbeccf147018e8 |
completed | April 5, 2026, 3:27 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69d1d726e58c819090135d1ff275d2d8 |
completed | April 5, 2026, 3:29 a.m. |
Created at: March 30, 2026, 8:33 p.m.