{"id":"W2951744002","doi":"10.4230/lipics.itcs.2023.69","title":"A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; European Commission; Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Microsoft Research; National Science Foundation","keywords":"Solver; Inverse; Diagonally dominant matrix; Linear system; System of linear equations; Matrix (chemical analysis); Sequence (biology); Mathematics; Moore–Penrose pseudoinverse; Product (mathematics); Algorithm; Combinatorics; Sparse matrix; Graph; Inverse problem; Applied mathematics; Mathematical optimization; Mathematical analysis; Physics; Pure mathematics; Geometry; Invertible matrix","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007665021,0.001463357,0.001331929,0.001266976,0.000885756,0.001461324,0.002380011,0.002101775,0.01309534],"category_scores_gemma":[0.005324762,0.0006785486,0.0009150774,0.001338191,0.0008973586,0.002148258,0.001990717,0.002526466,0.002429559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001117635,"about_ca_system_score_gemma":0.001707079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004518638,"about_ca_topic_score_gemma":0.006436657,"domain_scores_codex":[0.9993,0.0001348738,0.00004143316,0.0002009987,0.0002036349,0.0001190653],"domain_scores_gemma":[0.9986091,0.0008055119,0.00008875377,0.0001766497,0.0002101889,0.0001096713],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004264146,0.0005273047,0.001408642,0.0003953578,0.00008274183,0.0001987969,0.0002978356,0.4446547,0.006583808,0.06609478,0.02499592,0.4543337],"study_design_scores_gemma":[0.00009276657,0.00006825796,0.00006756272,0.0000110581,0.000008318901,0.00004296006,0.00003549494,0.9664338,0.0007197314,0.03101019,0.001499498,0.00001024388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02474129,0.0003396675,0.9626494,0.0005348982,0.0001214575,0.0002400829,0.0001812386,0.003555853,0.007636105],"genre_scores_gemma":[0.225568,0.0001270212,0.765434,0.000553623,0.00010253,0.0005078078,0.0009563103,0.0005858938,0.006164765],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01309534,"threshold_uncertainty_score":0.04380828,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04530350033200764,"score_gpt":0.1939445373919164,"score_spread":0.1486410370599088,"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."}}