{"id":"W2963142939","doi":"","title":"Tight Approximation Results for General Covering Integer Programs","year":2002,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Rounding; Combinatorics; Linear programming relaxation; Multiplicative function; Mathematics; Approximation algorithm; Integer (computer science); Upper and lower bounds; Discrete mathematics; Multiplicity (mathematics); Binary logarithm; Cover (algebra); Linear programming; Algorithm; Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.0001430385,0.0001200186,0.0001130281,0.0001135071,0.0001927968,0.0001018234,0.0006474954,0.00005643262,0.00001025098],"category_scores_gemma":[0.0000202992,0.0001304209,0.000108313,0.0005779739,0.00006201726,0.0006059055,0.0001705595,0.0000953351,0.00004035019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005588314,"about_ca_system_score_gemma":0.000009876317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000019255,"about_ca_topic_score_gemma":0.00001273227,"domain_scores_codex":[0.9990485,0.00003154023,0.0001300946,0.0004694401,0.00005903942,0.0002614162],"domain_scores_gemma":[0.9992799,0.00005701983,0.00008080446,0.0004342194,0.00006627234,0.00008177432],"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.00002944209,0.0001671553,0.0002317693,0.00002224064,0.00002910097,0.00003158304,0.0005208181,0.005868623,0.00004342227,0.9715779,0.0009855976,0.02049231],"study_design_scores_gemma":[0.0007487041,0.00009854774,0.0001882294,0.00001515938,0.000007740762,0.000003532158,0.00001601803,0.9477503,0.0002062274,0.04244717,0.008336001,0.0001823538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05783258,0.00001715835,0.936694,0.0001684578,0.0002538793,0.0002503636,0.000005856436,0.0002185289,0.004559193],"genre_scores_gemma":[0.9693697,0.00001497888,0.02817348,0.00007136381,0.00007607933,0.000001873753,0.000009315317,0.000006400507,0.002276774],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9418817,"threshold_uncertainty_score":0.5318411,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1159366505249522,"score_gpt":0.1844646451953971,"score_spread":0.06852799467044489,"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."}}