Triple
T718425
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Stanislaw Ulam |
E14360
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Ulam stability
Ulam stability is a concept in the theory of functional equations that studies when approximate solutions imply the existence of exact solutions nearby, forming the basis of what is now called Hyers–Ulam stability.
|
E85413
|
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: Ulam stability | Statement: [Stanislaw Ulam, notableWork, Ulam stability]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Ulam stability Context triple: [Stanislaw Ulam, notableWork, Ulam stability]
-
A.
von Neumann stability analysis
Von Neumann stability analysis is a mathematical technique used in numerical analysis to determine the stability of finite difference schemes for solving partial differential equations by examining the growth of Fourier modes.
-
B.
Israel–Carter–Robinson uniqueness theorems
The Israel–Carter–Robinson uniqueness theorems are a set of results in general relativity showing that stationary, asymptotically flat black holes in four-dimensional spacetime are completely characterized by just their mass, charge, and angular momentum.
-
C.
Nyquist stability criterion
The Nyquist stability criterion is a graphical frequency-domain method in control theory used to determine the stability of feedback systems by analyzing how their open-loop transfer function encircles a critical point in the complex plane.
-
D.
Riemann–Lebesgue lemma
The Riemann–Lebesgue lemma is a fundamental result in Fourier analysis stating that the Fourier coefficients (or transform) of an integrable function vanish at infinity.
-
E.
Berry–Esseen theorem
The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
- 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: Ulam stability Triple: [Stanislaw Ulam, notableWork, Ulam stability]
Generated description
Ulam stability is a concept in the theory of functional equations that studies when approximate solutions imply the existence of exact solutions nearby, forming the basis of what is now called Hyers–Ulam stability.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Ulam stability Target entity description: Ulam stability is a concept in the theory of functional equations that studies when approximate solutions imply the existence of exact solutions nearby, forming the basis of what is now called Hyers–Ulam stability.
-
A.
von Neumann stability analysis
Von Neumann stability analysis is a mathematical technique used in numerical analysis to determine the stability of finite difference schemes for solving partial differential equations by examining the growth of Fourier modes.
-
B.
Israel–Carter–Robinson uniqueness theorems
The Israel–Carter–Robinson uniqueness theorems are a set of results in general relativity showing that stationary, asymptotically flat black holes in four-dimensional spacetime are completely characterized by just their mass, charge, and angular momentum.
-
C.
Nyquist stability criterion
The Nyquist stability criterion is a graphical frequency-domain method in control theory used to determine the stability of feedback systems by analyzing how their open-loop transfer function encircles a critical point in the complex plane.
-
D.
Riemann–Lebesgue lemma
The Riemann–Lebesgue lemma is a fundamental result in Fourier analysis stating that the Fourier coefficients (or transform) of an integrable function vanish at infinity.
-
E.
Berry–Esseen theorem
The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
- 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_69a4934a36e081909e7abef98b898a4e |
completed | March 1, 2026, 7:28 p.m. |
| NER | Named-entity recognition | batch_69a4a58d4c3c8190ad4527d14bca5e6e |
completed | March 1, 2026, 8:46 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69a5dcb77bc481909d79542001fafbd2 |
completed | March 2, 2026, 6:53 p.m. |
| NEDg | Description generation | batch_69a5de57bbec81908a5d1202299194f4 |
completed | March 2, 2026, 7 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69a60952c6388190a23a178d695eec6e |
completed | March 2, 2026, 10:04 p.m. |
Created at: March 1, 2026, 7:37 p.m.