{"id":"W2122483877","doi":"10.1016/s0304-3975(02)00643-6","title":"Almost k-wise independence and hard Boolean functions","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Boolean function; Mathematics; Combinatorics; Discrete mathematics; Linear subspace; Upper and lower bounds; Function (biology); Polynomial; Computable function; Independence (probability theory); Circuit complexity; Affine transformation; Electronic circuit; Pure 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":["sts"],"consensus_categories":[],"category_scores_codex":[0.00159494,0.0002054715,0.0001928969,0.0002192702,0.0008954727,0.0006990767,0.001703225,0.00006146598,0.00007832776],"category_scores_gemma":[0.0001520389,0.0001798185,0.00005899385,0.001405685,0.003578375,0.0009366217,0.000884436,0.000331064,0.00009490754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003483091,"about_ca_system_score_gemma":0.0001507368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004884875,"about_ca_topic_score_gemma":0.000001237546,"domain_scores_codex":[0.9973333,0.0001270578,0.0002425686,0.0009102355,0.0007659711,0.0006208284],"domain_scores_gemma":[0.9982279,0.0002132512,0.0000522236,0.0009181335,0.0001771808,0.0004113302],"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.000001779139,0.00004450253,0.000200824,0.000003500422,0.000002864491,0.00001202896,0.0002093241,0.00002560934,0.000151261,0.9665099,0.00006236525,0.03277602],"study_design_scores_gemma":[0.0003674182,0.0002873148,0.00539632,0.00003496048,0.000007585631,0.0003814618,0.00002283285,0.2861727,0.002272218,0.7017438,0.002815916,0.0004974928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02927609,0.00007157617,0.9615514,0.0006485683,0.0008638747,0.0001302678,0.000002348104,0.0001885403,0.00726731],"genre_scores_gemma":[0.7800155,0.000007776627,0.2193099,0.000567137,0.00005161818,0.000005289663,3.190951e-7,0.000005482298,0.00003700363],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7507393,"threshold_uncertainty_score":0.9991333,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01524176298733106,"score_gpt":0.2384091294070576,"score_spread":0.2231673664197265,"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."}}