{"id":"W2951015993","doi":"10.48550/arxiv.1110.4350","title":"Taking Roots over High Extensions of Finite Fields","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Finite field; Prime (order theory); Mathematics; Integer (computer science); Combinatorics; Polynomial; Multiplication (music); Binary logarithm; Field (mathematics); Modular arithmetic; Discrete mathematics; Time complexity; Algorithm; Pure mathematics; Computer science; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008559875,0.0009131686,0.0009540175,0.001464509,0.001146136,0.002420849,0.001264159,0.0006990577,0.01028051],"category_scores_gemma":[0.004757606,0.0003767797,0.0006429036,0.001271072,0.001386877,0.005953149,0.003295877,0.002201495,0.003904478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00121357,"about_ca_system_score_gemma":0.001141895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007801842,"about_ca_topic_score_gemma":0.001436324,"domain_scores_codex":[0.9990125,0.0001404562,0.00006525735,0.0002527799,0.0003433311,0.0001856566],"domain_scores_gemma":[0.9983786,0.0005531798,0.0001493544,0.0005977881,0.0001818473,0.0001391443],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001077187,0.0002168051,0.004438293,0.0004206971,0.00008697097,0.0005541711,0.0006973278,0.02250248,0.03349491,0.3056737,0.0141349,0.6167026],"study_design_scores_gemma":[0.0002134349,0.0003142822,0.001077474,0.0001218075,0.00007231152,0.0009273226,0.0003880075,0.1180217,0.04819004,0.7999334,0.03064047,0.00009973955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3153234,0.001300426,0.6436822,0.001499347,0.0004002368,0.0001415776,0.0003960978,0.004478643,0.03277799],"genre_scores_gemma":[0.6663184,0.0004619505,0.3171729,0.0002247859,0.0002690501,0.00008579079,0.0005892052,0.0004301428,0.01444773],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01028051,"threshold_uncertainty_score":0.03439176,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07178566113802666,"score_gpt":0.187560119454726,"score_spread":0.1157744583166994,"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."}}