{"id":"W4400668514","doi":"10.4230/lipics.mfcs.2024.45","title":"Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs","year":2024,"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 Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Bipartite graph; Combinatorics; Bounded function; Treewidth; Physics; Graph; Mathematics; Discrete mathematics; Line graph; Mathematical analysis; Pathwidth","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.002873033,0.003191733,0.002290713,0.001421717,0.001272593,0.003714525,0.003266611,0.002484733,0.01611724],"category_scores_gemma":[0.02454874,0.001486949,0.001946353,0.002220284,0.003089258,0.0125447,0.004519335,0.006690924,0.003775941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002298651,"about_ca_system_score_gemma":0.001637802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001793112,"about_ca_topic_score_gemma":0.003123083,"domain_scores_codex":[0.9959624,0.0007070419,0.0001922822,0.0008604421,0.00147205,0.0008056373],"domain_scores_gemma":[0.9754868,0.01677277,0.001186359,0.004036797,0.001485306,0.001031916],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002210778,0.0007582745,0.004255477,0.001555523,0.0002721482,0.0007592017,0.001036944,0.5298034,0.03348868,0.2592561,0.02913494,0.1374686],"study_design_scores_gemma":[0.0001345641,0.0002861577,0.0009759694,0.000146358,0.00008606026,0.0004764367,0.0002348151,0.6656378,0.01113839,0.3123296,0.008492812,0.00006107768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1937764,0.003042928,0.7415923,0.004103558,0.0004712348,0.0005077799,0.004293959,0.004208847,0.04800303],"genre_scores_gemma":[0.6974873,0.002541391,0.275035,0.00260208,0.0007139466,0.0007868623,0.006114698,0.001885282,0.01283344],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01611724,"threshold_uncertainty_score":0.05391753,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08587823683852365,"score_gpt":0.2066837199835536,"score_spread":0.1208054831450299,"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."}}