{"id":"W2951495502","doi":"","title":"Finding shortest lattice vectors faster using quantum search","year":2014,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Perimeter Institute; University of Waterloo","funders":"","keywords":"Lattice problem; Quantum; Quantum algorithm; Computer science; Heuristic; Lattice (music); Mathematics; Discrete mathematics; Algorithm; Mathematical optimization; Cryptography; Physics; Quantum mechanics","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","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001114926,0.0007337718,0.000975199,0.0008389436,0.0004320176,0.0004284842,0.003566559,0.0005800098,0.00008440893],"category_scores_gemma":[0.0001909498,0.000757368,0.0005072574,0.0004172416,0.0006223454,0.0003267182,0.009323128,0.002666594,0.000229281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001030357,"about_ca_system_score_gemma":0.0003613468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002606224,"about_ca_topic_score_gemma":0.0001208473,"domain_scores_codex":[0.9943507,0.0009835954,0.0008113218,0.002049227,0.0005773426,0.00122779],"domain_scores_gemma":[0.9951685,0.001137494,0.0003893745,0.002757602,0.0001564373,0.0003905669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003147674,0.0001362333,0.01212609,0.0001419301,0.0001785763,0.0001633944,0.003406458,0.002568228,0.0006299015,0.9785105,0.0001897773,0.001917452],"study_design_scores_gemma":[0.0003555176,0.00009576629,0.01269488,0.0002328565,0.00007195598,0.0001948052,0.0001115239,0.2166032,0.0006072485,0.7667407,0.001345795,0.0009457321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3355398,0.00009332495,0.660751,0.0003416508,0.001577971,0.0004028391,0.0000887331,0.0002560716,0.0009485281],"genre_scores_gemma":[0.453321,0.00004426818,0.5458544,0.0002617216,0.0003232977,0.00003897918,0.0001136554,0.00004248814,2.851127e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2140349,"threshold_uncertainty_score":0.9996343,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05176874913598306,"score_gpt":0.3106721060402166,"score_spread":0.2589033569042335,"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."}}