{"id":"W1976060866","doi":"10.1109/cso.2009.443","title":"An Approximation Algorithm for Max k-Uncut with Capacity Constraints","year":2009,"lang":"en","type":"article","venue":"","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Partition (number theory); Approximation algorithm; Combinatorics; Cluster analysis; Graph partition; Graph; Algorithm; Mathematics; Enhanced Data Rates for GSM Evolution; Partition problem; Computer science; Discrete mathematics; Artificial intelligence","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.002726045,0.002943777,0.002697932,0.002051567,0.001917829,0.003429495,0.004217974,0.003221374,0.01207527],"category_scores_gemma":[0.0105731,0.001267159,0.001611105,0.004674941,0.001843028,0.006272731,0.002923892,0.003262532,0.00298745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004052117,"about_ca_system_score_gemma":0.005193937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0143872,"about_ca_topic_score_gemma":0.0183158,"domain_scores_codex":[0.9981076,0.0004978005,0.0001035492,0.0005059023,0.0003798031,0.0004054217],"domain_scores_gemma":[0.9946052,0.003897404,0.0003314373,0.0005713391,0.0003922029,0.0002024288],"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.0006905802,0.0003328173,0.0009383914,0.000424326,0.0000876501,0.0001403746,0.0002263851,0.7399613,0.001362271,0.02907719,0.01793211,0.2088266],"study_design_scores_gemma":[0.0001107197,0.00006126655,0.0001195067,0.00003409512,0.00002085581,0.00007188343,0.00008547513,0.954922,0.0008122476,0.04203174,0.00171185,0.00001824775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02173431,0.001546258,0.961206,0.001264282,0.0001792193,0.0003527283,0.000898607,0.00409022,0.008728531],"genre_scores_gemma":[0.1680071,0.0006070816,0.820937,0.0004643203,0.0001490219,0.0006732057,0.00218898,0.0007628693,0.00621052],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0143872,"threshold_uncertainty_score":0.0403958,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009062424674789507,"score_gpt":0.2254905312869681,"score_spread":0.2164281066121786,"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."}}