{"id":"W4405765923","doi":"10.4230/lipics.esa.2022.56","title":"Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Cluster analysis; Algorithm; Mathematics; Combinatorics; Computer science; Statistics","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.001138245,0.0008763144,0.00132329,0.0008774255,0.0005857344,0.0006620325,0.00410603,0.0003994485,0.00005322758],"category_scores_gemma":[0.0003084463,0.0007595661,0.0005493798,0.0006297855,0.0002829505,0.001480557,0.005703037,0.001171825,0.00001020565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006388776,"about_ca_system_score_gemma":0.0007585934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000044899,"about_ca_topic_score_gemma":0.00002626871,"domain_scores_codex":[0.9945722,0.00009399684,0.002036549,0.0008784428,0.001000251,0.001418512],"domain_scores_gemma":[0.9942011,0.000795919,0.001567099,0.002457453,0.000623672,0.0003547681],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.01618356,0.00627132,0.0008400991,0.09050906,0.009942262,0.0001105918,0.1430764,0.359467,0.006640101,0.003014026,0.02235442,0.3415911],"study_design_scores_gemma":[0.004350034,0.001228072,0.00002206096,0.0003565639,0.00006953604,0.00005907971,0.0008700626,0.9772381,0.001250756,0.0001924291,0.0133873,0.0009759967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009968891,0.00003944248,0.9780298,0.0004146807,0.001251167,0.006051362,0.003413019,0.0003596706,0.0004719706],"genre_scores_gemma":[0.02573463,0.00004354654,0.9650258,0.0002942971,0.0002461986,0.004194044,0.001521685,0.0002278379,0.002711951],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6177711,"threshold_uncertainty_score":0.9994856,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02628538007803845,"score_gpt":0.2950712382600269,"score_spread":0.2687858581819885,"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."}}