{"id":"W1589135268","doi":"10.1109/mwscas.1996.593165","title":"An algorithm for multiplication modulo (2⋀N-1)","year":2002,"lang":"en","type":"article","venue":"","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":53,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modulo; Multiplier (economics); Binary tree; Arithmetic; Multiplication algorithm; Computer science; Binary number; Algorithm; Multiplication (music); Tree (set theory); Mathematics; Parallel computing; Discrete mathematics; Combinatorics","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":[],"consensus_categories":[],"category_scores_codex":[0.00005817482,0.0001024352,0.00008312977,0.00006043911,0.00004432414,0.00002650769,0.0001287229,0.0000602839,0.0002352389],"category_scores_gemma":[0.000003289541,0.00009740958,0.00002864058,0.000101207,0.000009538115,0.0003195045,0.000004542888,0.00004815939,0.0002818794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003953729,"about_ca_system_score_gemma":0.000001417363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004832282,"about_ca_topic_score_gemma":0.00000263708,"domain_scores_codex":[0.9994543,0.000004031803,0.0001256684,0.0001378061,0.00007739371,0.0002007817],"domain_scores_gemma":[0.9995952,0.00001885107,0.000009939012,0.0002787433,0.00003169781,0.00006560526],"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.000001325311,0.0000717207,0.0000719961,0.00003120571,0.00002405184,5.697724e-7,0.0003633841,0.01961982,0.01864986,0.0003471763,0.0262886,0.9345303],"study_design_scores_gemma":[0.0002958496,0.00004172424,0.0002317967,0.000002393486,0.000004690275,0.000001540507,0.00001330594,0.9628139,0.02077418,0.00005070652,0.0156248,0.0001451678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01650888,0.0001015988,0.9777909,0.0000484429,0.0002604879,0.0003422621,0.00001081622,0.0009421549,0.003994437],"genre_scores_gemma":[0.7894851,0.0000476281,0.2090486,0.00007879132,0.0001973774,0.0001557084,0.00001953146,0.00004863398,0.0009186823],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.943194,"threshold_uncertainty_score":0.3972248,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01405893602722939,"score_gpt":0.2127371701820024,"score_spread":0.198678234154773,"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."}}