{"id":"W1580605208","doi":"10.1109/wswan.2015.7210302","title":"Hybrid local search approximation algorithm for solving the capacitated Max-K-cut problem","year":2015,"lang":"en","type":"article","venue":"","topic":"Smart Parking Systems Research","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Local search (optimization); Approximation algorithm; Vertex (graph theory); Algorithm; Maximum cut; Computer science; Search algorithm; Mathematics; Mathematical optimization; Theoretical computer science; Graph","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":[],"consensus_categories":[],"category_scores_codex":[0.001374472,0.0001384476,0.000149987,0.0001072107,0.0001055522,0.0001286599,0.0002570388,0.00005504649,0.00002037243],"category_scores_gemma":[0.00005039746,0.00009941153,0.00004897157,0.0001923172,0.00006795357,0.0001663832,0.00004602902,0.0002107427,0.0001593497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002366645,"about_ca_system_score_gemma":0.00006712109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001730354,"about_ca_topic_score_gemma":0.00002611526,"domain_scores_codex":[0.998575,0.00005463694,0.0002435646,0.0001829087,0.0004642934,0.0004796396],"domain_scores_gemma":[0.9991503,0.000168668,0.00001585343,0.0002792679,0.0002552271,0.0001306362],"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.00004194017,0.00009445425,0.0002653191,0.0009412646,0.0004018618,0.0000241518,0.00596786,0.2068811,0.006914952,0.003396967,0.2112105,0.5638596],"study_design_scores_gemma":[0.0004011897,0.00004190993,0.00001755847,0.00002630429,0.000004779734,0.00003176772,0.0007144181,0.9730027,0.01601897,0.0003826893,0.009221292,0.0001363585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01383015,0.0001039714,0.9742836,0.0001541817,0.0002758212,0.001160969,0.00001319925,0.0004699496,0.009708109],"genre_scores_gemma":[0.9636175,0.00000353031,0.03367445,0.0000196352,0.0002835254,0.000404605,0.0000385377,0.00007507164,0.00188317],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9497873,"threshold_uncertainty_score":0.4053884,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04446632716159683,"score_gpt":0.2692381515591262,"score_spread":0.2247718243975294,"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."}}