{"id":"W2089902593","doi":"10.1109/tvlsi.2008.2003004","title":"Time-Efficient Single Constant Multiplication Based on Overlapping Digit Patterns","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Multiplication (music); Adder; Constant (computer programming); Computer science; Heuristic; Algorithm; Multiplication algorithm; Arithmetic; Divide and conquer algorithms; Parallel computing; Mathematics; Combinatorics; Artificial intelligence; Binary number","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.0004731781,0.0003420482,0.0003809612,0.0003278212,0.0003873824,0.0004627125,0.0004614163,0.0001604929,0.00003573461],"category_scores_gemma":[0.00002340101,0.0002934628,0.0002345869,0.0006749728,0.00004498462,0.0004190225,0.000002519656,0.0003571719,0.0002026023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000351106,"about_ca_system_score_gemma":0.00006881002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003291374,"about_ca_topic_score_gemma":0.000007111143,"domain_scores_codex":[0.9971622,0.0003242235,0.000637602,0.0007435359,0.0006781152,0.0004543314],"domain_scores_gemma":[0.9982004,0.0003269382,0.0002286117,0.0008115939,0.0002287868,0.0002036885],"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.0001459705,0.005379008,0.00002317556,0.00006371966,0.00006061966,0.00002488199,0.001229178,0.4090156,0.07730369,0.002563481,0.0003631538,0.5038275],"study_design_scores_gemma":[0.0006280579,0.000534347,0.00009957854,0.0003311429,0.00001342141,0.00001107203,0.0001447354,0.9630525,0.03375278,0.00004770381,0.001040825,0.0003438982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008184424,0.00001746831,0.9872344,0.0006149078,0.001539018,0.0006661225,0.0001183148,0.000438996,0.001186402],"genre_scores_gemma":[0.9851284,0.000004044664,0.01363817,0.0005821388,0.0001032942,0.00009050081,0.00001489692,0.00002075937,0.0004177922],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.976944,"threshold_uncertainty_score":0.9999518,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01695558374234841,"score_gpt":0.2549822595759776,"score_spread":0.2380266758336292,"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."}}