Triple
T18151185
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Jacob T. Schwartz |
E434504
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Dunford–Schwartz theorem |
—
|
NE NERFINISHED |
How this triple was built (3 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: Dunford–Schwartz theorem | Statement: [Jacob T. Schwartz, notableWork, Dunford–Schwartz theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Dunford–Schwartz theorem Context triple: [Jacob T. Schwartz, notableWork, Dunford–Schwartz theorem]
-
A.
Banach–Stone theorem
The Banach–Stone theorem is a fundamental result in functional analysis that characterizes compact Hausdorff spaces via isometric isomorphisms between their spaces of continuous real- or complex-valued functions.
-
B.
Herglotz's theorem
Herglotz's theorem is a fundamental result in harmonic analysis and probability theory that characterizes positive-definite functions on the unit circle via representing measures.
-
C.
Banach–Steinhaus theorem
The Banach–Steinhaus theorem is a fundamental result in functional analysis that characterizes when a family of continuous linear operators is uniformly bounded, with major implications for the behavior of sequences of operators on Banach spaces.
-
D.
Scott–Mazur theorem
The Scott–Mazur theorem is a result in functional analysis that characterizes when a Banach space is reflexive in terms of the weak compactness of its closed unit ball.
-
E.
Hille–Yosida theorem
The Hille–Yosida theorem is a fundamental result in functional analysis that characterizes the generators of strongly continuous one-parameter semigroups of linear operators on Banach spaces.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Dunford–Schwartz theorem Target entity description: The Dunford–Schwartz theorem is a fundamental result in functional analysis and ergodic theory that provides convergence properties for iterates of certain linear operators on L¹ and L^∞ spaces.
-
A.
Banach–Stone theorem
The Banach–Stone theorem is a fundamental result in functional analysis that characterizes compact Hausdorff spaces via isometric isomorphisms between their spaces of continuous real- or complex-valued functions.
-
B.
Herglotz's theorem
Herglotz's theorem is a fundamental result in harmonic analysis and probability theory that characterizes positive-definite functions on the unit circle via representing measures.
-
C.
Banach–Steinhaus theorem
The Banach–Steinhaus theorem is a fundamental result in functional analysis that characterizes when a family of continuous linear operators is uniformly bounded, with major implications for the behavior of sequences of operators on Banach spaces.
-
D.
Scott–Mazur theorem
The Scott–Mazur theorem is a result in functional analysis that characterizes when a Banach space is reflexive in terms of the weak compactness of its closed unit ball.
-
E.
Hille–Yosida theorem
The Hille–Yosida theorem is a fundamental result in functional analysis that characterizes the generators of strongly continuous one-parameter semigroups of linear operators on Banach spaces.
- F. None of above. chosen
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_69d8b90aac308190801e2c57d8c5bfe5 |
completed | April 10, 2026, 8:47 a.m. |
| NER | Named-entity recognition | batch_69e4de38d4e08190bc4d430b70b7e288 |
completed | April 19, 2026, 1:52 p.m. |
Created at: April 10, 2026, 10:29 a.m.