{"id":"W2810174119","doi":"10.4230/lipics.approx-random.2018.46","title":"Satisfiability and Derandomization for Small Polynomial Threshold Circuits","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Satisfiability; Mathematics; Polynomial; Computer science; Algorithm; Discrete mathematics; Combinatorics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004344426,0.001190021,0.001739541,0.001008989,0.001361222,0.003701549,0.002642713,0.001752387,0.006941235],"category_scores_gemma":[0.03412878,0.0006981056,0.002669673,0.001182972,0.003556051,0.007855547,0.004078405,0.005943125,0.0009447644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005406523,"about_ca_system_score_gemma":0.003787283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002751859,"about_ca_topic_score_gemma":0.003181865,"domain_scores_codex":[0.9936749,0.002280925,0.0003370556,0.001696057,0.001058045,0.0009529953],"domain_scores_gemma":[0.9621876,0.02941003,0.001645318,0.004604921,0.001288238,0.0008638938],"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.001149047,0.0002344554,0.004808417,0.0005952848,0.000272322,0.0002965773,0.0006195481,0.2694068,0.01756441,0.6563132,0.007992702,0.04074715],"study_design_scores_gemma":[0.0001631518,0.00008774851,0.0005469156,0.00004837802,0.0001020794,0.00009818075,0.00006712243,0.6167107,0.005726524,0.3737628,0.002649589,0.00003682438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2634573,0.001181602,0.7057559,0.006774299,0.0001925729,0.0003956857,0.001426687,0.00286565,0.01795027],"genre_scores_gemma":[0.8976091,0.0006416094,0.08778442,0.001337521,0.0002541541,0.0006229791,0.001328237,0.0006345682,0.009787485],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006941235,"threshold_uncertainty_score":0.03922731,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01763009642003235,"score_gpt":0.2425703575303442,"score_spread":0.2249402611103118,"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."}}