{"id":"W4401559557","doi":"10.1088/1361-6528/ad6f18","title":"Improved time complexity for spintronic oscillator ising machines compared to a popular classical optimization algorithm for the Max-Cut problem","year":2024,"lang":"en","type":"article","venue":"Nanotechnology","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Science and Engineering Research Board","keywords":"Spintronics; Ising model; Time complexity; Algorithm; Maximum cut; Combinatorial optimization; Computational complexity theory; Graph; Bottleneck; Random graph; Computer science; Mathematics; Discrete mathematics; Statistical physics; Physics; Quantum mechanics","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.0002276213,0.0001680447,0.0002271446,0.0001528633,0.0003464143,0.0002290422,0.0009168389,0.0001762869,0.00000879766],"category_scores_gemma":[0.00003973094,0.0001283798,0.0001209348,0.0005760028,0.000110423,0.0001210229,0.0002932086,0.0001561844,0.00003226642],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001023819,"about_ca_system_score_gemma":0.00008742963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000181539,"about_ca_topic_score_gemma":0.00002010744,"domain_scores_codex":[0.998666,0.00001833045,0.0002760569,0.0005565957,0.0001065126,0.0003765206],"domain_scores_gemma":[0.9990452,0.0001389208,0.00005910024,0.0006176106,0.00008763751,0.00005155451],"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.00001263397,0.00008879654,0.000001271358,0.00006683558,0.00008119305,0.000001812649,0.0001426932,0.004667743,0.03097592,0.2786744,0.004617287,0.6806694],"study_design_scores_gemma":[0.000250589,0.0001002157,0.000001849543,0.00001502792,0.000023674,0.00002103205,0.000005367447,0.8911569,0.00269066,0.01251346,0.09307692,0.0001443043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006667297,0.0003279741,0.9674739,0.02824583,0.0002361652,0.001943255,0.00007164152,0.001024346,0.00001016937],"genre_scores_gemma":[0.0294658,0.000006434208,0.9686435,0.0002843774,0.0001221119,0.0009920154,0.00006719709,0.00003153984,0.0003870042],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8864892,"threshold_uncertainty_score":0.5235175,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0185477878557703,"score_gpt":0.273432847498734,"score_spread":0.2548850596429637,"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."}}