{"id":"W3049056399","doi":"10.1109/tcomm.2020.3016648","title":"A Distributed Low-Complexity Coding Solution for Large-Scale Distributed FFT","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Fast Fourier transform; Computer science; Computational complexity theory; Coding (social sciences); Decoding methods; Distributed algorithm; Distributed computing; Node (physics); Computation; Distributed data store; Parallel computing; Computer engineering; Algorithm; Mathematics; Engineering","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","sts"],"consensus_categories":[],"category_scores_codex":[0.0003233681,0.0002239979,0.0002537814,0.0001055141,0.001316504,0.0001523794,0.002432864,0.0001213026,0.00001375726],"category_scores_gemma":[0.00006171269,0.0002567965,0.0002237847,0.0009824198,0.0001204022,0.0004520542,0.00004409893,0.0005164602,0.00003944313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001912099,"about_ca_system_score_gemma":0.00009699915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000464464,"about_ca_topic_score_gemma":0.0003176649,"domain_scores_codex":[0.9982838,0.0001973648,0.0004289019,0.0004577158,0.0002233624,0.0004088684],"domain_scores_gemma":[0.996758,0.0005086488,0.000164049,0.002107869,0.0002664121,0.0001950477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001215148,0.02245617,0.0006564381,0.001557294,0.001403557,0.00002217532,0.05395107,0.02377398,0.2309981,0.3843955,0.09818382,0.1813868],"study_design_scores_gemma":[0.0005766475,0.0001663443,0.0001548282,0.00006216043,0.00004244296,0.00000609923,0.00012149,0.9770133,0.01196611,0.002168665,0.007383157,0.0003387136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003191404,0.00003293965,0.9767044,0.01883343,0.0002406388,0.0006893201,0.001170775,0.001847209,0.0001621253],"genre_scores_gemma":[0.7809942,0.00004452145,0.2179209,0.0004772387,0.00002262028,0.0003363394,0.0001654274,0.0000208501,0.00001794785],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9532394,"threshold_uncertainty_score":0.9999884,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08301009275867412,"score_gpt":0.3140323364942881,"score_spread":0.231022243735614,"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."}}