{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004929196,0.0004560707,0.0005033113,0.0009119602,0.0002173706,0.0004652802,0.002433374,0.0003824388,0.00002568186],"category_scores_gemma":[0.00003386799,0.0005430847,0.0005668179,0.001644499,0.0002447048,0.0003579415,0.002677423,0.001024461,0.00009030406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002352078,"about_ca_system_score_gemma":0.00032008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002550566,"about_ca_topic_score_gemma":0.0004383176,"domain_scores_codex":[0.9970033,0.0001173591,0.0003370428,0.001715553,0.0001457006,0.0006810108],"domain_scores_gemma":[0.9978701,0.000200087,0.0001555167,0.001425678,0.00012358,0.0002250492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004537791,0.0001999442,0.0007344113,0.000293353,0.000144725,0.0004671391,0.0007829508,0.04104295,0.00001055755,0.9502659,0.002027645,0.003985056],"study_design_scores_gemma":[0.0003074235,0.00006313215,0.0002091252,0.0001389765,0.00003499424,0.000003026039,0.00003225946,0.5187914,0.00003177849,0.477253,0.002762003,0.000372913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1964463,0.0006712074,0.7912255,0.000763631,0.005215688,0.001081343,0.000149598,0.0007644297,0.003682236],"genre_scores_gemma":[0.9841949,0.0001963332,0.01322937,0.0001495888,0.0001312509,0.000009779537,0.00003464756,0.00003597072,0.002018134],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7877486,"threshold_uncertainty_score":0.9997021,"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."}}