{"id":"W2745045892","doi":"10.1109/isit.2017.8006963","title":"High-dimensional coded matrix multiplication","year":2017,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":242,"is_retracted":false,"has_abstract":true,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Matrix multiplication; Computer science; Decoding methods; Computation; Backup; Redundancy (engineering); Low-density parity-check code; Multiplication (music); Algorithm; Theoretical computer science; Parallel computing; Mathematics; Combinatorics","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.0002258088,0.00007833014,0.00008279926,0.00004489712,0.0003614422,0.0002263205,0.001308026,0.00004614322,0.00001552961],"category_scores_gemma":[0.0001270314,0.00006889219,0.00003262922,0.00003994673,0.00003310187,0.0004948427,0.0004769717,0.00008007541,0.0001746409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002759358,"about_ca_system_score_gemma":0.00002540833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003777865,"about_ca_topic_score_gemma":0.00003650876,"domain_scores_codex":[0.9992636,0.00001856025,0.0001189702,0.0002806408,0.000178448,0.000139718],"domain_scores_gemma":[0.9982814,0.00004885801,0.0001290472,0.00139984,0.00009355656,0.00004727429],"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.0000122251,0.0001565196,0.006371493,0.00001190622,0.00001904917,0.00001834871,0.000255148,0.0001154544,0.0723399,0.7408384,0.03734592,0.1425156],"study_design_scores_gemma":[0.0007288125,0.0001236661,0.07987787,0.00004447899,0.000007513403,0.00005316515,0.000005521297,0.5065504,0.3573582,0.05118059,0.003448373,0.000621479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07137717,0.00001008312,0.9185904,0.003531509,0.0005126455,0.0001569524,6.343146e-7,0.00135192,0.004468646],"genre_scores_gemma":[0.6245507,7.058316e-7,0.3737667,0.0001097663,0.00002766927,0.00001010485,6.771866e-7,0.00000386587,0.001529773],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6896578,"threshold_uncertainty_score":0.2809342,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0221721166084263,"score_gpt":0.309881385354015,"score_spread":0.2877092687455887,"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."}}