{"id":"W2798438706","doi":"10.4230/lipics.itcs.2019.52","title":"Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Property testing; Omega; Combinatorics; Discrete mathematics; Computer science; Computerized adaptive testing; Graph; Sampling (signal processing); Mathematics; Theoretical computer science; Statistics; Physics","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.008073893,0.003541519,0.002799581,0.002620952,0.00214259,0.008084303,0.008187771,0.003340291,0.0141945],"category_scores_gemma":[0.05898667,0.001629086,0.005581802,0.002667116,0.005067571,0.02092438,0.007840766,0.01025243,0.003205374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00491083,"about_ca_system_score_gemma":0.00419466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003853203,"about_ca_topic_score_gemma":0.004588745,"domain_scores_codex":[0.9755004,0.007084087,0.001358102,0.003957558,0.008044144,0.004055669],"domain_scores_gemma":[0.8787178,0.0878014,0.004509959,0.02104604,0.004772265,0.003152497],"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.004498348,0.002082523,0.01899146,0.001566244,0.0006523716,0.0009831176,0.001575679,0.2738943,0.04665911,0.43255,0.03108723,0.1854598],"study_design_scores_gemma":[0.0002202852,0.0003505421,0.001436405,0.00008133666,0.000268064,0.0004469815,0.0002650111,0.6590087,0.01119988,0.3226568,0.00397448,0.00009160393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1190471,0.001471077,0.8340054,0.006877303,0.0002592829,0.0005841235,0.0019856,0.005904899,0.02986517],"genre_scores_gemma":[0.7935644,0.000803043,0.1821369,0.003365974,0.0008531628,0.001304369,0.005001999,0.002258081,0.01071193],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0141945,"threshold_uncertainty_score":0.04748529,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05371484341486307,"score_gpt":0.2932243015742734,"score_spread":0.2395094581594103,"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."}}