{"id":"W1829320485","doi":"10.1109/sips.2001.957334","title":"Efficient fault-tolerant arithmetic using a symmetrical modulus replication RNS","year":2002,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Replication (statistics); Fault tolerance; Computer science; Modulus; Sample (material); Parallel computing; Arithmetic; Mathematics; Distributed computing; Physics; Statistics","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.0003462129,0.000109729,0.0001204751,0.0002839825,0.0001688096,0.0001321022,0.0005481598,0.00004718181,0.00006272938],"category_scores_gemma":[0.00006687173,0.00009437706,0.0001001611,0.001562001,0.00003918316,0.00008067527,0.0001529524,0.0001014602,0.00008338311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003724736,"about_ca_system_score_gemma":0.0000070397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001598351,"about_ca_topic_score_gemma":5.223382e-7,"domain_scores_codex":[0.9987227,0.00007153313,0.0002014318,0.0004908164,0.0002591899,0.0002543671],"domain_scores_gemma":[0.9987292,0.00007925161,0.00005469341,0.0009772273,0.00005936979,0.0001002843],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006440137,0.0005976185,0.0002299414,0.0000128236,0.0000250905,0.00001836242,0.000958815,0.01424154,0.002376497,0.7415477,0.0004652101,0.23952],"study_design_scores_gemma":[0.0001596731,0.00004875024,0.0003256988,0.000008826705,0.000006546245,0.00003624874,0.00001173757,0.9936438,0.0007296216,0.004159865,0.0007291593,0.0001400419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1620637,0.0001347259,0.8318696,0.0004566398,0.0001822114,0.0001093524,4.514651e-7,0.0002560068,0.0049273],"genre_scores_gemma":[0.9453828,0.000003336583,0.05413908,0.0002773604,0.0000337025,0.000006925472,2.451315e-7,0.000005617532,0.0001508943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9794023,"threshold_uncertainty_score":0.3848585,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04159961231547944,"score_gpt":0.2531100075227521,"score_spread":0.2115103952072727,"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."}}