{"id":"W2965474919","doi":"10.4230/lipics.ccc.2019.1","title":"Criticality of Regular Formulas","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Boolean function; Upper and lower bounds; Satisfiability; Discrete mathematics; Bounded function; Criticality; Function (biology); Pigeonhole principle; Lemma (botany); Tree (set theory); Class (philosophy); Computer science","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"],"consensus_categories":[],"category_scores_codex":[0.0007368809,0.0003131859,0.0005365694,0.000244877,0.0001788467,0.0002238611,0.001793648,0.0001862829,0.00006645596],"category_scores_gemma":[0.00009776249,0.0002880576,0.0003878324,0.0004546853,0.0001765112,0.001814044,0.0007127272,0.0003226074,0.0001680525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006123246,"about_ca_system_score_gemma":0.0000691957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001446997,"about_ca_topic_score_gemma":0.000003348716,"domain_scores_codex":[0.9971945,0.00003813767,0.001132777,0.0003034715,0.0006301861,0.0007009401],"domain_scores_gemma":[0.997427,0.0002310493,0.0003252236,0.001434607,0.000389419,0.0001926407],"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.00007490972,0.0005713291,0.005457034,0.001524816,0.0001802155,0.000004991843,0.004808635,0.00009906101,0.0002996864,0.9580384,0.002960223,0.02598064],"study_design_scores_gemma":[0.008473298,0.001500513,0.00723908,0.0006355774,0.00008048188,0.0002052694,0.001488966,0.5895389,0.02160308,0.1636152,0.2036414,0.00197813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2352151,0.00006732503,0.7462919,0.0007061192,0.001878119,0.001487485,0.0003757027,0.0003226826,0.01365562],"genre_scores_gemma":[0.8645991,0.00001498515,0.133916,0.000868417,0.0000832442,0.00004242764,0.00009792131,0.00002573635,0.0003521624],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7944232,"threshold_uncertainty_score":0.9999571,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01088334422631499,"score_gpt":0.246164314884639,"score_spread":0.235280970658324,"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."}}