{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001046114,0.0003400409,0.0005514206,0.0002131256,0.0004861563,0.0004781141,0.001416204,0.00008464105,0.00006408952],"category_scores_gemma":[0.00019643,0.000327786,0.0004351898,0.0006569468,0.0003129068,0.0007053072,0.0004574959,0.0001887595,0.00006580883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001206603,"about_ca_system_score_gemma":0.0003781494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002483218,"about_ca_topic_score_gemma":0.00001570997,"domain_scores_codex":[0.9971493,0.0001432276,0.0005333009,0.0008062781,0.0008343703,0.0005335519],"domain_scores_gemma":[0.9974052,0.0005628623,0.0002163418,0.0006058573,0.0008576261,0.0003521607],"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.00003201171,0.0003596836,0.00009192377,0.00003765711,0.0006156638,0.00001937444,0.0008313434,0.01320831,0.000005552321,0.9578258,0.01546991,0.01150278],"study_design_scores_gemma":[0.0006450954,0.0001769919,0.0008013762,0.000005816605,0.00007197651,0.0000409285,0.00001979837,0.3923003,0.0000217499,0.5929149,0.01270443,0.0002965847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004975388,0.0003892652,0.9881971,0.00153873,0.001287881,0.0005789155,0.00007170948,0.0004069759,0.002553968],"genre_scores_gemma":[0.2861275,5.684176e-7,0.7118548,0.0009749913,0.0003579113,0.0002491614,0.0001021995,0.00002657962,0.0003063635],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.379092,"threshold_uncertainty_score":0.9999174,"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."}}