{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001271426,0.0006746327,0.0009386457,0.000660361,0.0006836349,0.0007994912,0.001741522,0.0005222992,0.000005252267],"category_scores_gemma":[0.0002218015,0.0006592574,0.000471516,0.0005524405,0.0003837053,0.001099899,0.002185241,0.0006796125,0.000004383841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001131257,"about_ca_system_score_gemma":0.0001803372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001023778,"about_ca_topic_score_gemma":0.0000328589,"domain_scores_codex":[0.9961085,0.00004276357,0.001764145,0.0006880589,0.0005626291,0.0008339088],"domain_scores_gemma":[0.995544,0.0004944075,0.001276445,0.001325271,0.001159674,0.000200206],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002002244,0.004093348,0.0255831,0.05370251,0.004200562,0.00002488038,0.06060786,0.008588837,0.001490684,0.1602477,0.0061861,0.6732721],"study_design_scores_gemma":[0.002678161,0.0009317487,0.001500153,0.001766232,0.0001442589,0.0001233704,0.0002814784,0.8492724,0.001350726,0.1307948,0.009797125,0.001359519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1356328,0.0001038453,0.8566619,0.0001067827,0.004333982,0.001780124,0.0006388837,0.0002519781,0.000489647],"genre_scores_gemma":[0.4525936,0.00005678835,0.5455556,0.0003739625,0.0004245012,0.0003700306,0.000482606,0.00008430587,0.00005859419],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8406836,"threshold_uncertainty_score":0.9995859,"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."}}