{"id":"W2919078879","doi":"10.1145/3404860","title":"Circuit Lower Bounds for MCSP from Local Pseudorandom Generators","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Pseudorandom number generator; Upper and lower bounds; Boolean function; Mathematics; Combinatorics; Discrete mathematics; Truth table; Boolean circuit; Binary logarithm; Function (biology); Parity function; Algorithm; Boolean expression","routes":{"ca_aff":true,"ca_fund":true,"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.002949422,0.002553366,0.002229184,0.002232707,0.001745784,0.00545194,0.005170483,0.002682007,0.02603814],"category_scores_gemma":[0.02980181,0.001233317,0.003782125,0.003043318,0.003170414,0.01573203,0.007122686,0.01085006,0.004064511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005126885,"about_ca_system_score_gemma":0.003381316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002285373,"about_ca_topic_score_gemma":0.004160211,"domain_scores_codex":[0.9925447,0.001224698,0.0003870577,0.00170614,0.002875006,0.001262578],"domain_scores_gemma":[0.9634252,0.02795037,0.001265944,0.004571276,0.001866638,0.0009205221],"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.001525461,0.0006350498,0.004588429,0.001839792,0.0002746867,0.0005392862,0.000656284,0.1946841,0.02529432,0.5828365,0.0438448,0.1432813],"study_design_scores_gemma":[0.0002197925,0.0002390708,0.0009362868,0.0002030158,0.0002265153,0.0003372668,0.0001119002,0.3453724,0.009841553,0.6292318,0.01320282,0.00007774777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1048094,0.006869063,0.7765556,0.01154437,0.0006775825,0.0006569628,0.004392655,0.006175198,0.08831916],"genre_scores_gemma":[0.6886507,0.00429642,0.2594248,0.006221229,0.001997127,0.002298899,0.007987565,0.002853004,0.02627032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02603814,"threshold_uncertainty_score":0.08710623,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04122917108285918,"score_gpt":0.2584555555495299,"score_spread":0.2172263844666708,"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."}}