{"id":"W1503393710","doi":"10.1007/978-3-642-17517-6_25","title":"Computing Sparse Multiples of Polynomials","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplicative function; Degree (music); Multiple; Combinatorics; Finite field; Polynomial; Extension (predicate logic); Computational complexity theory; Constant (computer programming); Discrete mathematics; Mathematics; Time complexity; Field (mathematics); Order (exchange); Algorithm; Computer science; Arithmetic; Pure mathematics; Physics; Mathematical analysis","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.001538099,0.0005081729,0.0006969848,0.001129968,0.0002718178,0.0002907685,0.004308979,0.0004028034,0.00002776359],"category_scores_gemma":[0.0001410103,0.0004750201,0.0002627997,0.0006838102,0.001362093,0.0003796701,0.001778641,0.001043474,0.0000204635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005920287,"about_ca_system_score_gemma":0.0003621825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002128023,"about_ca_topic_score_gemma":0.00005431178,"domain_scores_codex":[0.9965629,0.00004998205,0.0006990932,0.001301996,0.0007674132,0.0006186041],"domain_scores_gemma":[0.996374,0.0009996501,0.0005310967,0.001692444,0.000233135,0.0001697452],"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.00001155675,0.00005032339,0.000190551,0.00005572249,0.00001937898,0.00004036442,0.001268891,0.004299477,0.006931606,0.1251178,0.000005843843,0.8620085],"study_design_scores_gemma":[0.0006733619,0.0003677569,0.0005005921,0.0009966618,0.00002317772,0.0001203347,4.738478e-7,0.228828,0.05346428,0.7107347,0.00276675,0.001523887],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001439153,0.0002787121,0.9925269,0.0002113173,0.002253205,0.0002751376,0.000005884961,0.0001650834,0.002844549],"genre_scores_gemma":[0.5053083,0.00001485989,0.4938501,0.0003911939,0.0003659201,0.000001564892,0.000001779615,0.0000242671,0.00004197902],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8604846,"threshold_uncertainty_score":0.9997702,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01845773878091628,"score_gpt":0.2413564479593867,"score_spread":0.2228987091784704,"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."}}