{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003225834,0.0001965285,0.0003061275,0.0001158309,0.0002530883,0.0005950544,0.001070388,0.00006288251,0.0008703063],"category_scores_gemma":[0.00004711878,0.0001529544,0.000326481,0.0003503561,0.00007432024,0.0008840049,0.0002492986,0.00009129139,0.0001824405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002023891,"about_ca_system_score_gemma":0.00005126611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006365904,"about_ca_topic_score_gemma":0.00001199647,"domain_scores_codex":[0.9984441,0.00002975072,0.0002797171,0.0005147112,0.0002779982,0.0004537715],"domain_scores_gemma":[0.9987075,0.000224552,0.00007319047,0.0006671649,0.0001943816,0.000133264],"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.000002691679,0.0002893964,0.00005330613,0.00004645273,0.0008965086,0.000009514972,0.0007557844,0.0000236185,0.0002887061,0.6027889,0.06673729,0.3281079],"study_design_scores_gemma":[0.0008989558,0.0004619126,0.0008439191,0.00001379636,0.0002440473,0.00004924184,0.00009614588,0.3124637,0.002980411,0.5324647,0.1485047,0.0009784658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001766093,0.0002337258,0.9827049,0.001695324,0.0008054198,0.0006587788,0.000003690854,0.0003280546,0.01180402],"genre_scores_gemma":[0.09014595,0.000004786741,0.8946386,0.002058297,0.0002803715,0.001234237,0.000004421266,0.00002602727,0.01160731],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3271294,"threshold_uncertainty_score":0.9529244,"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."}}