{"id":"W4402603214","doi":"10.2139/ssrn.4958665","title":"Computing Local Optima in Quadratic Unconstrained Binary Optimization Problems in Randomized Polynomial Time","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Quadratic unconstrained binary optimization; Binary number; Quadratic equation; Mathematics; Time complexity; Mathematical optimization; Polynomial; Local optimum; Binary quadratic form; Applied mathematics; Quadratic function; Algorithm; Mathematical analysis; Arithmetic; Physics","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.004577176,0.002353039,0.003879183,0.00158273,0.001695709,0.004260496,0.00376231,0.003626896,0.01966247],"category_scores_gemma":[0.02547151,0.002169557,0.002248318,0.002930383,0.00258576,0.007206911,0.003453515,0.005469798,0.002948859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003080365,"about_ca_system_score_gemma":0.00392799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006380619,"about_ca_topic_score_gemma":0.01359991,"domain_scores_codex":[0.9961717,0.001384045,0.0002225216,0.0009909336,0.0006507849,0.0005800753],"domain_scores_gemma":[0.973693,0.02219145,0.001092971,0.001659477,0.0007341073,0.0006289017],"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.002621028,0.0008966438,0.001861706,0.0008132812,0.0002170133,0.0001353646,0.0001957157,0.8237934,0.003011957,0.0277184,0.01562308,0.1231124],"study_design_scores_gemma":[0.0002719509,0.0001118574,0.0002032685,0.00002425708,0.00004402563,0.00002310502,0.00004869945,0.9707581,0.0007813128,0.02720624,0.0005153989,0.00001184412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.162422,0.001743743,0.7999234,0.003588276,0.0004321932,0.0005227823,0.001257889,0.006320552,0.02378919],"genre_scores_gemma":[0.542621,0.0004771721,0.4407786,0.0008614651,0.0003904646,0.0007293763,0.002048841,0.00187393,0.01021921],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01966247,"threshold_uncertainty_score":0.06577754,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005255960677448376,"score_gpt":0.2127617156318315,"score_spread":0.2075057549543832,"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."}}