{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00420379,0.001376443,0.001277416,0.0008569779,0.002207246,0.00307558,0.002464547,0.0027974,0.008839489],"category_scores_gemma":[0.02291707,0.0006663514,0.001764914,0.002314717,0.002993885,0.006357112,0.002122893,0.008700092,0.002289354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001877467,"about_ca_system_score_gemma":0.002005885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003123092,"about_ca_topic_score_gemma":0.003003194,"domain_scores_codex":[0.9961175,0.001330483,0.000129908,0.0007032044,0.001304027,0.0004148989],"domain_scores_gemma":[0.9907839,0.006390301,0.0003886477,0.001476273,0.0007660862,0.0001946873],"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.0004121868,0.0001597682,0.0006106891,0.0002496632,0.00006649193,0.0002970547,0.0003361127,0.05432422,0.001969481,0.7837244,0.05861859,0.09923131],"study_design_scores_gemma":[0.000128117,0.0001250125,0.0003486924,0.00009648889,0.00004364036,0.0005678817,0.0001234146,0.2309464,0.002888484,0.7224922,0.04218019,0.00005961699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009652331,0.001141664,0.9466547,0.007491893,0.0004604362,0.0001734619,0.0003530782,0.0008262944,0.03324616],"genre_scores_gemma":[0.2152386,0.001419913,0.760744,0.004290394,0.0005165151,0.0006360282,0.0005893457,0.0005322589,0.01603292],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008839489,"threshold_uncertainty_score":0.02957106,"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."}}