{"id":"W4378505355","doi":"10.48550/arxiv.2305.15140","title":"Polynomial-Time Pseudodeterministic Construction of Primes","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Simons Institute for the Theory of Computing, University of California Berkeley; Natural Sciences and Engineering Research Council of Canada; University of Warwick; National Science Foundation","keywords":"Mathematics; Time complexity; Polynomial; Randomized algorithm; Prime (order theory); Randomness; Bootstrapping (finance); Discrete mathematics; Combinatorics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001581742,0.0002306952,0.0003552929,0.0002717752,0.000102329,0.00007052263,0.001567159,0.0002277761,0.00002752855],"category_scores_gemma":[0.00003392359,0.0002561747,0.0001606956,0.000383989,0.0001665058,0.0003021091,0.002989956,0.0002889612,0.0001860753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007249942,"about_ca_system_score_gemma":0.0002409889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001527385,"about_ca_topic_score_gemma":0.000002506502,"domain_scores_codex":[0.9984905,0.00008987854,0.0002405728,0.0008450288,0.0001000429,0.0002340117],"domain_scores_gemma":[0.9980161,0.0001259147,0.0003625044,0.001273311,0.0001138063,0.0001084011],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006457678,0.001495461,0.01833178,0.002551076,0.001804402,0.00447244,0.002385177,0.3425533,0.00875569,0.4426979,0.08713082,0.0871762],"study_design_scores_gemma":[0.000406489,0.0000750187,0.001931462,0.0002192316,0.0000680966,0.00001468178,0.00002859487,0.9774554,0.0009434249,0.01769611,0.0007090343,0.000452398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1651399,0.00003149437,0.8308478,0.00006609321,0.001638592,0.0002810826,0.0001206904,0.0004909963,0.001383366],"genre_scores_gemma":[0.9746729,0.0001075139,0.02233444,0.00001601424,0.0001071897,7.045391e-7,0.00004967199,0.00002140256,0.002690141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8095331,"threshold_uncertainty_score":0.999989,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0645481934173141,"score_gpt":0.1917848961161812,"score_spread":0.1272367026988671,"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."}}