{"id":"W4402200311","doi":"10.1137/23m1556800","title":"Generalizing Lloyd’s Algorithm for Graph Clustering","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Nuclear Security Administration","keywords":"Mathematics; Cluster analysis; Algorithm; Graph; Combinatorics; Statistics","routes":{"ca_aff":true,"ca_fund":true,"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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004076649,0.0002312856,0.0002312975,0.0008210842,0.001532917,0.00519876,0.001250163,0.00006067655,0.000011559],"category_scores_gemma":[0.00004883886,0.0002055717,0.0003829998,0.001403044,0.0001074118,0.0007317859,0.0003058434,0.0004770481,0.00005989679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007621861,"about_ca_system_score_gemma":0.0001226096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.465186e-7,"about_ca_topic_score_gemma":6.486839e-7,"domain_scores_codex":[0.9973046,0.0001320877,0.0005190094,0.0007661806,0.0005833905,0.0006947966],"domain_scores_gemma":[0.9986251,0.0003571668,0.0001439068,0.0004440429,0.0001843347,0.0002454319],"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.000002359078,0.00003420515,0.000003489787,0.00003203828,0.00004379583,0.000116371,0.001099269,0.006248408,0.001805427,0.03607828,0.001921667,0.9526147],"study_design_scores_gemma":[0.0002380065,0.0001022122,0.00002124671,0.0003411635,0.000009378238,0.0005302405,0.00006881569,0.9416633,0.001074364,0.03438482,0.02129928,0.0002671972],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009055137,0.0008638324,0.9706025,0.0004770512,0.01814036,0.0001645986,0.000005523054,0.0003245176,0.0003664677],"genre_scores_gemma":[0.3786037,0.00001388046,0.6174659,0.0004188956,0.002043239,0.000005086757,0.000005430289,0.00005015508,0.001393783],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9523475,"threshold_uncertainty_score":0.9997669,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02679274351788102,"score_gpt":0.2869566038815398,"score_spread":0.2601638603636587,"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."}}