{"id":"W3124850851","doi":"10.1007/s10107-002-0328-8","title":"Easy and difficult objective functions for max cut","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Orthant; Mathematics; Combinatorics; Maximum cut; Function (biology); Sign (mathematics); Matching (statistics); Key (lock); Boundary (topology); Basis (linear algebra); Discrete mathematics; Graph; Mathematical analysis; Computer science; Statistics; Geometry","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.0001263661,0.0001041539,0.0001267968,0.00003581573,0.00009579308,0.00006871633,0.00003150747,0.00005829044,0.00003627019],"category_scores_gemma":[0.0002968109,0.00009169154,0.0000375473,0.0001348893,0.00003163232,0.00005056886,0.000006320596,0.0000788471,0.00002750262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002026998,"about_ca_system_score_gemma":0.000005806132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.598802e-7,"about_ca_topic_score_gemma":5.992283e-7,"domain_scores_codex":[0.9994524,0.000009904126,0.0001462167,0.0001207715,0.00007323346,0.0001975453],"domain_scores_gemma":[0.9996367,0.0001312465,0.00001359122,0.00008883876,0.00004870909,0.00008097461],"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.00004403631,0.001175914,0.0009857501,0.003510986,0.0008247023,0.00001658925,0.008341586,0.08209219,0.0006334525,0.4151391,0.001676098,0.4855596],"study_design_scores_gemma":[0.001234561,0.0001253694,0.00006024638,0.0001153213,0.0001245477,0.00006894075,0.00218914,0.9599948,0.001478774,0.01606041,0.01793522,0.0006126813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006514114,0.0001360385,0.9873355,0.00002378876,0.0001283554,0.0003574157,0.000002563359,0.0004065566,0.00509564],"genre_scores_gemma":[0.2469595,0.000004957028,0.7518733,0.00001879432,0.00005676493,0.0002496276,0.000008056129,0.00004444879,0.000784574],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8779026,"threshold_uncertainty_score":0.3739072,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01349676825050008,"score_gpt":0.2318726012653425,"score_spread":0.2183758330148425,"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."}}