{"id":"W4313036617","doi":"10.5486/pmd.2004.3190","title":"On the greatest and least prime factors of $n!+1$. II.","year":2004,"lang":"en","type":"article","venue":"Publicationes Mathematicae Debrecen","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Prime (order theory); 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":[],"consensus_categories":[],"category_scores_codex":[0.0003280255,0.0001082394,0.0001271092,0.0001087093,0.0002080948,0.0001001353,0.0006710322,0.00003290852,0.00003453621],"category_scores_gemma":[0.0002538939,0.00006658854,0.00004920176,0.0004892487,0.0001120709,0.0002665859,0.0001651591,0.0000686432,0.00002285779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001142086,"about_ca_system_score_gemma":0.00002637826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004398379,"about_ca_topic_score_gemma":9.953793e-7,"domain_scores_codex":[0.9992499,0.00003498212,0.0001925681,0.0001987103,0.0001859819,0.0001378765],"domain_scores_gemma":[0.9987553,0.0003407196,0.0001264085,0.0006333594,0.00008754357,0.00005660938],"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.000001529667,0.0001162926,0.0002329775,0.00001161787,0.00001366602,6.909027e-8,0.001578659,0.000002500715,0.0002104619,0.9960613,0.00006415869,0.001706774],"study_design_scores_gemma":[0.000192223,0.00009652334,0.008944379,0.00004949134,0.000009627081,0.00001028101,0.000101674,0.0004541371,0.005673406,0.9837898,0.0005454652,0.0001330116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.864979,0.00005818025,0.1069741,0.01842494,0.00005903831,0.0003626798,0.000004810049,0.0002164036,0.00892084],"genre_scores_gemma":[0.9960619,0.000005312404,0.003679593,0.0001564869,0.000008128765,0.00001878231,0.000001989636,0.000006522486,0.00006124034],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1310829,"threshold_uncertainty_score":0.2715402,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01847922146514539,"score_gpt":0.2112560128762868,"score_spread":0.1927767914111414,"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."}}