{"id":"W1565645651","doi":"10.4230/lipics.ccc.2024.25","title":"Formulas For The Square Root Modulo p","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of California, San Diego; National Science Foundation","keywords":"Modulo; Primitive root modulo n; Finite field; Square (algebra); Square root; Mathematics; Prime (order theory); Combinatorics; Polynomial; Field (mathematics); Root (linguistics); Function (biology); Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007326747,0.0009002335,0.0004366469,0.001658205,0.001217093,0.002402597,0.001043606,0.0008588405,0.01566678],"category_scores_gemma":[0.004010177,0.000371471,0.0006065813,0.001172007,0.001536597,0.004335325,0.001515858,0.002360664,0.003789695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001207943,"about_ca_system_score_gemma":0.0007150887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005972559,"about_ca_topic_score_gemma":0.001136184,"domain_scores_codex":[0.9994491,0.00009808565,0.00003463251,0.00008433075,0.0002465468,0.00008730227],"domain_scores_gemma":[0.9993221,0.000294076,0.00005819295,0.0001172735,0.0001689283,0.00003955786],"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.00002471421,0.00001498712,0.0001841029,0.0000462948,0.000003919825,0.0001706216,0.0002072238,0.001000279,0.001508235,0.9692918,0.003707037,0.02384073],"study_design_scores_gemma":[0.00001289933,0.00002326215,0.0001292285,0.00004562393,0.00001090955,0.0003826478,0.0001058493,0.008615795,0.003244644,0.9689042,0.01850607,0.00001894755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1255756,0.001799019,0.5670227,0.002695221,0.001047223,0.0001656437,0.0005383276,0.0009048841,0.3002515],"genre_scores_gemma":[0.7308109,0.001817989,0.2032575,0.0007845051,0.0006074275,0.0002329697,0.0006304643,0.0007098256,0.06114843],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01566678,"threshold_uncertainty_score":0.0524106,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09650571339318634,"score_gpt":0.1833584482030146,"score_spread":0.08685273480982825,"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."}}