{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006690226,0.002170342,0.001744645,0.002442483,0.002295905,0.004587952,0.00578401,0.002676542,0.01419165],"category_scores_gemma":[0.05281118,0.001658858,0.00350814,0.004617889,0.004029627,0.01331278,0.004679648,0.008229,0.00303337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007153672,"about_ca_system_score_gemma":0.005271093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003348504,"about_ca_topic_score_gemma":0.004219517,"domain_scores_codex":[0.9911299,0.002731244,0.0003663246,0.001709393,0.002544234,0.001518898],"domain_scores_gemma":[0.9108474,0.07205503,0.004390238,0.008362629,0.003138036,0.001206668],"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.001310129,0.0008035974,0.007507139,0.0008727888,0.0003691237,0.0003894721,0.0005540125,0.1865836,0.0173494,0.6319135,0.02231131,0.1300359],"study_design_scores_gemma":[0.0001131875,0.0001563492,0.001665328,0.000120269,0.0001767424,0.0002874288,0.00006880189,0.6428296,0.01436468,0.333581,0.006579404,0.00005729135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0563213,0.001944987,0.9055988,0.003105443,0.0001670643,0.0002777246,0.0006796778,0.002568879,0.02933607],"genre_scores_gemma":[0.6486948,0.001673663,0.32763,0.003186152,0.0005863839,0.001241703,0.002355054,0.00163894,0.01299339],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01419165,"threshold_uncertainty_score":0.05190378,"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."}}