{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008591478,0.00006632636,0.00006135453,0.00007526016,0.0001189785,0.00008915806,0.0004403973,0.00003824083,0.00003626713],"category_scores_gemma":[0.000005213798,0.00005515183,0.00005600856,0.0002316067,0.000020723,0.000363398,0.00002909094,0.00003388543,0.00004282194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005941102,"about_ca_system_score_gemma":0.000002988506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001441206,"about_ca_topic_score_gemma":0.000002686371,"domain_scores_codex":[0.9993648,0.00001555506,0.00009811234,0.000263784,0.00009471307,0.0001630249],"domain_scores_gemma":[0.9993528,0.00004230265,0.00002260462,0.0004556937,0.00005335547,0.00007323207],"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":[2.953241e-7,0.0001346662,0.00006218073,0.000002374981,0.000005165416,4.808078e-7,0.0002067657,0.0001070025,0.0003512619,0.03024,0.001150906,0.9677389],"study_design_scores_gemma":[0.0002422551,0.00008092325,0.0008667146,0.000001375375,0.000002113663,0.000003903044,0.00001121261,0.9874029,0.001924302,0.004688806,0.004679584,0.00009594559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001576747,0.00008006336,0.9962901,0.0005504353,0.00007446371,0.0001932936,0.000002200087,0.0002159841,0.001016739],"genre_scores_gemma":[0.2395089,0.00001367597,0.7598389,0.0002264108,0.00005947574,0.0000477404,0.000002589248,0.000004745624,0.0002975803],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9872959,"threshold_uncertainty_score":0.2249026,"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."}}