{"id":"W4229581165","doi":"10.1007/978-3-030-11298-1_6","title":"The Incompressibility Method","year":2019,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Simple (philosophy); Argument (complex analysis); Pigeonhole principle; Property (philosophy); Probabilistic logic; Mathematics; Object (grammar); Calculus (dental); Computer science; Algorithm; Discrete mathematics; Artificial intelligence; Philosophy; Epistemology; Statistics; Chemistry","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"],"consensus_categories":["open_science"],"category_scores_codex":[0.007223103,0.0007658625,0.0008545616,0.000573338,0.0007076173,0.001504307,0.01388714,0.0003324873,0.00003506129],"category_scores_gemma":[0.0001292718,0.0005657703,0.0002885485,0.0008309851,0.001612766,0.001050567,0.009956268,0.001348723,0.0004370534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007343382,"about_ca_system_score_gemma":0.001669327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004398737,"about_ca_topic_score_gemma":0.00007750284,"domain_scores_codex":[0.9922224,0.0002338911,0.001145268,0.003081455,0.00210605,0.001210879],"domain_scores_gemma":[0.9904304,0.002306453,0.0005513784,0.005903832,0.000514223,0.0002937131],"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.000004002583,0.00004468219,0.00005874418,0.00002704345,0.000009830647,0.00003532768,0.0002527863,0.002231828,0.000008709781,0.3136184,0.0003996721,0.683309],"study_design_scores_gemma":[0.0002631182,0.0001476684,0.001866321,0.0001295797,0.000005467698,0.00006321367,9.454726e-7,0.6445587,0.00005474021,0.3186133,0.03356607,0.0007308394],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005687302,0.0006019823,0.9112429,0.0008378771,0.005260014,0.000994839,0.000005439354,0.000369508,0.08063056],"genre_scores_gemma":[0.006690082,0.00008284596,0.9463406,0.0009931212,0.0007547479,0.00002865696,0.000002694705,0.00007056587,0.04503674],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6825781,"threshold_uncertainty_score":0.9996794,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02562430948896769,"score_gpt":0.297116307488622,"score_spread":0.2714919979996543,"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."}}