{"id":"W2184665873","doi":"10.1007/978-3-319-24318-4_9","title":"Constructing SAT Filters with a Quantum Annealer","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Computer science; Constraint satisfaction problem; Context (archaeology); Filter (signal processing); Constraint satisfaction; Flexibility (engineering); Bloom filter; Algorithm; Constraint (computer-aided design); Set (abstract data type); Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001062238,0.0008273131,0.0007872542,0.0009202385,0.0003502372,0.0008115612,0.003687985,0.0003241359,0.00001684497],"category_scores_gemma":[0.00008581063,0.000649529,0.0001374548,0.0008917509,0.001293086,0.0004996978,0.001654896,0.001426958,0.00005429639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003975479,"about_ca_system_score_gemma":0.001122763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003390887,"about_ca_topic_score_gemma":0.00006772178,"domain_scores_codex":[0.9946477,0.00005620391,0.0005853779,0.0020956,0.001530278,0.00108484],"domain_scores_gemma":[0.9965534,0.0004640742,0.0004432655,0.001708213,0.0004336178,0.0003974031],"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.00001546448,0.0000254046,0.0001643081,0.00005613812,0.00002486105,0.0004561046,0.001219845,0.123603,0.00001813026,0.02753614,0.00008461512,0.8467959],"study_design_scores_gemma":[0.0004836358,0.0004045452,0.0000319756,0.0005763338,0.00001015489,0.0006985292,9.599078e-7,0.9149971,0.0001213963,0.08019399,0.001536392,0.0009450024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007715446,0.0005136557,0.9913925,0.00112943,0.001872645,0.0003710375,0.00001028143,0.0003748316,0.003564067],"genre_scores_gemma":[0.182026,0.000008290063,0.8153663,0.001190408,0.0009317822,0.000007725484,0.00001369669,0.00008792427,0.0003678524],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8458509,"threshold_uncertainty_score":0.9995956,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01962916636434409,"score_gpt":0.2389272044149647,"score_spread":0.2192980380506206,"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."}}