{"id":"W4319971932","doi":"10.20944/preprints202302.0184.v1","title":"Accelerating the Wheel Factoring Techniques","year":2023,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"King Saud University","keywords":"Factoring; Integer factorization; Cryptosystem; Prime (order theory); Factorization; Prime factor; Computer science; Prime number; Set (abstract data type); Polynomial; Integer (computer science); Key (lock); Time complexity; Factorization of polynomials; Theoretical computer science; Algorithm; Discrete mathematics; Public-key cryptography; Mathematics; Cryptography; Combinatorics; Encryption; Matrix polynomial; Computer security; Programming language","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","open_science"],"consensus_categories":[],"category_scores_codex":[0.001401822,0.000484909,0.0004233122,0.0001917436,0.0005159598,0.000373092,0.004737032,0.0003005737,0.0000272197],"category_scores_gemma":[0.0002880656,0.0003639932,0.0002948892,0.0003918202,0.00008479742,0.0001559617,0.01497454,0.002215996,0.0005097928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009755469,"about_ca_system_score_gemma":0.0002160096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002892989,"about_ca_topic_score_gemma":0.000008568541,"domain_scores_codex":[0.9965256,0.0002121382,0.0005760001,0.001472208,0.0005918653,0.00062221],"domain_scores_gemma":[0.9960916,0.0003302898,0.0003925903,0.002923843,0.0001383743,0.0001233036],"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.00002607327,0.0005133055,0.3453162,0.001465094,0.001117134,0.0004734261,0.07281189,0.09598731,0.03106894,0.03261001,0.001428618,0.417182],"study_design_scores_gemma":[0.0002658295,0.00005417464,0.2905822,0.001467981,0.00005164577,0.00006878858,0.00012665,0.5155648,0.110596,0.04811285,0.03092815,0.002180915],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7936389,0.0001577228,0.1823191,0.008927843,0.004204138,0.001222551,0.00001249582,0.005969147,0.003548059],"genre_scores_gemma":[0.9719194,0.00006183227,0.02555236,0.0003288322,0.0009748269,0.0001874256,0.000007708917,0.00007089118,0.0008967583],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4195775,"threshold_uncertainty_score":0.9998812,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1794663858812045,"score_gpt":0.3539120227156378,"score_spread":0.1744456368344333,"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."}}