{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002538206,0.0002107397,0.0006160178,0.0009913623,0.0001660147,0.0001602184,0.0009490458,0.00009519986,0.00001304991],"category_scores_gemma":[0.0002311377,0.0002186463,0.0002095089,0.002786503,0.0001688524,0.0002452842,0.0007879572,0.0004023309,0.0002036616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007396842,"about_ca_system_score_gemma":0.00007337822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002215312,"about_ca_topic_score_gemma":0.0000726675,"domain_scores_codex":[0.997518,0.0003300738,0.000606235,0.0005535901,0.0003047863,0.0006872821],"domain_scores_gemma":[0.9979079,0.001504148,0.0001208618,0.0003596776,0.00002608101,0.00008134926],"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.002059267,0.0003271226,0.01412237,0.0001305032,0.0001055631,0.001129911,0.01313776,0.05325456,0.0005013724,0.08317547,0.003224582,0.8288316],"study_design_scores_gemma":[0.02022315,0.00001690883,0.003940558,0.0001350911,0.000002413536,0.00001410771,0.00005898092,0.9544318,0.00008745841,0.02069992,0.0001253698,0.0002642904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5764462,0.0001423505,0.4171478,0.0009198394,0.001342493,0.0005859329,0.000002156022,0.0009411562,0.002472131],"genre_scores_gemma":[0.9892325,0.000006324132,0.01036058,0.0001744453,0.00009212373,0.000009380965,0.000005850374,0.00001504255,0.0001037461],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9011772,"threshold_uncertainty_score":0.8916137,"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."}}