{"id":"W2078605119","doi":"10.1145/1113439.1113442","title":"The nearest polynomial with a given zero, revisited","year":2005,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"","keywords":"Monic polynomial; Zero (linguistics); Polynomial; Generalization; Mathematics; Matrix polynomial; Minor (academic); Reciprocal polynomial; Stable polynomial; Square-free polynomial; Combinatorics; Discrete mathematics; 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.002383432,0.0004423245,0.001117822,0.001374109,0.002101751,0.002229532,0.00180957,0.001355989,0.00732927],"category_scores_gemma":[0.01685585,0.0003913232,0.0005997919,0.001926217,0.004230489,0.007448849,0.003689288,0.003620271,0.001979722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002036507,"about_ca_system_score_gemma":0.001845571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002883543,"about_ca_topic_score_gemma":0.003943917,"domain_scores_codex":[0.9969668,0.0006203974,0.0001834601,0.0007173732,0.001072347,0.000439585],"domain_scores_gemma":[0.9965834,0.001437322,0.0002314411,0.0009982388,0.0005804803,0.0001691229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003759258,0.00007223085,0.001557721,0.0002617971,0.0000164759,0.0002423826,0.0006291653,0.009526841,0.003805752,0.8212648,0.008170921,0.154076],"study_design_scores_gemma":[0.00008106519,0.0002663087,0.0007295391,0.0001522845,0.00004629023,0.0009532818,0.0006997474,0.07153144,0.01548661,0.8666187,0.04335526,0.00007956779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1090097,0.002598847,0.8335355,0.006421576,0.0008745303,0.0000822474,0.0002833556,0.001295817,0.0458984],"genre_scores_gemma":[0.7170271,0.001317746,0.2572708,0.001199862,0.0004999352,0.00005711537,0.0003915949,0.0004570597,0.0217788],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00732927,"threshold_uncertainty_score":0.02451879,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00958647146113312,"score_gpt":0.2227940661412659,"score_spread":0.2132075946801328,"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."}}