{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001218637,0.0006312627,0.0008101399,0.002486006,0.001090204,0.00257244,0.001211205,0.0006346711,0.005744952],"category_scores_gemma":[0.01569053,0.0005195135,0.0007554906,0.0009457064,0.002435771,0.003392465,0.001737077,0.002121229,0.000528033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002405917,"about_ca_system_score_gemma":0.001139564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001653537,"about_ca_topic_score_gemma":0.001160306,"domain_scores_codex":[0.998162,0.0002142734,0.0001064834,0.0006069208,0.0005050342,0.0004053129],"domain_scores_gemma":[0.9833745,0.01159758,0.001531752,0.001102858,0.00139614,0.0009970771],"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.00130823,0.000231748,0.01906465,0.000738708,0.0001694976,0.001238476,0.001416579,0.04113206,0.04725735,0.7873611,0.009388436,0.09069314],"study_design_scores_gemma":[0.0001372308,0.0002741274,0.003951905,0.0001181339,0.0001221799,0.001195929,0.000251658,0.1611007,0.0283659,0.7938765,0.01053289,0.00007286498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7368367,0.001892584,0.2168713,0.001775119,0.0001387018,0.0002414598,0.001518253,0.0012173,0.0395085],"genre_scores_gemma":[0.9832045,0.0002836695,0.0122426,0.0003553208,0.0001504011,0.0001195521,0.000533408,0.0001199003,0.002990506],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005744952,"threshold_uncertainty_score":0.0192188,"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."}}