Triple
T11960953
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Isserlis’ theorem |
E284666
|
entity |
| Predicate | property |
P5774
|
FINISHED |
| Object |
expresses any even-order joint moment as a sum over pairings of indices
Isserlis’ theorem is a result in probability theory that provides a formula for computing higher-order moments of jointly Gaussian random variables in terms of their covariances.
|
E956263
|
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: expresses any even-order joint moment as a sum over pairings of indices | Statement: [Isserlis’ theorem, property, expresses any even-order joint moment as a sum over pairings of indices]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: expresses any even-order joint moment as a sum over pairings of indices Context triple: [Isserlis’ theorem, property, expresses any even-order joint moment as a sum over pairings of indices]
-
A.
Clebsch–Gordan coefficients
Clebsch–Gordan coefficients are numerical factors in quantum mechanics and representation theory that describe how to combine two angular momenta (or group representations) into a single resultant one.
-
B.
Vandermonde matrix
A Vandermonde matrix is a structured matrix whose rows (or columns) are geometric progressions of given numbers, widely used in polynomial interpolation, determinant theory, and numerical analysis.
-
C.
Jacobi ensemble
The Jacobi ensemble is a family of random matrix models whose eigenvalue distributions are supported on a finite interval and are closely connected to classical orthogonal polynomials and beta-type probability measures.
-
D.
Cauchy–Binet formula
The Cauchy–Binet formula is a fundamental result in linear algebra that expresses the determinant of a product of two rectangular matrices as a sum of products of determinants of their square submatrices.
-
E.
Jacobi matrix
A Jacobi matrix is a tridiagonal matrix, often symmetric, that arises in numerical analysis and mathematical physics, particularly in the study of orthogonal polynomials and eigenvalue problems.
- 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: expresses any even-order joint moment as a sum over pairings of indices Triple: [Isserlis’ theorem, property, expresses any even-order joint moment as a sum over pairings of indices]
Generated description
Isserlis’ theorem is a result in probability theory that provides a formula for computing higher-order moments of jointly Gaussian random variables in terms of their covariances.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: expresses any even-order joint moment as a sum over pairings of indices Target entity description: Isserlis’ theorem is a result in probability theory that provides a formula for computing higher-order moments of jointly Gaussian random variables in terms of their covariances.
-
A.
Clebsch–Gordan coefficients
Clebsch–Gordan coefficients are numerical factors in quantum mechanics and representation theory that describe how to combine two angular momenta (or group representations) into a single resultant one.
-
B.
Vandermonde matrix
A Vandermonde matrix is a structured matrix whose rows (or columns) are geometric progressions of given numbers, widely used in polynomial interpolation, determinant theory, and numerical analysis.
-
C.
Jacobi ensemble
The Jacobi ensemble is a family of random matrix models whose eigenvalue distributions are supported on a finite interval and are closely connected to classical orthogonal polynomials and beta-type probability measures.
-
D.
Cauchy–Binet formula
The Cauchy–Binet formula is a fundamental result in linear algebra that expresses the determinant of a product of two rectangular matrices as a sum of products of determinants of their square submatrices.
-
E.
Jacobi matrix
A Jacobi matrix is a tridiagonal matrix, often symmetric, that arises in numerical analysis and mathematical physics, particularly in the study of orthogonal polynomials and eigenvalue problems.
- 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_69d6ab2eaeb881909f7914758f859413 |
completed | April 8, 2026, 7:23 p.m. |
| NER | Named-entity recognition | batch_69d9036941948190b150369094551731 |
completed | April 10, 2026, 2:04 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69f4592fa9a48190a0450e3d0c57c4d3 |
completed | May 1, 2026, 7:41 a.m. |
| NEDg | Description generation | batch_69f4645ef63881909b46937f73d637a3 |
completed | May 1, 2026, 8:29 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69f465be4db08190882898a17d077019 |
completed | May 1, 2026, 8:35 a.m. |
Created at: April 8, 2026, 9:45 p.m.