{"id":"W4406141864","doi":"10.1137/1.9781611978322.50","title":"Eulerian Graph Sparsification by Effective Resistance Decomposition","year":2025,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Eulerian path; Decomposition; Graph; Resistance (ecology); Computer science; Mathematics; Chemistry; Theoretical computer science; Biology; Pure mathematics; Ecology; Lagrangian; Organic chemistry","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003335397,0.0008974115,0.0006090141,0.0006227544,0.0003537509,0.0007236417,0.000995468,0.000555191,0.008223617],"category_scores_gemma":[0.00191267,0.0004301668,0.0006505639,0.0006710092,0.0007515451,0.001788253,0.001841799,0.001414576,0.003026576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004466801,"about_ca_system_score_gemma":0.0005221374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007702355,"about_ca_topic_score_gemma":0.001677513,"domain_scores_codex":[0.9995884,0.00006919127,0.00001920016,0.00009288371,0.0001738171,0.00005652108],"domain_scores_gemma":[0.9992927,0.000209472,0.00004981644,0.0003218356,0.00009005927,0.00003614389],"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.0003488648,0.0001213306,0.001093704,0.0003228602,0.0000735914,0.0003534018,0.0003200566,0.2981528,0.04181134,0.2102986,0.02567346,0.42143],"study_design_scores_gemma":[0.00003592332,0.00004594422,0.0002064301,0.00002900278,0.00001910876,0.0002257084,0.00006374849,0.8256359,0.01550779,0.1425173,0.01569667,0.00001639587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02365711,0.000192715,0.9602427,0.0002743651,0.00006106933,0.00006722356,0.0002440973,0.001750381,0.01351042],"genre_scores_gemma":[0.3056357,0.0003754631,0.6736218,0.0002726555,0.00009283726,0.0001706552,0.001408231,0.0006649501,0.01775758],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008223617,"threshold_uncertainty_score":0.02751076,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01978659311778073,"score_gpt":0.2323271620927924,"score_spread":0.2125405689750117,"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."}}