{"id":"W4416874118","doi":"10.1109/qce65121.2025.00018","title":"SCOOP: A Quantum-Computing Framework for Constrained Combinatorial Optimization","year":2025,"lang":"","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"SCOOP; Quadratic unconstrained binary optimization; Optimization problem; Set (abstract data type); Set cover problem; Constrained optimization; Combinatorial optimization; Cover (algebra); Quadratic programming","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.001202338,0.0007777665,0.001001416,0.0007315878,0.00124392,0.001400515,0.002078278,0.000841343,0.004295354],"category_scores_gemma":[0.002899316,0.0004234423,0.0009854119,0.001350209,0.00193076,0.002096268,0.002263901,0.002618436,0.0005226822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00146241,"about_ca_system_score_gemma":0.002786855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005077753,"about_ca_topic_score_gemma":0.008042487,"domain_scores_codex":[0.9993265,0.0002330636,0.00003097924,0.00007713156,0.0002523279,0.00008007284],"domain_scores_gemma":[0.9991305,0.0004085194,0.00005492731,0.0001825136,0.0001468512,0.00007663857],"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.000058535,0.00007153265,0.0003121113,0.0002280945,0.0000555943,0.00008457585,0.0001023396,0.5181574,0.001912234,0.435016,0.007756658,0.03624496],"study_design_scores_gemma":[0.00002067877,0.00001563806,0.00004407893,0.00001330409,0.00000466084,0.00001605373,0.00002111319,0.8025017,0.0004227001,0.1925682,0.004362112,0.000009761339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004169157,0.0002441862,0.9882957,0.0004115307,0.00005484392,0.00009340989,0.0001694417,0.0006047701,0.005957047],"genre_scores_gemma":[0.2294821,0.0007332005,0.764405,0.0003341022,0.0001175286,0.000609814,0.0004459312,0.0003847577,0.003487571],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005077753,"threshold_uncertainty_score":0.01436937,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01089222627490652,"score_gpt":0.276049794328442,"score_spread":0.2651575680535354,"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."}}