{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001373942,0.001169778,0.00129916,0.002673721,0.002068453,0.003578644,0.001670069,0.001769193,0.03667561],"category_scores_gemma":[0.005880461,0.0007845467,0.001462599,0.002362859,0.007626419,0.01029404,0.003756272,0.00705855,0.009261837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001385418,"about_ca_system_score_gemma":0.0009870953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005441998,"about_ca_topic_score_gemma":0.0004215554,"domain_scores_codex":[0.9984901,0.0005097003,0.00006970888,0.0003715999,0.0004466956,0.0001121641],"domain_scores_gemma":[0.9984848,0.0007859151,0.00006225706,0.0004630041,0.0001461823,0.00005789696],"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.000007146344,0.000005512764,0.0000142332,0.0000302486,0.000003383077,0.000011988,0.0000431048,0.0001354958,0.00006513168,0.9828283,0.005186101,0.01166939],"study_design_scores_gemma":[0.000004025099,0.000003058288,0.00002227065,0.00002294169,0.000003352862,0.00003600746,0.00001219589,0.0006020719,0.0001595768,0.9634912,0.03563874,0.000004600435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.003971974,0.01149176,0.2305073,0.00516436,0.00196297,0.00005265667,0.0003088934,0.0004529906,0.746087],"genre_scores_gemma":[0.3148821,0.01846921,0.2082775,0.004689802,0.00564411,0.0006401155,0.001217117,0.002208987,0.443971],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.03667561,"threshold_uncertainty_score":0.1226921,"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."}}