{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00218586,0.001711069,0.001704094,0.003058952,0.002360554,0.005802667,0.0036023,0.001906264,0.0207065],"category_scores_gemma":[0.01023572,0.001280157,0.002388555,0.002773701,0.002196875,0.01185708,0.005754239,0.004117679,0.007278427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003693992,"about_ca_system_score_gemma":0.002398194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001673912,"about_ca_topic_score_gemma":0.003385956,"domain_scores_codex":[0.9977064,0.0004307393,0.0001984902,0.0004708172,0.0006919347,0.0005015555],"domain_scores_gemma":[0.9915175,0.004349808,0.000558023,0.002326963,0.0008756341,0.0003720916],"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.001059379,0.0002635678,0.003615003,0.001054667,0.0001479366,0.0003857838,0.001306324,0.04789507,0.01591444,0.5291314,0.0337509,0.3654756],"study_design_scores_gemma":[0.0002590951,0.0001318784,0.0004630482,0.0001569716,0.00005443528,0.0003312584,0.0003284996,0.190148,0.01688563,0.7772476,0.01390098,0.00009261812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05468147,0.0008538719,0.9118719,0.001222575,0.0003011819,0.0002885509,0.0009986736,0.009132917,0.02064885],"genre_scores_gemma":[0.3799009,0.0005595145,0.6034695,0.0003484979,0.0002448069,0.0003564699,0.002649029,0.001797779,0.01067355],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0207065,"threshold_uncertainty_score":0.06927013,"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."}}