{"id":"W2394568608","doi":"","title":"Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits.","year":2014,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Satisfiability; Mathematics; Parity (physics); Electronic circuit; Binary number; Algorithm; Boolean circuit; Boolean function; Correlation; Constant (computer programming); Discrete mathematics; Combinatorics; Arithmetic; Computer science; Physics","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.001009623,0.0003722055,0.0004212775,0.0001999915,0.0008875899,0.0002944492,0.0007978776,0.0001266218,0.00002511006],"category_scores_gemma":[0.0002703708,0.0004064434,0.0001884444,0.0006333804,0.0002604968,0.0002941798,0.0002425245,0.0004294892,0.00003096524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000242348,"about_ca_system_score_gemma":0.0003334457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002689661,"about_ca_topic_score_gemma":0.0000791904,"domain_scores_codex":[0.9970234,0.0002142334,0.0005002804,0.0009298648,0.0005396886,0.0007925084],"domain_scores_gemma":[0.9964914,0.002235409,0.0002312279,0.000493316,0.0003469888,0.0002016416],"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.00004189825,0.000170475,0.0001404588,0.00002933945,0.00005216633,0.000001014533,0.0001574748,0.01085191,0.00002052892,0.9496251,0.0005337778,0.03837582],"study_design_scores_gemma":[0.0009847746,0.0006168113,0.005784041,0.00001428748,0.00001014048,0.00002591623,0.000004907436,0.5545074,0.00002422269,0.4280527,0.009696822,0.0002779182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01343568,0.0001358718,0.9813055,0.002093939,0.000635891,0.0006899668,0.00003535355,0.0003517906,0.001315982],"genre_scores_gemma":[0.8580963,0.000007832383,0.1393363,0.001468877,0.0003674046,0.0001026786,0.0001323029,0.00003186267,0.0004564706],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8446606,"threshold_uncertainty_score":0.9998388,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03848540810114379,"score_gpt":0.2754499485606698,"score_spread":0.2369645404595261,"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."}}