Triple
T6858905
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Wiener–Khinchin theorem |
E158222
|
entity |
| Predicate | alsoKnownAs |
P39
|
FINISHED |
| Object | Wiener–Khinchin–Einstein theorem |
E158222
|
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: Wiener–Khinchin–Einstein theorem | Statement: [Wiener–Khinchin theorem, alsoKnownAs, Wiener–Khinchin–Einstein theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Wiener–Khinchin–Einstein theorem Context triple: [Wiener–Khinchin theorem, alsoKnownAs, Wiener–Khinchin–Einstein theorem]
-
A.
Wiener–Khinchin theorem
chosen
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.
Parseval's theorem
Parseval's theorem is a fundamental result in Fourier analysis that equates the total energy of a function in the time (or spatial) domain with the total energy of its representation in the frequency domain.
-
C.
Khinchin–Kolmogorov theorem
The Khinchin–Kolmogorov theorem is a fundamental result in probability theory that provides conditions under which series of independent random variables converge almost surely.
-
D.
Kramers–Kronig relations
The Kramers–Kronig relations are fundamental mathematical formulas in physics that connect the real and imaginary parts of a complex response function, expressing how causality constrains the frequency-dependent behavior of physical systems.
-
E.
de Bruijn–van Aardenne–Ehrenfest theorem
The de Bruijn–van Aardenne–Ehrenfest theorem is a fundamental result in combinatorics that characterizes the number of Eulerian circuits in directed graphs, particularly de Bruijn graphs, and underpins constructions in coding theory and discrete mathematics.
- 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_69c68830cdbc8190a8301c7a9d9f651a |
completed | March 27, 2026, 1:37 p.m. |
| NER | Named-entity recognition | batch_69c6d8720bd48190adb446130a03d2bf |
completed | March 27, 2026, 7:20 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c74283a6e0819090366d8d677ed4fa |
completed | March 28, 2026, 2:52 a.m. |
Created at: March 27, 2026, 2:21 p.m.