{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001092173,0.0006686425,0.0005983143,0.0005139585,0.0006384903,0.001638478,0.001410077,0.001225146,0.01070963],"category_scores_gemma":[0.005305316,0.000290183,0.0006589941,0.0007746654,0.0006325573,0.001997977,0.0007547971,0.001255716,0.0007187849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001566386,"about_ca_system_score_gemma":0.002005982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002366261,"about_ca_topic_score_gemma":0.00331002,"domain_scores_codex":[0.9990995,0.0002811095,0.00003821356,0.000227249,0.0001888775,0.0001650139],"domain_scores_gemma":[0.9959616,0.002937816,0.0001943455,0.0004162214,0.0003007012,0.0001892728],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001673266,0.0005420526,0.003431026,0.000661323,0.0001156292,0.000227216,0.0002032858,0.6931006,0.01935176,0.1292576,0.01924944,0.1321868],"study_design_scores_gemma":[0.00005024376,0.00003994219,0.0002096839,0.00000781104,0.000009518114,0.00002817723,0.0000168112,0.9808914,0.002008559,0.01616653,0.0005664778,0.00000483104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5221403,0.001201216,0.4225047,0.003571488,0.0003442028,0.0002561493,0.0009121062,0.004969759,0.04410021],"genre_scores_gemma":[0.8145678,0.00018703,0.1780365,0.000277443,0.00005641462,0.0002002932,0.0008546856,0.0003879275,0.005431932],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01070963,"threshold_uncertainty_score":0.03582734,"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."}}