{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007301655,0.0001860735,0.0003199339,0.0001086518,0.0002685865,0.000355973,0.001047323,0.00006019409,0.0001500007],"category_scores_gemma":[0.00009023476,0.0001480402,0.0003258433,0.0003144814,0.00007107978,0.0004243882,0.000218046,0.00008618242,0.00004357538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001595485,"about_ca_system_score_gemma":0.00003699289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001320123,"about_ca_topic_score_gemma":0.00001482748,"domain_scores_codex":[0.9984805,0.00004794047,0.0002584061,0.0005250201,0.0002806366,0.0004075139],"domain_scores_gemma":[0.9986464,0.0003376063,0.00007505976,0.0007058851,0.0001201245,0.0001149063],"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.000002881904,0.0001091395,0.00002034197,0.00002270858,0.0003018507,0.000002708613,0.0002865228,0.00002632412,0.00007259455,0.8130558,0.0070517,0.1790474],"study_design_scores_gemma":[0.0006382901,0.0003995839,0.000186654,0.000008890839,0.0001777996,0.00002532681,0.00002167884,0.3879072,0.001841299,0.3175123,0.2907358,0.0005452451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000651622,0.0001040056,0.9824034,0.0008846667,0.0008788823,0.0002707277,0.000002994117,0.0002904136,0.0145133],"genre_scores_gemma":[0.1252582,0.000002563839,0.8657396,0.001925833,0.0004216385,0.0003288454,0.000004264761,0.00002430882,0.006294771],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4955436,"threshold_uncertainty_score":0.6036904,"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."}}