{"id":"W2588168239","doi":"","title":"Quantum algorithm for identifying hidden polynomial function graphs","year":2008,"lang":"en","type":"article","venue":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Mitacs; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Mathematics; Coset; Combinatorics; Polynomial; Discrete mathematics; Degree (music); Constant (computer programming); Generalization; Quantum algorithm; Finite field; Quantum; Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008326809,0.0002191334,0.0002404096,0.0005607158,0.002382991,0.001055595,0.002443887,0.00007818883,0.000001984532],"category_scores_gemma":[0.0004607975,0.0001355596,0.0001256887,0.001444548,0.001073116,0.00201445,0.0005352621,0.0003530737,0.00001026466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001947316,"about_ca_system_score_gemma":0.0007520972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002769349,"about_ca_topic_score_gemma":0.00001529083,"domain_scores_codex":[0.9959445,0.00007945771,0.0006488893,0.0003825774,0.002151678,0.0007929164],"domain_scores_gemma":[0.9968734,0.001537809,0.0002148872,0.0003991096,0.0008302909,0.0001445363],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004676684,0.000262525,0.00002811908,0.0001488804,0.00004419214,0.000002870619,0.01646823,0.001144399,0.00007381751,0.7290456,0.008488293,0.2442463],"study_design_scores_gemma":[0.0006768574,0.0001969854,0.0004934231,0.00005043908,0.000004988187,0.00008751235,0.0001962803,0.7695312,0.00005053297,0.2241424,0.004421866,0.0001475303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03972596,0.00005842242,0.9550645,0.002387509,0.0009532867,0.001306229,0.00002255886,0.000052804,0.0004287641],"genre_scores_gemma":[0.8188058,0.00008470351,0.1790289,0.0009650316,0.0006358949,0.0003768656,0.00002608539,0.00001641958,0.0000602889],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7790798,"threshold_uncertainty_score":0.9999814,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1000981305699883,"score_gpt":0.3440964081248228,"score_spread":0.2439982775548346,"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."}}