{"id":"W2773164695","doi":"10.1016/j.jsc.2020.06.007","title":"Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields","year":2020,"lang":"en","type":"preprint","venue":"Journal of Symbolic Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Public Works and Government Services Canada; National Science Foundation","keywords":"Mathematics; Finite field; Lift (data mining); Polynomial ring; Invariant (physics); Hasse principle; Multiplication (music); Complex multiplication; Polynomial; Discrete mathematics; Combinatorics; Pure mathematics; Algebraic number field; Elliptic curve; Computer science","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003635453,0.0002478979,0.0004726442,0.0003258938,0.0001261286,0.000443364,0.0006177954,0.0001443535,0.000006834738],"category_scores_gemma":[0.00008493038,0.0002169438,0.0001298454,0.0002620392,0.00005301146,0.000405749,0.0005076791,0.000562998,0.000001877498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000038652,"about_ca_system_score_gemma":0.0001263092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002655974,"about_ca_topic_score_gemma":0.00000512717,"domain_scores_codex":[0.9983778,0.0001290975,0.0006121081,0.000351144,0.0003604723,0.0001693633],"domain_scores_gemma":[0.9979326,0.0003854769,0.0009431854,0.0002861646,0.0002836729,0.0001689103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009054853,0.0008504422,0.04596716,0.001355633,0.002264586,0.0002908283,0.05884309,0.3982536,0.00933909,0.09994064,0.003358328,0.3786311],"study_design_scores_gemma":[0.001993528,0.000573369,0.393319,0.0007797079,0.0001384289,0.0001626928,0.0001285158,0.4862417,0.0005646635,0.1144429,0.0008957332,0.0007598418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.267569,0.0001036473,0.7300653,0.001687167,0.0002937074,0.0001481246,0.000004882715,0.00004652272,0.00008172347],"genre_scores_gemma":[0.9550528,0.00005769056,0.04424949,0.0003090232,0.0003026961,0.00000431757,0.000006953017,0.00001383052,0.000003235787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6874838,"threshold_uncertainty_score":0.884671,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04452285834766072,"score_gpt":0.28032262866604,"score_spread":0.2357997703183792,"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."}}