{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009887805,0.0009278782,0.001193053,0.0006663212,0.001027899,0.002080064,0.003293404,0.001470349,0.004564157],"category_scores_gemma":[0.006238734,0.0005369447,0.001114995,0.001564872,0.001156574,0.00442382,0.00293111,0.002272141,0.001319977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00218244,"about_ca_system_score_gemma":0.001735319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002593686,"about_ca_topic_score_gemma":0.002791961,"domain_scores_codex":[0.9982755,0.0003083905,0.0000826577,0.000614878,0.0004855971,0.0002327943],"domain_scores_gemma":[0.997391,0.0008383081,0.0003096429,0.001003508,0.0002298244,0.0002277763],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001566741,0.0004503522,0.002344963,0.0005322309,0.0001366839,0.0002836376,0.0007603156,0.600798,0.05846702,0.1272728,0.01325517,0.1941321],"study_design_scores_gemma":[0.00006360574,0.0001425403,0.0003095342,0.00002006638,0.00002543105,0.0001280596,0.0001062916,0.9279469,0.01031383,0.05688426,0.004036953,0.00002248301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.08578171,0.0002180417,0.9052841,0.0007496001,0.00006273924,0.0002269304,0.0005594582,0.002659307,0.004458087],"genre_scores_gemma":[0.45026,0.0001978593,0.5422845,0.0002875524,0.00007894172,0.0002504458,0.001479388,0.0004809526,0.004680356],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.004564157,"threshold_uncertainty_score":0.01583475,"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."}}