{"id":"W2060363698","doi":"10.1145/1290672.1290685","title":"Approximation algorithms and hardness results for cycle packing problems","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Approximation algorithm; Combinatorics; Disjoint sets; Mathematics; Upper and lower bounds; Packing problems; Undirected graph; Binary logarithm; Log-log plot; Discrete mathematics; Graph; Algorithm","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.001316249,0.0003098816,0.0002877707,0.0003981741,0.0007552701,0.0002952195,0.0009178074,0.0001658746,0.000005417784],"category_scores_gemma":[0.00008346747,0.0003102758,0.0001635946,0.0007938261,0.0001368287,0.0008086751,0.00004149706,0.0003338484,0.00001339886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007730688,"about_ca_system_score_gemma":0.00004510627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006241995,"about_ca_topic_score_gemma":0.00005176052,"domain_scores_codex":[0.9974738,0.00004977693,0.0005738949,0.0008388397,0.0004409746,0.0006227055],"domain_scores_gemma":[0.9978585,0.0005454886,0.0001631616,0.00102226,0.0001929747,0.0002176626],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004532666,0.0002423927,0.000004352084,0.00004769152,0.00004842033,0.000006179594,0.001203396,0.0006203487,0.000187122,0.003169294,0.00007039793,0.9943551],"study_design_scores_gemma":[0.005206062,0.0009456826,0.001712646,0.0002126173,0.00006878476,0.0001683318,0.000482281,0.8287604,0.01516481,0.127676,0.01835316,0.001249263],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001134635,0.0001120168,0.9942755,0.00153194,0.001220518,0.0007794464,0.00008857498,0.000444863,0.0004125472],"genre_scores_gemma":[0.09082012,0.00008712043,0.9080113,0.000306431,0.000209454,0.0001605436,0.00002515347,0.00003768861,0.0003422432],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9931058,"threshold_uncertainty_score":0.9999349,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04104861257864342,"score_gpt":0.285998406091064,"score_spread":0.2449497935124205,"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."}}