{"id":"W2156300926","doi":"10.1007/s00453-011-9503-8","title":"A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Polynomial-time approximation scheme; Approximation algorithm; Vertex (graph theory); Clique graph; Unit disk graph; Clique; Upper and lower bounds; Adjacency matrix; Discrete mathematics; Unit disk; Graph; Line graph; Computer science; Graph power","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.0004244748,0.0002242775,0.0002582429,0.000310085,0.0001656893,0.00008514443,0.0009977303,0.0001230263,0.00004679829],"category_scores_gemma":[0.0000487065,0.0002273564,0.0001706313,0.0008272419,0.0001267744,0.0005376314,0.0002165226,0.0002210467,0.00003807191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002974271,"about_ca_system_score_gemma":0.00006862263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002000139,"about_ca_topic_score_gemma":0.0001775592,"domain_scores_codex":[0.998183,0.00009285763,0.0004003694,0.0005743761,0.0002089688,0.0005404197],"domain_scores_gemma":[0.9988402,0.0001628282,0.0001110243,0.0006398171,0.0001047687,0.0001413192],"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.00007210486,0.0008942088,0.00148523,0.00006440827,0.00007367969,0.00007703573,0.00316411,0.00005463711,0.0003013097,0.8151925,0.00237837,0.1762424],"study_design_scores_gemma":[0.001657151,0.0006516122,0.0162879,0.0001112972,0.00002760356,0.00004760746,0.0002003946,0.2364822,0.005009779,0.7262727,0.01236034,0.000891386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02352218,0.0001527828,0.9698039,0.0007789956,0.0009939072,0.0007407198,0.00004939874,0.0003267822,0.003631307],"genre_scores_gemma":[0.4380871,0.00005292019,0.560497,0.000550287,0.0001619304,0.000339157,0.0000339782,0.00003303489,0.0002445711],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4145649,"threshold_uncertainty_score":0.9271327,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08879720214434278,"score_gpt":0.262803065569681,"score_spread":0.1740058634253382,"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."}}