MétaCan
Menu
Back to cohort
Record W2090885898 · doi:10.1145/2733693.2733698

A Truncated Fourier Transform middle product

2015· article· en· W2090885898 on OpenAlexaff
Andrew Arnold, Éric Schost

Bibliographic record

VenueACM communications in computer algebra · 2015
Typearticle
Languageen
FieldComputer Science
TopicDigital Filter Design and Implementation
Canadian institutionsWestern UniversityUniversity of Waterloo
Fundersnot available
KeywordsProduct (mathematics)Fast Fourier transformPower–delay productMathematicsFourier transformPolynomialFourier seriesMultiplication (music)Power (physics)Computer scienceAlgorithmCombinatoricsMathematical analysisPhysicsPower consumptionGeometry

Abstract

fetched live from OpenAlex

The middle product computes the middle n terms of a (2 n --1)xn polynomial product, with effectively the same cost as computing an n x n polynomial product. The middle product allows for faster power series operations and Newton iteration. Middle product variants of classical, Karatsuba, and FFT-based multiplication algorithms are known. We present a middle product algorithm based on the Truncated Fourier Transform.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.017
Threshold uncertainty score0.057

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0030.004
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0170.007

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.155
GPT teacher head0.326
Teacher spread0.171 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations2
Published2015
Admission routes1
Has abstractyes

Explore more

Same venueACM communications in computer algebraSame topicDigital Filter Design and ImplementationFrench-language works237,207