{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002489014,0.0002087822,0.0002330719,0.0001177265,0.0004566093,0.0002085647,0.0008904076,0.00008996283,0.0001116802],"category_scores_gemma":[0.00004539921,0.0002171725,0.000240246,0.0005075455,0.0001286959,0.0003626008,0.00002028438,0.0002243491,0.00008564003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004425409,"about_ca_system_score_gemma":0.00008280271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001276575,"about_ca_topic_score_gemma":0.000005149437,"domain_scores_codex":[0.9984345,0.0001679409,0.000315013,0.0005589334,0.0002750596,0.0002485452],"domain_scores_gemma":[0.9980556,0.001094404,0.00008378217,0.0004676618,0.0001195385,0.0001789653],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002414684,0.000230208,0.000003231716,0.00002197445,0.0001440505,0.000008363829,0.00184701,0.06103642,0.0001870647,0.07629918,0.0005210148,0.85946],"study_design_scores_gemma":[0.001863139,0.0003285836,0.00004316983,0.0000162648,0.00003707161,0.000004153711,0.0001184914,0.4032846,0.002765071,0.5881366,0.00307924,0.0003236518],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003036403,0.0000941903,0.9925052,0.002309307,0.001133498,0.0003123748,0.00007762099,0.0004003297,0.0001311089],"genre_scores_gemma":[0.8595466,0.000009288259,0.1366723,0.003447784,0.0001809503,0.00005945395,0.00002470188,0.00002208651,0.00003680062],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8591363,"threshold_uncertainty_score":0.8856038,"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."}}