{"id":"W2911695748","doi":"10.1038/s41598-022-11687-7","title":"Factoring semi-primes with (quantum) SAT-solvers","year":2022,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute; University of Waterloo; Canadian Institute for Advanced Research","funders":"Institut Périmètre de physique théorique; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Quantum computer; Computer science; Integer factorization; Quantum algorithm; Post-quantum cryptography; Boolean satisfiability problem; Factorization; Quantum; Cryptography; Time complexity; Theoretical computer science; Factoring; Satisfiability; Algorithm; Discrete mathematics; Parallel computing; Public-key cryptography; Mathematics; Quantum mechanics; Encryption","routes":{"ca_aff":true,"ca_fund":true,"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":["sts"],"consensus_categories":[],"category_scores_codex":[0.001186224,0.0001890763,0.0001905316,0.0002408482,0.00160327,0.0006565186,0.0008049691,0.00002292263,0.00007281942],"category_scores_gemma":[0.00002962063,0.0001549183,0.00009387897,0.001203701,0.000133541,0.000257624,0.0009416968,0.0003319033,0.00001300686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008771775,"about_ca_system_score_gemma":0.0002974469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003439096,"about_ca_topic_score_gemma":0.000002032632,"domain_scores_codex":[0.9968409,0.00007278034,0.0003300483,0.001147131,0.001101668,0.000507458],"domain_scores_gemma":[0.9980147,0.00005323188,0.0002729377,0.001424655,0.00007681875,0.0001576818],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005119813,0.0009828964,0.03958053,0.0001536262,0.0003063546,0.02151002,0.04301257,0.6151511,0.04497015,0.01648388,0.06980938,0.1479883],"study_design_scores_gemma":[0.0003981654,0.0003878479,0.003473553,0.00006059998,0.00002083722,0.00446984,0.0004431579,0.4500218,0.01086769,0.02033745,0.508416,0.001103078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8979428,0.0001837251,0.08514541,0.0006432597,0.01395537,0.0002589404,0.000002116696,0.0005956265,0.001272718],"genre_scores_gemma":[0.9877732,3.805732e-7,0.01042475,0.00008451521,0.00007354318,0.00001826453,0.00001133917,0.00001583094,0.001598204],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4386066,"threshold_uncertainty_score":0.9996965,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009637495079463697,"score_gpt":0.2141646400311276,"score_spread":0.2045271449516639,"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."}}