{"id":"W2945811367","doi":"10.3390/math7050441","title":"Algorithms and Data Structures for Sparse Polynomial Arithmetic","year":2019,"lang":"en","type":"article","venue":"Mathematics","topic":"Cryptography and Residue Arithmetic","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; International Business Machines Corporation","keywords":"Division (mathematics); Remainder; Multiplication (music); Greatest common divisor; Division algorithm; Divisor (algebraic geometry); Arithmetic; Set (abstract data type); Computer science; Polynomial; Mathematics; Algorithm; Theoretical computer science; Discrete mathematics; Combinatorics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001702015,0.001194779,0.0008987114,0.002576842,0.001331498,0.004306835,0.003166482,0.001047491,0.01517609],"category_scores_gemma":[0.007796839,0.0008232527,0.001482305,0.005415397,0.001430484,0.006413182,0.003179439,0.002747891,0.01032875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001713394,"about_ca_system_score_gemma":0.00248109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001471747,"about_ca_topic_score_gemma":0.002397084,"domain_scores_codex":[0.9977564,0.0003582837,0.0002761275,0.0002576893,0.001140804,0.000210641],"domain_scores_gemma":[0.996781,0.000848017,0.0002363146,0.001257193,0.0007795613,0.00009780179],"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.000334511,0.0001776926,0.001178246,0.0007047935,0.00007172867,0.0001463317,0.0004577819,0.01938103,0.01097869,0.358016,0.03930109,0.5692521],"study_design_scores_gemma":[0.0002039186,0.0001976661,0.0005512394,0.0002431381,0.00007114858,0.0007084398,0.0002073017,0.1840737,0.04634263,0.5105855,0.25671,0.000105278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002998758,0.0005460655,0.9823617,0.0002602521,0.00008033874,0.0001375568,0.0005660054,0.007244792,0.005804488],"genre_scores_gemma":[0.04488611,0.0008937317,0.9435536,0.0002427354,0.0001778536,0.0004902718,0.002529956,0.001622506,0.005603408],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01517609,"threshold_uncertainty_score":0.05076909,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03530159646975184,"score_gpt":0.2821293431156444,"score_spread":0.2468277466458925,"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."}}