{"id":"W1491595969","doi":"10.1109/asap.1990.145465","title":"Array processing on finite polynomial rings","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Redundancy (engineering); Polynomial ring; Computer science; Testability; Computation; Overhead (engineering); Polynomial; Theoretical computer science; Computational complexity theory; Algorithm; Parallel computing; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0001095098,0.00007870886,0.00006359824,0.00009484687,0.0001384227,0.0001589646,0.0004339647,0.00002649734,0.0001544829],"category_scores_gemma":[0.00001495409,0.00006554911,0.00004991675,0.0003081709,0.00002656551,0.0002549097,0.0000433494,0.00008377505,0.000225038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006670974,"about_ca_system_score_gemma":0.000004398764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001676707,"about_ca_topic_score_gemma":6.59425e-7,"domain_scores_codex":[0.9993837,0.00002055933,0.00008515253,0.0002185064,0.0001172188,0.0001747922],"domain_scores_gemma":[0.9995911,0.00006102301,0.0000279774,0.0002517611,0.00001471391,0.00005348239],"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.00001811544,0.0002443395,0.0005952351,0.00001741581,0.00001336328,0.00001534818,0.002813382,0.0001017789,0.003486408,0.267906,0.01403125,0.7107574],"study_design_scores_gemma":[0.002734184,0.001619847,0.00379291,0.0003152422,0.00002527876,0.00006706962,0.0001749024,0.2310438,0.09422185,0.07859582,0.5849599,0.002449176],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01853763,0.00007381234,0.60864,0.00162049,0.0002751692,0.00006449889,2.970448e-7,0.0005448035,0.3702433],"genre_scores_gemma":[0.9862677,0.000002467469,0.01062447,0.001197657,0.00007984322,0.000003375785,8.978867e-8,0.000004091763,0.001820323],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.96773,"threshold_uncertainty_score":0.2892483,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02148404115082803,"score_gpt":0.2148130405362929,"score_spread":0.1933289993854649,"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."}}