{"id":"W2050784420","doi":"10.1145/1837274.1837424","title":"A novel optimal single constant multiplication algorithm","year":2010,"lang":"en","type":"article","venue":"","topic":"Digital Filter Design and Implementation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Multiplication (music); Constant (computer programming); Pruning; Novelty; Computer science; Algorithm; Multiplication algorithm; Mathematics; Arithmetic; Combinatorics","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.00008188403,0.00006165566,0.00004727006,0.00004432546,0.00004190196,0.0002914956,0.0002936541,0.00002237062,0.00003901292],"category_scores_gemma":[0.00001452324,0.00005459374,0.00002235494,0.0001340181,0.00002366007,0.0008704764,0.00008008966,0.00005204832,0.00008822023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001034845,"about_ca_system_score_gemma":0.00002492401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001837309,"about_ca_topic_score_gemma":0.000008706644,"domain_scores_codex":[0.9994199,0.000004134173,0.0001250506,0.0001920171,0.0001258095,0.0001331466],"domain_scores_gemma":[0.9995532,0.00002904221,0.00003646567,0.0002549835,0.0000676425,0.00005864269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[6.054161e-7,0.00009421133,0.00001720873,7.09057e-7,0.000002698796,5.468513e-7,0.0001134837,0.000001354877,0.4781721,0.08656778,0.00049156,0.4345377],"study_design_scores_gemma":[0.00121921,0.0002399093,0.00165905,0.000004886461,0.000004128775,0.0001107831,0.00006625732,0.6181241,0.3404364,0.002899491,0.03484001,0.0003957679],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003535127,0.0000011116,0.979242,0.0003727389,0.0002257388,0.000115535,0.000005045789,0.0001512733,0.01635142],"genre_scores_gemma":[0.3032388,1.664915e-7,0.6960654,0.0002643547,0.00002527184,0.000008809943,0.000006855441,0.000002950354,0.0003873885],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6181228,"threshold_uncertainty_score":0.2810899,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03249564530510346,"score_gpt":0.2695791926064917,"score_spread":0.2370835473013882,"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."}}