{"id":"W4416254315","doi":"10.48550/arxiv.2509.19005","title":"Quantum Annealing for Minimum Bisection Problem: A Machine Learning-based Approach for Penalty Parameter Tuning","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Quadratic unconstrained binary optimization; Quantum annealing; Simulated annealing; Bisection method; Quadratic equation; Solver; Penalty method; Graph","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017378,0.000749749,0.0009661181,0.0006936715,0.000659702,0.0009299762,0.001819644,0.001449384,0.002585622],"category_scores_gemma":[0.004934369,0.0006481141,0.0006636679,0.000741866,0.001286652,0.001509901,0.001381202,0.002055134,0.000427338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001107384,"about_ca_system_score_gemma":0.001365822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002287166,"about_ca_topic_score_gemma":0.002531528,"domain_scores_codex":[0.9993885,0.0002836691,0.00002256339,0.0001058009,0.0001525399,0.00004700533],"domain_scores_gemma":[0.998328,0.001123401,0.0001284261,0.000192952,0.0001676511,0.00005948261],"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.00004776334,0.00004567944,0.0003197574,0.00006775196,0.0000327567,0.00002605048,0.00004991502,0.9294679,0.002474905,0.04159151,0.00105229,0.02482371],"study_design_scores_gemma":[0.000005112456,0.000007255746,0.00002230137,0.000003133442,0.00000195172,0.000004126117,0.000003013919,0.9922574,0.0002956702,0.007086198,0.0003114488,0.000002518358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008367554,0.0001524149,0.9889331,0.0002061286,0.00002863869,0.00003805723,0.00001997618,0.0002822263,0.001972005],"genre_scores_gemma":[0.4027449,0.0002833811,0.5929662,0.0003751176,0.00005913216,0.0003468738,0.000127799,0.0003607127,0.00273581],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002585622,"threshold_uncertainty_score":0.0091905,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04433815020586464,"score_gpt":0.2805361195340266,"score_spread":0.2361979693281619,"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."}}