{"id":"W1887036206","doi":"10.1007/978-3-642-31155-0_7","title":"On Minimum Sum of Radii and Diameters Clustering","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Euclidean geometry; Approximation algorithm; Metric (unit); Cluster analysis; Shortest path problem; Polynomial-time approximation scheme; Euclidean distance; Mathematics; Plane (geometry); Graph; Singleton; Path (computing); Polynomial; Discrete mathematics; Computer science; Mathematical analysis; Geometry","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.0006581701,0.0003571432,0.0004037615,0.0007242557,0.0001015486,0.0002931749,0.002196708,0.0001318731,0.00001052419],"category_scores_gemma":[0.00003966536,0.0003174143,0.0000695284,0.0003002824,0.0005117766,0.0007607497,0.002019553,0.0003371579,0.00001420328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007145236,"about_ca_system_score_gemma":0.00006155738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001057951,"about_ca_topic_score_gemma":0.00001355824,"domain_scores_codex":[0.9975891,0.00001943087,0.0003493815,0.0009273316,0.0006293808,0.0004853398],"domain_scores_gemma":[0.9981507,0.0003689951,0.0002242906,0.001069168,0.0000528366,0.0001340137],"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.000004004865,0.00002175487,0.00002818082,0.00006267401,0.00001171664,0.00002738194,0.0003722816,0.001428478,0.0000821241,0.01899132,0.0000362262,0.9789339],"study_design_scores_gemma":[0.0007157032,0.0005661026,0.000521299,0.000922464,0.00002720811,0.00004130472,3.986691e-7,0.8924145,0.001574351,0.09815098,0.003759884,0.001305807],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001809637,0.0004311891,0.9950364,0.0003120739,0.001464248,0.0002308562,0.000006601167,0.00005813653,0.002279547],"genre_scores_gemma":[0.2360374,0.0002352462,0.7607235,0.001749885,0.0005437948,0.000007732491,0.00001071175,0.00005204981,0.0006396585],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9776281,"threshold_uncertainty_score":0.9999278,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01856273433713109,"score_gpt":0.2325672587037544,"score_spread":0.2140045243666233,"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."}}