{"id":"W1497071043","doi":"10.1007/11496915_5","title":"Disjoint Cycles: Integrality Gap, Hardness, and Approximation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Combinatorics; Disjoint sets; Omega; Packing problems; Mathematics; Approximation algorithm; Vertex (graph theory); Conjecture; Upper and lower bounds; Binary logarithm; Undirected graph; Discrete mathematics; Graph; Physics","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.00101104,0.0005504988,0.0005552126,0.0006924575,0.0003551221,0.000857208,0.002469997,0.0002835124,0.00002450976],"category_scores_gemma":[0.00008096645,0.0004949107,0.0001405929,0.0005395854,0.001259003,0.0009888147,0.001778166,0.000906379,0.00002497086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002308858,"about_ca_system_score_gemma":0.0002642374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003798849,"about_ca_topic_score_gemma":0.0001124703,"domain_scores_codex":[0.9962634,0.0000452984,0.0005662385,0.001634345,0.0008987848,0.0005918972],"domain_scores_gemma":[0.9977673,0.000227089,0.0002773391,0.001341808,0.0001838323,0.0002026545],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002569313,0.00002918377,0.00004774362,0.00004412147,0.00000717897,0.00001784185,0.0006561877,0.0008485009,0.00001721606,0.1461802,0.00002323104,0.8521261],"study_design_scores_gemma":[0.0001824168,0.00007295675,0.000469587,0.0003162438,0.000006127757,0.00007760049,3.135641e-7,0.4793977,0.0002383012,0.5162538,0.002413357,0.0005715881],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001050714,0.0006154198,0.9921127,0.001536561,0.001623674,0.0003650326,0.00000870087,0.0002204016,0.003412444],"genre_scores_gemma":[0.08585408,0.0001946103,0.9110976,0.00158071,0.0007707688,0.00001675477,0.00001215622,0.00003698921,0.0004362579],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8515545,"threshold_uncertainty_score":0.9997503,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03006902252327674,"score_gpt":0.2571625246057706,"score_spread":0.2270935020824938,"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."}}