{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003063649,0.0004019709,0.0004289288,0.000587545,0.0003286048,0.0002250623,0.002788784,0.0003343669,0.00002242131],"category_scores_gemma":[0.00005023924,0.000490499,0.0005364837,0.001195114,0.000187553,0.0003021195,0.002201678,0.0005470758,0.0000940533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001089549,"about_ca_system_score_gemma":0.0001329548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001564799,"about_ca_topic_score_gemma":0.0001021686,"domain_scores_codex":[0.9974084,0.0001108781,0.0002448671,0.001525178,0.000118702,0.0005919281],"domain_scores_gemma":[0.997562,0.0002641418,0.0002222582,0.001550342,0.0001862252,0.0002150256],"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.00006490592,0.0001754676,0.002198081,0.0002576439,0.0005134345,0.0004480146,0.0005021329,0.02328717,0.00004673028,0.9519563,0.0152466,0.005303499],"study_design_scores_gemma":[0.0004741255,0.00005011841,0.002186601,0.00008263572,0.00005814115,0.000002123887,0.00002985758,0.4055259,0.00007689627,0.5870743,0.00386343,0.0005757948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07015739,0.000039225,0.9211619,0.0007700956,0.003727916,0.0007625913,0.0001424892,0.002103024,0.001135378],"genre_scores_gemma":[0.9614976,0.0001612402,0.03338375,0.0004129455,0.0002492794,0.0000124267,0.0001245225,0.00006815064,0.004090075],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8913403,"threshold_uncertainty_score":0.9997547,"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."}}