{"id":"W2914834722","doi":"10.1145/3305270","title":"Distribution Testing Lower Bounds via Reductions from Communication Complexity","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical proof; Mathematics; Simple (philosophy); Measure (data warehouse); Connection (principal bundle); Distribution (mathematics); Upper and lower bounds; Property testing; Reduction (mathematics); Communication complexity; Identity (music); Discrete mathematics; Interpolation (computer graphics); Operator (biology); Sample (material); Combinatorics; Computer science; Mathematical analysis","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005058676,0.0002249425,0.0002182623,0.0001616413,0.0008476854,0.0002500356,0.001174065,0.0001022252,0.000210706],"category_scores_gemma":[0.00007184614,0.0002488394,0.0001473752,0.0009757881,0.0002204749,0.0007730895,0.00005939778,0.0004494766,0.0003787909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001501686,"about_ca_system_score_gemma":0.00006768842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001637907,"about_ca_topic_score_gemma":0.00002003737,"domain_scores_codex":[0.9980136,0.0004304959,0.0004012464,0.0005329894,0.0003515001,0.0002702368],"domain_scores_gemma":[0.9965017,0.001522754,0.0001820522,0.001436879,0.0002558208,0.0001007619],"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.00009878689,0.0009836112,0.0001400305,0.00002085104,0.0001650853,0.000003138363,0.001120692,0.04960777,0.0008150174,0.206019,0.0002533904,0.7407726],"study_design_scores_gemma":[0.0005131739,0.0001567009,0.005327256,0.00005920656,0.00002476291,0.0000176877,0.0001109056,0.2268593,0.0006589305,0.7652123,0.0007460005,0.0003137769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04007465,0.00005521957,0.9558597,0.001121269,0.00119382,0.0003061208,0.00008833563,0.0005369984,0.0007638394],"genre_scores_gemma":[0.8160328,0.000007046086,0.1833197,0.0002262986,0.00004291502,0.00002676579,0.0001824296,0.00001471957,0.0001472379],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7759582,"threshold_uncertainty_score":0.9999964,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03901239018548829,"score_gpt":0.2696844975486102,"score_spread":0.2306721073631219,"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."}}