{"id":"W2160227782","doi":"10.1145/2465506.2465956","title":"Fast algorithms for <i>l</i> -adic towers over finite fields","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"","keywords":"Finite field; Closure (psychology); Algorithm; Computer science; Field (mathematics); Work (physics); Mathematics; Algebra over a field; Theoretical computer science; Discrete mathematics; Pure mathematics; Engineering; Mechanical engineering","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"],"consensus_categories":[],"category_scores_codex":[0.0003177432,0.0003042271,0.0002977634,0.0001863736,0.0001244138,0.000464829,0.001811358,0.000342677,0.0003341006],"category_scores_gemma":[0.00003426328,0.0002697885,0.0004223007,0.0001927923,0.00005730321,0.0002211216,0.001414387,0.0004257963,0.00006483644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001960522,"about_ca_system_score_gemma":0.00007680674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006694017,"about_ca_topic_score_gemma":0.000006394158,"domain_scores_codex":[0.998318,0.00004685637,0.0002820278,0.0007393821,0.0002203372,0.0003933844],"domain_scores_gemma":[0.9980894,0.0003497342,0.0001300761,0.001194823,0.0001009593,0.0001350477],"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.0000174287,0.0001241982,0.00008441089,0.0001720103,0.0001698507,0.000007009273,0.001122456,0.001493331,0.00003564912,0.4961556,0.08117575,0.4194423],"study_design_scores_gemma":[0.0005934909,0.0002229296,0.0001386767,0.0001276722,0.00003826488,0.000004387001,0.00003291637,0.2366512,0.0005922629,0.630712,0.1298922,0.0009940364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001174658,0.0001755119,0.9788362,0.0009522573,0.002388467,0.0005315394,0.0000198698,0.0003964131,0.01552506],"genre_scores_gemma":[0.328045,0.0003016136,0.6389611,0.01311286,0.00144337,0.001292962,0.00009242771,0.00009310112,0.01665757],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4184483,"threshold_uncertainty_score":0.9999754,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02501128809314856,"score_gpt":0.2605562789935025,"score_spread":0.2355449909003539,"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."}}