{"id":"W2952497380","doi":"10.4230/lipics.itcs.2020.6","title":"Local max-cut in smoothed polynomial time","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Blavatnik Family Foundation; Israel Science Foundation; Microsoft Research","keywords":"Mathematical proof; Mathematics; Bounded function; Polynomial; Time complexity; Combinatorics; Applied mathematics; Discrete mathematics; Mathematical analysis; Geometry","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002520363,0.001241266,0.001708315,0.001080578,0.00149413,0.00377437,0.00290957,0.001764304,0.009363186],"category_scores_gemma":[0.01718606,0.0009321656,0.002385122,0.002362706,0.002712344,0.008464816,0.003413293,0.0064013,0.00203749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005029581,"about_ca_system_score_gemma":0.003342022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00490921,"about_ca_topic_score_gemma":0.009256685,"domain_scores_codex":[0.995935,0.0008762254,0.000179491,0.00129787,0.001031454,0.00067987],"domain_scores_gemma":[0.9876108,0.007843165,0.000794262,0.002648871,0.0006697718,0.0004331708],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001062887,0.0003258394,0.002765921,0.001412522,0.0003768246,0.0002763966,0.001112989,0.282596,0.01061434,0.5794213,0.02913312,0.09090187],"study_design_scores_gemma":[0.0001198505,0.00005359266,0.0005396614,0.00003817055,0.00008429202,0.0001154978,0.00007694487,0.3120556,0.002365243,0.6757133,0.008810288,0.00002752339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.078021,0.002398259,0.8812605,0.005365758,0.0002494791,0.000273867,0.001514723,0.00471619,0.02620039],"genre_scores_gemma":[0.6800284,0.001143438,0.2997191,0.001408246,0.0004019142,0.0005140297,0.002298805,0.001475895,0.01301014],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009363186,"threshold_uncertainty_score":0.03649229,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04791971121089802,"score_gpt":0.1787176246254022,"score_spread":0.1307979134145042,"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."}}