{"id":"W2053658780","doi":"10.1007/s00037-015-0100-0","title":"Mining Circuit Lower Bound Proofs for Meta-Algorithms","year":2015,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Mathematical proof; Algorithm; Truth table; Computer science; Upper and lower bounds; Boolean function; Circuit minimization for Boolean functions; Discrete mathematics; Boolean circuit; Mathematics","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.004082973,0.001631439,0.001821095,0.004873542,0.00189476,0.007300355,0.005127371,0.002621689,0.01627334],"category_scores_gemma":[0.07500808,0.002008634,0.003172714,0.005114804,0.002072475,0.01441961,0.003141381,0.005861141,0.003319012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00246759,"about_ca_system_score_gemma":0.003766994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008280216,"about_ca_topic_score_gemma":0.002089406,"domain_scores_codex":[0.9922551,0.002297578,0.0005351913,0.001452131,0.002792417,0.0006675972],"domain_scores_gemma":[0.9039083,0.07729338,0.003679257,0.009201215,0.004838835,0.001078986],"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.001052053,0.0008702247,0.01443553,0.003840786,0.0009811501,0.0008102602,0.0006399944,0.09362995,0.007650958,0.4229982,0.07539633,0.3776946],"study_design_scores_gemma":[0.0001498173,0.0001131989,0.001205543,0.0003446323,0.0003509146,0.0004444821,0.0001514696,0.171735,0.005983819,0.8053626,0.01411036,0.00004819939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1245876,0.006352395,0.8197657,0.008852283,0.0007002945,0.0005644888,0.007386322,0.00474646,0.02704436],"genre_scores_gemma":[0.6649897,0.003570683,0.3044359,0.00230627,0.001253469,0.0005324611,0.01264358,0.001747701,0.008520328],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01627334,"threshold_uncertainty_score":0.05443978,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3098774182245229,"score_gpt":0.3417031708771991,"score_spread":0.03182575265267629,"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."}}