{"id":"W4367369757","doi":"10.1145/3558481.3591101","title":"A Simple and Efficient Parallel Laplacian Solver","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Binary logarithm; Combinatorics; Cholesky decomposition; Factorization; Simple (philosophy); Laplacian matrix; Mathematics; Laplace operator; Diagonal; Upper and lower bounds; Log-log plot; Discrete mathematics; Graph; Computer science; Eigenvalues and eigenvectors; Algorithm; Physics; Mathematical analysis; Mathematical optimization; Geometry","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":[],"consensus_categories":[],"category_scores_codex":[0.0003090954,0.0002465745,0.0002778187,0.0001912216,0.0001631054,0.0004206834,0.001142629,0.0001620341,0.00003605256],"category_scores_gemma":[0.00002496778,0.0002251249,0.0001282444,0.0002449821,0.00009119798,0.00005653021,0.00523694,0.0004226619,0.0001242919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002400186,"about_ca_system_score_gemma":0.00007738287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002481049,"about_ca_topic_score_gemma":0.0001165336,"domain_scores_codex":[0.9982178,0.00004459951,0.0002454332,0.0008151914,0.0003181112,0.0003588683],"domain_scores_gemma":[0.9986542,0.0001281125,0.00007959645,0.0009488165,0.0000507056,0.0001386023],"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.00001131722,0.0002653906,0.001134781,0.0003470063,0.0001966131,0.000193753,0.002563826,0.02997325,0.00001947642,0.8729901,0.03676728,0.05553719],"study_design_scores_gemma":[0.0001974456,0.00002679123,0.004457681,0.00004208375,0.000007605121,0.000007622937,0.00002939801,0.7653556,0.00002063769,0.2223482,0.007114016,0.0003928813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006776868,0.000169908,0.9847736,0.001688739,0.001240998,0.0003324777,0.00001994062,0.0009901786,0.004007335],"genre_scores_gemma":[0.4567361,0.0003116304,0.5319288,0.001971652,0.0005455382,0.0002150781,0.00007979655,0.00008488016,0.008126481],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7353824,"threshold_uncertainty_score":0.9180325,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0479539260316339,"score_gpt":0.2786057914216173,"score_spread":0.2306518653899834,"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."}}