Triple
T2364628
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Riemann–Lebesgue lemma |
E47351
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Plancherel theorem |
E250731
|
NE FINISHED |
How this triple was built (2 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: Plancherel theorem | Statement: [Riemann–Lebesgue lemma, relatedTo, Plancherel theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Plancherel theorem Context triple: [Riemann–Lebesgue lemma, relatedTo, Plancherel theorem]
-
A.
Wiener–Khinchin theorem
The Wiener–Khinchin theorem is a fundamental result in signal processing and probability theory that relates a wide-sense stationary random process’s autocorrelation function to its power spectral density via the Fourier transform.
-
B.
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.
-
C.
Plancherel theorem for real reductive groups
chosen
The Plancherel theorem for real reductive groups is a fundamental result in representation theory that describes how square-integrable functions on a real reductive Lie group decompose into irreducible unitary representations, generalizing Fourier analysis to this non-abelian setting.
-
D.
Cameron–Martin theorem
The Cameron–Martin theorem is a fundamental result in probability theory and functional analysis that characterizes how Gaussian measures on infinite-dimensional spaces change under shifts by elements of a special Hilbert subspace (the Cameron–Martin space).
-
E.
Fourier
Fourier is a French surname most famously associated with Jean-Baptiste Joseph Fourier, the mathematician and physicist known for developing Fourier analysis and Fourier series.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69a88a1a4a6081908645b0f2914521ab |
completed | March 4, 2026, 7:38 p.m. |
| NER | Named-entity recognition | batch_69abc7486cb48190acef1891cc87bdb1 |
completed | March 7, 2026, 6:35 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69aea896e0388190aabff2d70787dc43 |
completed | March 9, 2026, 11:01 a.m. |
Created at: March 4, 2026, 7:55 p.m.