{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001110742,0.0002987169,0.000371468,0.0002166193,0.0006060899,0.0005320938,0.0007609683,0.0001773335,0.00001191718],"category_scores_gemma":[0.0001643732,0.0002732012,0.0002184632,0.0002895079,0.0002485523,0.001172075,0.0002885085,0.0001596434,0.00001519851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004485928,"about_ca_system_score_gemma":0.00005604315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006187348,"about_ca_topic_score_gemma":0.00003349637,"domain_scores_codex":[0.9980929,0.00004076844,0.0007429793,0.0003420656,0.0002099251,0.0005713812],"domain_scores_gemma":[0.9982163,0.0003209298,0.0002789657,0.0006788391,0.000323818,0.000181164],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002295843,0.0008774294,0.04477056,0.001891216,0.0006328666,0.000002475124,0.04263821,0.00008866378,0.0008917892,0.4987663,0.01199825,0.3951464],"study_design_scores_gemma":[0.05979907,0.004598329,0.01451838,0.000522645,0.0003185226,0.0001933284,0.00124553,0.5740916,0.01315806,0.1520152,0.1758371,0.003702214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2969858,0.0000309947,0.698628,0.0002340452,0.0008469369,0.001374246,0.0001329676,0.0001975958,0.001569404],"genre_scores_gemma":[0.9673737,0.0000108645,0.03101357,0.00097307,0.0002998686,0.0001696606,0.00008815261,0.00002313823,0.00004797384],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6703879,"threshold_uncertainty_score":0.999972,"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."}}