Triple

T15860260
Position Surface form Disambiguated ID Type / Status
Subject Riesz–Fischer theorem E384563 entity
Predicate relatedTo P37 FINISHED
Object Parseval theorem E624505 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: Parseval theorem | Statement: [Riesz–Fischer theorem, relatedTo, Parseval theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Parseval theorem
Context triple: [Riesz–Fischer theorem, relatedTo, Parseval theorem]
  • A. Parseval's theorem chosen
    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.
  • B. 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.
  • C. Fourier inversion theorem
    The Fourier inversion theorem is a fundamental result in harmonic analysis that guarantees, under suitable conditions, that a function can be exactly reconstructed from its Fourier transform.
  • D. Fourier transform
    The Fourier transform is a mathematical operation that decomposes a function or signal into its constituent frequencies, widely used in engineering, physics, and signal processing.
  • E. Fourier analysis
    Fourier analysis is a mathematical method for decomposing functions or signals into sums of sinusoidal components, widely used in fields such as signal processing, physics, and engineering.
  • 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_69d86da422088190aac39e32e6c68429 completed April 10, 2026, 3:25 a.m.
NER Named-entity recognition batch_69e1555a1f008190bb3f03b0f35ed8a4 completed April 16, 2026, 9:32 p.m.
NED1 Entity disambiguation (via context triple) batch_69ffa14da7ac8190bbef49a1602a76fe completed May 9, 2026, 9:04 p.m.
Created at: April 10, 2026, 4:50 a.m.