{"id":"W2047406446","doi":"10.1016/j.tcs.2012.02.017","title":"On derandomization and average-case complexity of monotone functions","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Indiana State University; Cisco Systems; National Science Foundation","keywords":"Mathematics; Monotone polygon; Combinatorics; Discrete mathematics; Algorithm; Geometry","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.00120869,0.0001390337,0.000203819,0.0002071333,0.0005151019,0.000143807,0.0006264358,0.00003492694,0.00004263349],"category_scores_gemma":[0.00009155228,0.0001155894,0.00005248766,0.0008344808,0.003644311,0.0006954171,0.0005938944,0.0001436284,0.00001654882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002205349,"about_ca_system_score_gemma":0.00003062135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005742068,"about_ca_topic_score_gemma":4.85803e-7,"domain_scores_codex":[0.9984624,0.0001233736,0.0002421171,0.0003765647,0.0003993665,0.0003961362],"domain_scores_gemma":[0.9985861,0.0004144438,0.00007181494,0.000537854,0.0001246726,0.0002651055],"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.00001789633,0.000130695,0.0000519698,0.000006126922,0.000003945373,0.000007501029,0.0004093466,0.0002499354,0.00005776737,0.9810519,0.00001985425,0.01799307],"study_design_scores_gemma":[0.0005153971,0.0001509318,0.0007283728,0.00001440307,0.000004535765,0.0003599477,0.000004941593,0.6780158,0.000922486,0.3191299,0.00002118915,0.000132152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1230904,0.00002493305,0.8747119,0.0002748324,0.0007386296,0.0001456647,0.000003098396,0.00008105444,0.0009295612],"genre_scores_gemma":[0.7976159,0.000001694387,0.2020823,0.0001931798,0.00009576371,0.000004006636,5.511032e-7,0.000003334263,0.000003172315],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6777658,"threshold_uncertainty_score":0.9990672,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02453344038941696,"score_gpt":0.2574787342536359,"score_spread":0.232945293864219,"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."}}