{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003424044,0.0004737458,0.000568704,0.0002807731,0.00028356,0.0009806782,0.002860905,0.000322368,0.000140802],"category_scores_gemma":[0.001387729,0.0004908582,0.0003339001,0.0005171418,0.000142751,0.0004852607,0.004014798,0.001121843,0.000132745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001183217,"about_ca_system_score_gemma":0.0002710682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009199267,"about_ca_topic_score_gemma":0.00007848793,"domain_scores_codex":[0.9933732,0.003536877,0.0007166161,0.001250801,0.0005795289,0.0005430421],"domain_scores_gemma":[0.9923602,0.002759879,0.0005739298,0.003103131,0.0009260504,0.0002768042],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001941456,0.0007881528,0.00173919,0.000284468,0.000192926,0.00003472735,0.01328842,0.001694564,0.0008938031,0.05075412,0.002925348,0.9273849],"study_design_scores_gemma":[0.0006384871,0.000001857554,0.002989104,0.001470756,0.00003611082,0.00001065522,0.00005728085,0.9640307,0.006445215,0.007959804,0.01543055,0.000929475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00461742,0.0004477121,0.9744899,0.004137011,0.002034644,0.000390799,0.00004243493,0.0003487432,0.01349134],"genre_scores_gemma":[0.2866152,0.0003276907,0.7073324,0.0002383151,0.0001572542,0.0001146293,0.000102171,0.00005728769,0.005055034],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9623361,"threshold_uncertainty_score":0.9997543,"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."}}