{"id":"W2953924437","doi":"10.4230/lipics.fscd.2019.27","title":"Hilbert’s Tenth Problem in Coq","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Prevention of Organ Failure","funders":"Agence Nationale de la Recherche","keywords":"Diophantine equation; Recursively enumerable language; Computability; Constructive; Recursively enumerable set; Diophantine set; Mathematics; Proof assistant; Discrete mathematics; Type (biology); Algebra over a field; Computer science; Calculus (dental); Pure mathematics; Programming language; Mathematical proof","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","scholarly_communication","open_science","research_integrity"],"consensus_categories":["metaepi_narrow","open_science"],"category_scores_codex":[0.001875518,0.001284917,0.001681076,0.000954515,0.0002299468,0.001487741,0.006146548,0.001091694,0.00004334429],"category_scores_gemma":[0.0001877386,0.001211707,0.0007786932,0.0007262045,0.0002102344,0.001857953,0.009012859,0.002408598,0.0005207866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009546467,"about_ca_system_score_gemma":0.0006843419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001795251,"about_ca_topic_score_gemma":0.0000873277,"domain_scores_codex":[0.9923116,0.0001651545,0.003021603,0.001342624,0.001327006,0.001831997],"domain_scores_gemma":[0.9932819,0.0004554989,0.001372299,0.003831243,0.000656201,0.0004028351],"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.0007513085,0.01251416,0.1486866,0.04164015,0.00259204,0.0002974615,0.122262,0.1802618,0.00006619046,0.1445659,0.06007545,0.2862869],"study_design_scores_gemma":[0.004434143,0.0004849572,0.004574111,0.001069998,0.00005871136,0.0001092192,0.0003430923,0.9118727,0.0001421203,0.02115772,0.05340889,0.002344335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05033607,0.0002977497,0.9099203,0.002122001,0.007783568,0.01046956,0.00104578,0.00118905,0.01683594],"genre_scores_gemma":[0.543161,0.000161555,0.4494104,0.002301223,0.0006493226,0.001378091,0.001416508,0.0002327824,0.001289072],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.731611,"threshold_uncertainty_score":0.9999903,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01939949537691218,"score_gpt":0.2582195057091013,"score_spread":0.2388200103321892,"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."}}