{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003449066,0.001967537,0.001094626,0.001296233,0.001079601,0.002811446,0.001672032,0.001884322,0.009800022],"category_scores_gemma":[0.01264973,0.0009445867,0.001076841,0.001492918,0.001819915,0.005754023,0.002325273,0.005162787,0.001309881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009203834,"about_ca_system_score_gemma":0.0006744965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006902323,"about_ca_topic_score_gemma":0.0007613047,"domain_scores_codex":[0.9984888,0.0006721338,0.00005780749,0.000182572,0.0004625746,0.0001361214],"domain_scores_gemma":[0.994393,0.004311988,0.0003146002,0.0004528093,0.0003592089,0.0001684497],"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.0002653002,0.0001692852,0.0007991312,0.0005587381,0.00005643819,0.0001806634,0.0002051212,0.1317244,0.002619332,0.667149,0.0233052,0.1729674],"study_design_scores_gemma":[0.00002723283,0.00004641862,0.0003443735,0.00008386924,0.00001980595,0.0001496675,0.00006237676,0.232107,0.001434181,0.7585444,0.00715152,0.00002907241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01830169,0.002010999,0.9549553,0.001725682,0.0002800544,0.00008813994,0.0002914495,0.000365402,0.02198129],"genre_scores_gemma":[0.3802423,0.002610124,0.5829161,0.0007873263,0.0009799018,0.0005305651,0.000944279,0.001106423,0.02988301],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009800022,"threshold_uncertainty_score":0.03278434,"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."}}