{"id":"W2792934134","doi":"10.1007/s10915-018-0675-0","title":"The Partial Fast Fourier Transform","year":2018,"lang":"en","type":"article","venue":"Journal of Scientific Computing","topic":"Scientific Research and Discoveries","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Convolution (computer science); Discrete-time Fourier transform; Fast Fourier transform; Discrete Fourier transform (general); Fourier transform; Fractional Fourier transform; Circular convolution; Cyclotomic fast Fourier transform; Algorithm; Split-radix FFT algorithm; Prime-factor FFT algorithm; Mathematical analysis; Non-uniform discrete Fourier transform; Convolution theorem; Fourier analysis; Hartley transform; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002305751,0.00007284662,0.0001068142,0.00007703662,0.001481102,0.001220115,0.0004416623,0.00001090829,0.0002607251],"category_scores_gemma":[0.00003960144,0.00004251387,0.0001476369,0.0003703375,0.0007494063,0.0002831236,0.00006740128,0.0001616417,0.00005152844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001487099,"about_ca_system_score_gemma":0.0002116194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008429289,"about_ca_topic_score_gemma":0.000005191323,"domain_scores_codex":[0.9984938,0.00004342467,0.0003619201,0.0001371508,0.0006066862,0.0003570008],"domain_scores_gemma":[0.9989148,0.0001212583,0.0002089382,0.0001907197,0.000423934,0.0001403983],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001032491,0.0001206705,0.008361683,0.000005726041,0.0001026555,0.000005957535,0.003447109,0.00009539074,0.004828067,0.01202833,0.06734028,0.9035609],"study_design_scores_gemma":[0.001826978,0.0004762865,0.00470892,0.0001633296,0.00005251575,0.00004191482,0.01218645,0.05369937,0.08365701,0.03340455,0.8093524,0.0004302735],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9304291,0.00006023897,0.04530979,0.000786457,0.004546393,0.00008277864,0.000005718318,0.000006409658,0.01877312],"genre_scores_gemma":[0.9951987,3.699888e-7,0.0006213211,0.000008178235,0.001683748,2.980757e-7,9.728376e-7,0.00000452236,0.002481943],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9031306,"threshold_uncertainty_score":0.9998189,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01789408518222806,"score_gpt":0.2960035950409459,"score_spread":0.2781095098587179,"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."}}