Triple
T10946644
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | E. H. Moore |
E258613
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Moore–Penrose inverse (precursor ideas)
The Moore–Penrose inverse (precursor ideas) refers to E. H. Moore’s early foundational work on generalized matrix inverses, which laid the groundwork for the modern concept of the Moore–Penrose pseudoinverse.
|
E895655
|
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: Moore–Penrose inverse (precursor ideas) | Statement: [E. H. Moore, knownFor, Moore–Penrose inverse (precursor ideas)]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Moore–Penrose inverse (precursor ideas) Context triple: [E. H. Moore, knownFor, Moore–Penrose inverse (precursor ideas)]
-
A.
Hadamard’s example of ill-posed problems
Hadamard’s example of ill-posed problems is a classical mathematical construction illustrating how small changes in input data can cause large, unstable changes in solutions, thereby violating the standard criteria for well-posedness in analysis and partial differential equations.
-
B.
Bartels–Stewart algorithm
The Bartels–Stewart algorithm is a numerical linear algebra method that efficiently solves certain matrix equations, particularly Sylvester and Lyapunov equations, using Schur decompositions.
-
C.
Jacobi's theorem on determinants
Jacobi's theorem on determinants is a fundamental result in linear algebra that relates the minors of a matrix to the minors of its adjugate (or inverse), providing key identities used in determinant and matrix theory.
-
D.
Sylvester’s law of inertia
Sylvester’s law of inertia is a theorem in linear algebra stating that the numbers of positive, negative, and zero eigenvalues (the inertia) of a real symmetric matrix are invariant under change of basis.
-
E.
Theory of Linear Operations
Theory of Linear Operations is a foundational 1932 monograph by Stefan Banach that systematically developed functional analysis and the theory of Banach spaces.
- 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: Moore–Penrose inverse (precursor ideas) Triple: [E. H. Moore, knownFor, Moore–Penrose inverse (precursor ideas)]
Generated description
The Moore–Penrose inverse (precursor ideas) refers to E. H. Moore’s early foundational work on generalized matrix inverses, which laid the groundwork for the modern concept of the Moore–Penrose pseudoinverse.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Moore–Penrose inverse (precursor ideas) Target entity description: The Moore–Penrose inverse (precursor ideas) refers to E. H. Moore’s early foundational work on generalized matrix inverses, which laid the groundwork for the modern concept of the Moore–Penrose pseudoinverse.
-
A.
Hadamard’s example of ill-posed problems
Hadamard’s example of ill-posed problems is a classical mathematical construction illustrating how small changes in input data can cause large, unstable changes in solutions, thereby violating the standard criteria for well-posedness in analysis and partial differential equations.
-
B.
Bartels–Stewart algorithm
The Bartels–Stewart algorithm is a numerical linear algebra method that efficiently solves certain matrix equations, particularly Sylvester and Lyapunov equations, using Schur decompositions.
-
C.
Jacobi's theorem on determinants
Jacobi's theorem on determinants is a fundamental result in linear algebra that relates the minors of a matrix to the minors of its adjugate (or inverse), providing key identities used in determinant and matrix theory.
-
D.
Sylvester’s law of inertia
Sylvester’s law of inertia is a theorem in linear algebra stating that the numbers of positive, negative, and zero eigenvalues (the inertia) of a real symmetric matrix are invariant under change of basis.
-
E.
Theory of Linear Operations
Theory of Linear Operations is a foundational 1932 monograph by Stefan Banach that systematically developed functional analysis and the theory of Banach spaces.
- 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_69d6aa8769b4819082bfe5e61b9017f0 |
completed | April 8, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69d770eaaea08190b06e508600d8a305 |
completed | April 9, 2026, 9:27 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e23c3c885081908edcece772b2e759 |
completed | April 17, 2026, 1:57 p.m. |
| NEDg | Description generation | batch_69e24542b4f081909c97621f04da8ecc |
completed | April 17, 2026, 2:35 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69e248f7f96481909fa6e6cd07891566 |
completed | April 17, 2026, 2:51 p.m. |
Created at: April 8, 2026, 9:23 p.m.