{"id":"W4301343525","doi":"10.48550/arxiv.1001.5272","title":"An in-place truncated Fourier transform and applications to polynomial\\n multiplication","year":2010,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fast Fourier transform; Multiplication (music); Split-radix FFT algorithm; Smoothing; Inverse; Polynomial; Arithmetic; Prime-factor FFT algorithm; Fourier transform; Mathematics; Rader's FFT algorithm; Discrete Fourier transform (general); Algorithm; Computer science; Discrete mathematics; Combinatorics; Mathematical analysis; Short-time Fourier transform; Fourier analysis; Statistics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005498425,0.0005928027,0.0005418683,0.0007793105,0.0004290692,0.0003388906,0.001924586,0.0006157684,0.00003367887],"category_scores_gemma":[0.00002510414,0.0007558283,0.0001567468,0.001701952,0.0002198943,0.001044997,0.0006944606,0.00105959,0.0001350266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003275885,"about_ca_system_score_gemma":0.0004701619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001012455,"about_ca_topic_score_gemma":0.001701211,"domain_scores_codex":[0.996037,0.0001886407,0.0005658072,0.002402051,0.0001468998,0.0006596047],"domain_scores_gemma":[0.9968233,0.0001886483,0.0003263485,0.00164773,0.0002361133,0.0007779103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005562083,0.001305481,0.003113808,0.0001957201,0.0001190618,0.00006673342,0.005309509,0.3296545,0.00996153,0.07780141,0.0001206693,0.5717954],"study_design_scores_gemma":[0.001399024,0.0001706231,0.01199999,0.00006522347,0.00006941806,0.00001049933,0.0001229156,0.9665208,0.0008927299,0.01197818,0.005847044,0.0009235942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.452778,0.00002168384,0.5442833,0.0006301173,0.0002801674,0.001443112,0.00002849777,0.0001264486,0.0004086556],"genre_scores_gemma":[0.993085,0.0001320801,0.0056646,0.0002226532,0.0002548744,0.00002947439,0.00006153784,0.00003454174,0.0005152366],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6368663,"threshold_uncertainty_score":0.9994892,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03470318859741409,"score_gpt":0.2049086806593006,"score_spread":0.1702054920618865,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}