{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004869143,0.0003806048,0.0004750249,0.0000618362,0.0004150399,0.0001835824,0.0004359554,0.0006305223,0.000002903559],"category_scores_gemma":[0.000008984136,0.0003704514,0.0004036402,0.00004293525,0.0001779889,0.00005377133,0.0001338008,0.0003960102,0.000003131735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005237356,"about_ca_system_score_gemma":0.00005995428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.306257e-7,"about_ca_topic_score_gemma":6.962154e-7,"domain_scores_codex":[0.9985504,0.000009037905,0.0004095286,0.0005674884,0.0002140429,0.0002494812],"domain_scores_gemma":[0.9986557,0.0003777101,0.0003799654,0.0004275754,0.00007117021,0.00008790186],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000197338,0.00002160649,1.444481e-8,0.0001910773,0.0001694332,1.7247e-7,0.0005348067,4.118158e-7,0.0005894405,0.9567965,0.01433281,0.02734395],"study_design_scores_gemma":[0.0009662465,0.00005310771,7.358523e-8,0.0003354113,0.0001459688,0.000001177746,0.0000561445,0.0002427422,0.003179159,0.9442611,0.05035074,0.000408128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.00007007083,0.0002198365,0.5625627,0.0001945377,0.0004459205,0.003237592,0.0003130154,0.0002421698,0.4327142],"genre_scores_gemma":[0.003320417,0.000134147,0.3481247,0.0007249758,0.001072085,0.00173266,0.000533928,0.0001664615,0.6441905],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.2144379,"threshold_uncertainty_score":0.9998748,"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."}}