{"id":"W2996677505","doi":"","title":"Sparse polynomial interpolation. Exploring fast heuristic algorithms over finite fields","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Heuristic; Interpolation (computer graphics); Algorithm; Polynomial interpolation; Polynomial; Computer science; Finite field; Mathematical optimization; Mathematics; Linear interpolation; Discrete mathematics; Artificial intelligence; 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.0009719595,0.00076832,0.0007462341,0.0009297042,0.0005068199,0.0009859186,0.001129756,0.001069097,0.008195696],"category_scores_gemma":[0.007377134,0.0004949662,0.0006431123,0.001773782,0.001039834,0.001901585,0.001173695,0.001258261,0.001444517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008437708,"about_ca_system_score_gemma":0.0009763355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003186399,"about_ca_topic_score_gemma":0.004016698,"domain_scores_codex":[0.9995295,0.0001873378,0.00001506369,0.00006777377,0.0001482579,0.00005218012],"domain_scores_gemma":[0.9978563,0.001666379,0.0001048339,0.0001881878,0.0001239529,0.00006039929],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004409297,0.0001751316,0.0008424264,0.0006862339,0.00004876522,0.0000803939,0.0001491245,0.5413765,0.002573788,0.1497251,0.009539909,0.2943618],"study_design_scores_gemma":[0.00007637931,0.00004533515,0.0000876792,0.0000368596,0.00001083107,0.00003703285,0.00003967706,0.9144617,0.0009684035,0.07973453,0.004494963,0.000006619601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0344311,0.002672085,0.9458231,0.000746995,0.0001461403,0.00008913598,0.000275779,0.001204036,0.01461165],"genre_scores_gemma":[0.3397368,0.001453924,0.6516801,0.0002365329,0.0001685219,0.0001692255,0.000489307,0.0004407753,0.005624943],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008195696,"threshold_uncertainty_score":0.02741736,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03631179572215997,"score_gpt":0.2608554636284519,"score_spread":0.2245436679062919,"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."}}