{"id":"W2416076575","doi":"10.1109/acssc.1995.540841","title":"An algorithm for multiplication module (2/sup n/+1)","year":2002,"lang":"en","type":"article","venue":"","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplication algorithm; Multiplication (music); Modular arithmetic; Binary operation; Binary number; Binary tree; Very-large-scale integration; Modulo; Arithmetic; Computer science; Modular design; Reduction (mathematics); Algorithm; Parallel computing; Mathematics; Discrete mathematics; Combinatorics; Cryptography","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004269158,0.0006673422,0.000390871,0.0009520348,0.0005914281,0.0005799289,0.0007659594,0.0003896278,0.009171334],"category_scores_gemma":[0.0008327913,0.0002436242,0.0005258301,0.0005942847,0.0004126734,0.001062321,0.0007530414,0.0006866277,0.005215997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003308535,"about_ca_system_score_gemma":0.0007091941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002623479,"about_ca_topic_score_gemma":0.0004808992,"domain_scores_codex":[0.9996495,0.00006175305,0.00003975094,0.00008512149,0.0001240037,0.00003970919],"domain_scores_gemma":[0.9996837,0.00006720268,0.00003543187,0.0000697461,0.0001236541,0.00002028859],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000162537,0.0001012421,0.0007101296,0.0003344688,0.00005660364,0.0001984559,0.000199064,0.005152307,0.05700415,0.07867368,0.01296904,0.8444383],"study_design_scores_gemma":[0.0002633228,0.001195749,0.002430548,0.0001975476,0.0002258029,0.005429123,0.0001445609,0.1665137,0.2027648,0.1455568,0.4750711,0.0002069014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009279252,0.00038462,0.9759567,0.0001857704,0.0002974151,0.0002375607,0.0001045576,0.002069299,0.01148474],"genre_scores_gemma":[0.05926486,0.0003536097,0.9302521,0.0001145537,0.0001529509,0.0001872609,0.0003496108,0.0002381938,0.009086798],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009171334,"threshold_uncertainty_score":0.03068119,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01815538533416858,"score_gpt":0.2447307545298201,"score_spread":0.2265753691956515,"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."}}