{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004709382,0.0007687767,0.00103219,0.001042389,0.000673272,0.001616503,0.0007674394,0.000607754,0.01205443],"category_scores_gemma":[0.005115738,0.0005295769,0.0004369825,0.001979532,0.0008026073,0.003370677,0.002150194,0.001549938,0.002874034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005464171,"about_ca_system_score_gemma":0.0004660848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004353258,"about_ca_topic_score_gemma":0.001362822,"domain_scores_codex":[0.9994173,0.0001063495,0.00002635866,0.0001368174,0.0002288452,0.00008429752],"domain_scores_gemma":[0.9984431,0.0007939027,0.0001141839,0.0003400083,0.0002021061,0.0001068003],"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.0005884081,0.0001061973,0.00160509,0.0004431384,0.00009510863,0.0003204854,0.0003622592,0.04445547,0.02050769,0.4034517,0.03527175,0.4927927],"study_design_scores_gemma":[0.00007415047,0.0001448597,0.0005600465,0.00008622663,0.00004373243,0.0005193401,0.0001822388,0.2146934,0.01221259,0.7452381,0.02621076,0.0000345732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1652981,0.001658309,0.7715764,0.002124086,0.0006049778,0.0000914336,0.000922921,0.002335501,0.05538823],"genre_scores_gemma":[0.6228448,0.00135787,0.339963,0.0004690987,0.0007198497,0.00009001472,0.001978093,0.0005400214,0.03203736],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01205443,"threshold_uncertainty_score":0.04032612,"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."}}