Triple
T19474416
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Ronald N. Bracewell |
E487206
|
entity |
| Predicate | authorOf |
P4244
|
FINISHED |
| Object | The Hartley Transform |
—
|
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: The Hartley Transform | Statement: [Ronald N. Bracewell, authorOf, The Hartley Transform]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: The Hartley Transform Context triple: [Ronald N. Bracewell, authorOf, The Hartley Transform]
-
A.
Walsh–Hadamard transform
The Walsh–Hadamard transform is an orthogonal, non-sinusoidal signal transform that decomposes data into a basis of square-wave-like functions, widely used in communications, coding theory, and signal processing.
-
B.
Hilbert transform
The Hilbert transform is an integral transform that produces the harmonic conjugate of a real-valued function, playing a central role in signal processing, harmonic analysis, and the theory of analytic signals.
-
C.
Cooley–Tukey Fast Fourier Transform algorithm
The Cooley–Tukey Fast Fourier Transform algorithm is a widely used, efficient method for computing the discrete Fourier transform that revolutionized digital signal processing and numerical analysis.
-
D.
Modified Discrete Cosine Transform
Modified Discrete Cosine Transform is a lapped transform widely used in audio coding and compression (e.g., MP3, AAC) to efficiently represent overlapping time-domain signals in the frequency domain with reduced artifacts.
-
E.
The Fourier Integral and Certain of Its Applications
The Fourier Integral and Certain of Its Applications is a foundational mathematical work by Norbert Wiener that develops and applies Fourier analysis to problems in harmonic analysis and related areas.
- 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: The Hartley Transform Target entity description: The Hartley Transform is a mathematical integral transform closely related to the Fourier transform, used for signal processing and analysis with real-valued functions.
-
A.
Walsh–Hadamard transform
The Walsh–Hadamard transform is an orthogonal, non-sinusoidal signal transform that decomposes data into a basis of square-wave-like functions, widely used in communications, coding theory, and signal processing.
-
B.
Hilbert transform
The Hilbert transform is an integral transform that produces the harmonic conjugate of a real-valued function, playing a central role in signal processing, harmonic analysis, and the theory of analytic signals.
-
C.
Cooley–Tukey Fast Fourier Transform algorithm
The Cooley–Tukey Fast Fourier Transform algorithm is a widely used, efficient method for computing the discrete Fourier transform that revolutionized digital signal processing and numerical analysis.
-
D.
Modified Discrete Cosine Transform
Modified Discrete Cosine Transform is a lapped transform widely used in audio coding and compression (e.g., MP3, AAC) to efficiently represent overlapping time-domain signals in the frequency domain with reduced artifacts.
-
E.
The Fourier Integral and Certain of Its Applications
The Fourier Integral and Certain of Its Applications is a foundational mathematical work by Norbert Wiener that develops and applies Fourier analysis to problems in harmonic analysis and related areas.
- 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_69d8e8d924388190b847cb15bb3d0aff |
completed | April 10, 2026, 12:11 p.m. |
| NER | Named-entity recognition | batch_69e633ef69508190b0d71ef663ba8977 |
completed | April 20, 2026, 2:10 p.m. |
Created at: April 10, 2026, 1:39 p.m.