{"id":"W2077741232","doi":"10.1145/2755996.2756672","title":"A Relaxed Algorithm for Online Matrix Inversion","year":2015,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Invertible matrix; Algorithm; Dimension (graph theory); Matrix (chemical analysis); Iterative method; Computation; Rank (graph theory); Computer science; Multiplication (music); Matrix multiplication; Inversion (geology); Row; Field (mathematics); Row and column spaces; Mathematics; Combinatorics; Pure 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.00039791,0.00008964699,0.0001086893,0.00006501118,0.00005868786,0.0000609199,0.0005357271,0.00005081356,0.00001733539],"category_scores_gemma":[0.00004646869,0.00007187216,0.00005935561,0.0002150973,0.00001865712,0.0003443624,0.0001842596,0.00005979657,0.00010684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002803741,"about_ca_system_score_gemma":0.00006554092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001241339,"about_ca_topic_score_gemma":0.000001744818,"domain_scores_codex":[0.9992305,0.00003544787,0.0001386723,0.0002370179,0.0001636892,0.0001946935],"domain_scores_gemma":[0.9992887,0.00007518109,0.00004159599,0.000326687,0.0001042103,0.000163595],"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":[0.00001262979,0.0001534669,0.000008366319,0.00001004304,0.00001322958,0.00001205357,0.0002866171,0.00003810525,0.00008864564,0.2235351,0.03590121,0.7399405],"study_design_scores_gemma":[0.0009228688,0.0001742357,0.000005378969,0.00000566496,0.000003990392,0.00001346734,0.00007309821,0.8428935,0.001077134,0.05592351,0.09876128,0.0001458568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009660145,0.00006749942,0.9953082,0.001143446,0.0005220913,0.0001727859,0.00000946452,0.0002480521,0.001562432],"genre_scores_gemma":[0.0019692,0.000003905996,0.986762,0.0004652725,0.0001828736,0.00000891788,0.00001136706,0.000006797863,0.01058967],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8428554,"threshold_uncertainty_score":0.2930861,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03083502350588944,"score_gpt":0.2867325653930303,"score_spread":0.2558975418871408,"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."}}