{"id":"W2016590269","doi":"10.1109/ccc.2014.34","title":"Mining Circuit Lower Bound Proofs for Meta-algorithms","year":2014,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Algorithm; Mathematical proof; Upper and lower bounds; Boolean function; Circuit minimization for Boolean functions; Computer science; Truth table; Discrete mathematics; Mathematics; Combinatorics; Boolean circuit","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.005437011,0.001581916,0.001589519,0.004461661,0.001392207,0.00565615,0.004592015,0.002299352,0.007254483],"category_scores_gemma":[0.07042719,0.002117322,0.003064024,0.004334143,0.002584529,0.01063195,0.003353238,0.003961897,0.001858981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002811779,"about_ca_system_score_gemma":0.004018413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00106105,"about_ca_topic_score_gemma":0.001724269,"domain_scores_codex":[0.9900726,0.002907991,0.0006072227,0.001611956,0.004134867,0.0006652774],"domain_scores_gemma":[0.9401391,0.04525176,0.002950212,0.008187027,0.002862906,0.0006090555],"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.0008896621,0.0004864409,0.008546749,0.002594672,0.0006182769,0.0009734154,0.0008025051,0.1925036,0.01263817,0.434252,0.02226296,0.3234317],"study_design_scores_gemma":[0.0001480104,0.0001063011,0.0006236724,0.0002149992,0.0001592431,0.0003363568,0.00008776251,0.4369985,0.01198502,0.5375273,0.01176669,0.0000461379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06327423,0.002626789,0.9149092,0.002898635,0.0001583702,0.0003709068,0.002773133,0.006055906,0.006932825],"genre_scores_gemma":[0.4710534,0.001889347,0.5105833,0.001212176,0.0004090878,0.0007203307,0.008305917,0.001565064,0.004261341],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007254483,"threshold_uncertainty_score":0.02875406,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09072336173278771,"score_gpt":0.2825751297770325,"score_spread":0.1918517680442448,"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."}}