{"id":"W2396953629","doi":"","title":"An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas.","year":2013,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Time complexity; Algorithm; Constructive; struct; Running time; Deterministic algorithm; Discrete mathematics; Computational complexity theory; Random variable; Combinatorics; Computer science; Statistics","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.0004149379,0.000352487,0.0003404012,0.0001651399,0.0006156443,0.0005018587,0.001444481,0.0001104337,0.00006694125],"category_scores_gemma":[0.00004448797,0.0003445511,0.0001468908,0.0003419665,0.00009759617,0.0006759173,0.0002501634,0.0003090599,0.00007874432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000447435,"about_ca_system_score_gemma":0.0007388256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001670191,"about_ca_topic_score_gemma":0.00006780518,"domain_scores_codex":[0.9971954,0.0001374247,0.0004412246,0.0008237348,0.0003763766,0.001025889],"domain_scores_gemma":[0.9979271,0.0004583486,0.0002011558,0.0007083484,0.0003827935,0.0003222302],"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.000122614,0.001519535,0.0001053318,0.00006513092,0.0001502964,0.00001224282,0.0004716103,0.01357601,0.003106163,0.3257479,0.004505484,0.6506177],"study_design_scores_gemma":[0.0009161096,0.001179041,0.003388443,0.00001042078,0.000008419945,0.00003160452,0.000009558727,0.7736635,0.000286406,0.2188055,0.001369809,0.0003312621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02668448,0.00003895572,0.9708022,0.0005862289,0.000254211,0.001087838,0.00008206454,0.0003357124,0.0001282362],"genre_scores_gemma":[0.528978,0.000001850069,0.4691526,0.0009769755,0.0002028262,0.0002505354,0.0003089561,0.00002925773,0.00009895131],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7600874,"threshold_uncertainty_score":0.9999006,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02286164684050804,"score_gpt":0.2770429379744798,"score_spread":0.2541812911339718,"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."}}