{"id":"W4313400513","doi":"10.1007/s10878-022-00976-6","title":"Approximation algorithms for the lower bounded correlation clustering problem","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Postdoctoral Research Foundation of China; National Natural Science Foundation of China","keywords":"Rounding; Mathematics; Cluster analysis; Bounded function; Combinatorics; Theory of computation; Approximation algorithm; Algorithm; Correlation clustering; Generalization; Discrete mathematics; Time complexity; Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.001318017,0.00009102993,0.0001313117,0.0001426025,0.0005273095,0.0003536971,0.0007537396,0.00002597349,0.00001904917],"category_scores_gemma":[0.00006373126,0.00007299134,0.00009110193,0.0004240186,0.00001477306,0.00140561,0.0002628551,0.0001676801,7.799948e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001368761,"about_ca_system_score_gemma":0.00007088879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002317158,"about_ca_topic_score_gemma":8.725389e-8,"domain_scores_codex":[0.9986796,0.00009076041,0.0004308778,0.0001310739,0.0005301609,0.0001374772],"domain_scores_gemma":[0.9987034,0.0001463808,0.0006399518,0.0002099523,0.0002676283,0.00003272759],"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.00005860666,0.0001373179,0.000005979056,0.000008325786,0.00003323107,0.000001792028,0.000210071,0.9321685,0.000005969215,0.04962706,0.001972261,0.01577089],"study_design_scores_gemma":[0.001403132,0.0004676804,0.00001191437,0.000007667118,0.00003003592,0.00001568915,0.00005513936,0.971742,0.00001421436,0.01460053,0.01156384,0.00008812358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003562696,0.00005836177,0.9882629,0.001231106,0.009705113,0.0004571822,0.000002940743,0.00002946249,0.0002173403],"genre_scores_gemma":[0.04461727,0.00004390635,0.9537602,0.0001911237,0.0009467416,0.00008992017,0.00004468588,0.00002411963,0.0002820381],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04458164,"threshold_uncertainty_score":0.4055692,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01637880291401984,"score_gpt":0.2421794220351608,"score_spread":0.225800619121141,"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."}}