{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006687899,0.0004598956,0.0005840364,0.0002907705,0.0003984307,0.0004162742,0.002435246,0.0004947116,0.00001605643],"category_scores_gemma":[0.00005329048,0.0005256835,0.0003569241,0.000408731,0.00009056064,0.000587013,0.001834182,0.0006737948,0.0001299256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002049914,"about_ca_system_score_gemma":0.0002419288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001811409,"about_ca_topic_score_gemma":0.000003262928,"domain_scores_codex":[0.9973982,0.0001648899,0.0003516434,0.001314932,0.0001430267,0.0006273075],"domain_scores_gemma":[0.9973743,0.000324471,0.0004138061,0.001256619,0.0003610376,0.0002697556],"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.00001814272,0.0001192409,0.00003729144,0.0002646591,0.0001667795,0.0001449747,0.0002764342,0.05211317,0.00001547745,0.9431782,0.000452959,0.003212618],"study_design_scores_gemma":[0.0008257923,0.00007309546,0.00000320039,0.0001640685,0.00005884239,0.000006454009,0.00008869229,0.8917903,0.0001137388,0.1038292,0.002492469,0.0005541573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01415527,0.0001313252,0.9749457,0.00003369674,0.008187696,0.0009986069,0.00005375766,0.000468239,0.001025742],"genre_scores_gemma":[0.9660885,0.0001010361,0.02826637,0.00006488447,0.001754762,0.00001832895,0.00005076164,0.00006333639,0.00359205],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9519332,"threshold_uncertainty_score":0.9997195,"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."}}