{"id":"W1998438348","doi":"10.1049/el:20010378","title":"Fault tolerant computation of large inner products","year":2001,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Computation; Fault tolerance; Redundancy (engineering); Computer science; Overhead (engineering); Replication (statistics); Product (mathematics); Parallel computing; Distributed computing; Algorithm; Mathematics","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.0002083995,0.0001010449,0.0001267803,0.0001441627,0.00007816929,0.0000374323,0.0003587112,0.00003285582,0.000002798936],"category_scores_gemma":[0.00001284052,0.00009109838,0.00005796944,0.0007985904,0.00003250539,0.0001943447,0.00005892429,0.0001532284,0.000009513268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002728813,"about_ca_system_score_gemma":0.00004880515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009109636,"about_ca_topic_score_gemma":0.00001030415,"domain_scores_codex":[0.9988919,0.00005125274,0.0001847735,0.000266296,0.0002275035,0.0003782662],"domain_scores_gemma":[0.9995103,0.00002597514,0.00008319184,0.0002791615,0.00006733101,0.00003399837],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009755217,0.001226158,0.006390718,0.0002022527,0.0003306096,0.0001890185,0.005749546,0.0189494,0.5515267,0.2854196,0.02428196,0.1056364],"study_design_scores_gemma":[0.007802938,0.001712676,0.04965041,0.0002745935,0.0001319279,0.0006090705,0.0001421095,0.3645612,0.3114845,0.02592076,0.2349049,0.002804941],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5582114,0.0007932553,0.4297074,0.0108011,0.0001592469,0.0001227696,5.845556e-7,0.00007546856,0.0001287334],"genre_scores_gemma":[0.9904311,0.00005225368,0.007854708,0.001579832,0.00005066923,0.000004934801,0.000003849482,0.000007143078,0.00001546475],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4322197,"threshold_uncertainty_score":0.3714884,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006317953481910144,"score_gpt":0.2260834932446848,"score_spread":0.2197655397627746,"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."}}