{"id":"W6891703795","doi":"10.48550/arxiv.0904.2203","title":"A Weakly-Robust PTAS for Minimum Clique Partition in Unit Disk Graphs","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Clique graph; Partition (number theory); Vertex (graph theory); Polynomial-time approximation scheme; Approximation algorithm; Independent set; Clique; Graph; Unit disk graph","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.0004487353,0.0003904187,0.0004403038,0.0006732006,0.0002019531,0.0001643006,0.001980465,0.0003736547,0.00001732472],"category_scores_gemma":[0.00004216514,0.000482325,0.0003935802,0.001188324,0.0001543036,0.0004519896,0.0009998812,0.0006791265,0.00001991775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001368867,"about_ca_system_score_gemma":0.0001903586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001682973,"about_ca_topic_score_gemma":0.000513737,"domain_scores_codex":[0.9975201,0.0001975843,0.0003317334,0.001291861,0.0001091598,0.0005495631],"domain_scores_gemma":[0.9979986,0.000202854,0.0002554068,0.001203843,0.0001595273,0.0001797846],"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.00006155112,0.000314156,0.001553801,0.0001051111,0.00005034147,0.000185833,0.0002315594,0.0799214,0.00001633416,0.9144873,0.0004807311,0.002591879],"study_design_scores_gemma":[0.0005883025,0.0001144454,0.003332541,0.0001630117,0.00003269971,0.000003514391,0.00004618699,0.3850985,0.00005521457,0.6089798,0.001113658,0.0004720721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1933873,0.00008830721,0.8026014,0.0003865379,0.0007269132,0.0007908996,0.00006627367,0.0002951447,0.00165719],"genre_scores_gemma":[0.9839826,0.0002909737,0.01490332,0.0002078441,0.00008117159,0.000007990778,0.00006716428,0.00001808994,0.0004408451],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7905952,"threshold_uncertainty_score":0.9997628,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1346992862128803,"score_gpt":0.2149697447596503,"score_spread":0.08027045854677001,"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."}}