{"id":"W2397193627","doi":"","title":"Mining Circuit Lower Bound Proofs for Meta-Algorithms.","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Mathematical proof; Truth table; Boolean function; Algorithm; Computer science; Upper and lower bounds; Boolean circuit; Circuit minimization for Boolean functions; Discrete mathematics; 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.006882031,0.001397467,0.001579922,0.002834006,0.001242935,0.004428382,0.004207781,0.001968734,0.008712562],"category_scores_gemma":[0.08860913,0.001879347,0.003208291,0.00305451,0.002773848,0.01040752,0.004787173,0.005341502,0.001756372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002487688,"about_ca_system_score_gemma":0.002759759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005406268,"about_ca_topic_score_gemma":0.0009899782,"domain_scores_codex":[0.9872586,0.00367063,0.0006253802,0.001821003,0.006060743,0.0005636837],"domain_scores_gemma":[0.9093534,0.06982552,0.003662611,0.0124917,0.003919762,0.0007469283],"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.0008633102,0.0004725583,0.008429302,0.002603031,0.0006471175,0.0007368005,0.000803996,0.1051024,0.01557111,0.5495781,0.02154923,0.2936431],"study_design_scores_gemma":[0.000144535,0.0001184923,0.0007868134,0.0001924781,0.0001753007,0.0004086811,0.0000876808,0.3690724,0.01161009,0.6062379,0.01112378,0.000041801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04107786,0.001917504,0.9396507,0.003218807,0.0001674891,0.0004883083,0.001766171,0.003611261,0.008101993],"genre_scores_gemma":[0.5351179,0.001325775,0.4482712,0.001905821,0.0005159822,0.0009253871,0.00551577,0.001102649,0.005319312],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008712562,"threshold_uncertainty_score":0.03639609,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0945715747060616,"score_gpt":0.2774951260997269,"score_spread":0.1829235513936653,"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."}}