{"id":"W4387495189","doi":"10.1007/s00500-023-09230-5","title":"Finding local Max-Cut in graphs in randomized polynomial time","year":2023,"lang":"en","type":"article","venue":"Soft Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Maximum cut; Solver; Time complexity; Algorithm; Discrete mathematics; Combinatorics; Mathematical optimization; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00418393,0.00281286,0.004488702,0.002694275,0.00288886,0.00684759,0.006208417,0.004039771,0.02024856],"category_scores_gemma":[0.02508418,0.001993854,0.003483873,0.004499625,0.003158102,0.01399443,0.004808221,0.005770239,0.002890976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004954251,"about_ca_system_score_gemma":0.006990182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005629654,"about_ca_topic_score_gemma":0.01450251,"domain_scores_codex":[0.9947636,0.001605445,0.0002685549,0.001575218,0.0008207989,0.0009662772],"domain_scores_gemma":[0.95724,0.0342201,0.002261085,0.00369612,0.001069876,0.001512757],"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.005150951,0.00282142,0.009394622,0.002922786,0.0007573018,0.0004459169,0.0008703558,0.5452392,0.01323785,0.08655723,0.05050545,0.2820969],"study_design_scores_gemma":[0.000552615,0.0001999768,0.000922406,0.00007501375,0.0001788704,0.0001568226,0.0003389745,0.799704,0.004110177,0.1919671,0.00175764,0.00003656349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2564109,0.001207533,0.7042452,0.007577606,0.0003380534,0.001419338,0.003624864,0.008222979,0.01695354],"genre_scores_gemma":[0.5907753,0.0004179461,0.3907005,0.001201671,0.0003871084,0.0007376818,0.004278861,0.001786488,0.009714397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02024856,"threshold_uncertainty_score":0.06773818,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01721017739143031,"score_gpt":0.2594123217486479,"score_spread":0.2422021443572175,"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."}}