{"id":"W4417091733","doi":"10.48550/arxiv.2504.13105","title":"A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rounding; Cover (algebra); Covering problems; Approximation algorithm; Set cover problem; Relaxation (psychology); Linear programming relaxation; Polyhedron; Iterative method; Set packing","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.001110228,0.0004418624,0.000471703,0.0001628549,0.0007661451,0.0006298338,0.00275389,0.0002250601,0.00001501947],"category_scores_gemma":[0.0001830336,0.0003343673,0.000496901,0.0003377172,0.0001480541,0.0002353008,0.002290904,0.0005603777,0.00001167528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001237026,"about_ca_system_score_gemma":0.0003255772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001666428,"about_ca_topic_score_gemma":0.00007809766,"domain_scores_codex":[0.997466,0.0001317826,0.0004631836,0.001121156,0.0002246851,0.0005931397],"domain_scores_gemma":[0.9952774,0.002595885,0.0003036816,0.001413329,0.0003292555,0.00008047424],"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.00008501067,0.0001981003,0.004376946,0.0006768777,0.0005840677,0.000006151335,0.007860431,0.002606275,0.00006384796,0.9404436,0.005539149,0.03755958],"study_design_scores_gemma":[0.001183469,0.0002313994,0.003271552,0.0007313106,0.0001444173,0.000007930672,0.0001475202,0.2551189,0.0009823119,0.5671178,0.1701172,0.0009461501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007516138,0.0004493278,0.9826778,0.002168393,0.001904301,0.002978201,0.0001831492,0.0002223984,0.001900328],"genre_scores_gemma":[0.3576664,0.0002054523,0.6089633,0.004361266,0.001949199,0.007275441,0.0002364115,0.0001040283,0.01923855],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3737145,"threshold_uncertainty_score":0.9999108,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1004276621438142,"score_gpt":0.3023558924078041,"score_spread":0.2019282302639899,"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."}}