{"id":"W4388651119","doi":"10.4230/lipics.icalp.2024.119","title":"Better Sparsifiers for Directed Eulerian Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley","keywords":"Eulerian path; Combinatorics; Omega; Conjecture; Mathematics; Binary logarithm; Laplace operator; Laplacian matrix; Discrete mathematics; Graph; Physics; Mathematical analysis","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.0006604166,0.001080221,0.0007622223,0.0007740049,0.0005090444,0.0009074438,0.0008208471,0.0007266402,0.008933859],"category_scores_gemma":[0.00433091,0.0006097874,0.0006454213,0.000923214,0.001387982,0.003343239,0.0021827,0.003089996,0.00220504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006181431,"about_ca_system_score_gemma":0.0005925227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009085633,"about_ca_topic_score_gemma":0.002395549,"domain_scores_codex":[0.9993225,0.0001434905,0.00004161634,0.000170674,0.00022189,0.00009983154],"domain_scores_gemma":[0.9975408,0.001069113,0.0001801272,0.0007788925,0.0002354243,0.0001955531],"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.0005511827,0.0002375479,0.002537113,0.0003774706,0.00006564084,0.0005236672,0.0008536407,0.1812726,0.04153496,0.5745612,0.02067058,0.1768143],"study_design_scores_gemma":[0.00007499004,0.0001762524,0.0007376589,0.00009419216,0.00003033457,0.0004307809,0.0003745312,0.5008724,0.02224296,0.4485727,0.02634308,0.00004994585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1120955,0.000536831,0.8649065,0.0009089985,0.0001295085,0.000149506,0.0009015796,0.001276109,0.01909542],"genre_scores_gemma":[0.5340973,0.0009082168,0.4452596,0.0009136224,0.0002316906,0.0003188091,0.003155489,0.0006183651,0.01449694],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008933859,"threshold_uncertainty_score":0.02988678,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1469199772197672,"score_gpt":0.2070320141457941,"score_spread":0.06011203692602685,"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."}}