{"id":"W1899845837","doi":"10.1007/s00145-001-0007-6","title":"Complexity Bounds on General Hard-Core Predicates","year":2001,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Kungliga Tekniska Högskolan; McGill University; University of Texas at Austin; National Science Foundation","keywords":"Predicate (mathematical logic); Boolean function; Mathematics; Discrete mathematics; Combinatorics; Monotone polygon; Core (optical fiber); Hard core; Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007107592,0.002933419,0.004481378,0.005472562,0.005175658,0.01317008,0.007371981,0.0048081,0.02484987],"category_scores_gemma":[0.05425226,0.002413259,0.00420678,0.007029257,0.007771983,0.05077597,0.01197381,0.01656541,0.003371576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01009452,"about_ca_system_score_gemma":0.005678485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003426607,"about_ca_topic_score_gemma":0.004804506,"domain_scores_codex":[0.9899477,0.001691599,0.0003417106,0.001819107,0.003058449,0.003141305],"domain_scores_gemma":[0.8814443,0.09748183,0.002768735,0.01092782,0.003502838,0.003874368],"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.001876189,0.0005793921,0.002526909,0.000844852,0.00016258,0.0001871095,0.000634103,0.04786864,0.003769042,0.8727549,0.03035945,0.03843694],"study_design_scores_gemma":[0.0001122837,0.00005627521,0.0005465802,0.00006934298,0.0001052531,0.0001179037,0.0001034532,0.06271227,0.001514602,0.9306458,0.003974524,0.00004168643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2509044,0.009193669,0.4686143,0.03648305,0.001347254,0.0008315144,0.00553838,0.003550624,0.2235367],"genre_scores_gemma":[0.8799818,0.006183045,0.07145858,0.004866468,0.003011127,0.000804243,0.004954849,0.002575551,0.02616437],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02484987,"threshold_uncertainty_score":0.08313107,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08349018298500696,"score_gpt":0.3071145670270946,"score_spread":0.2236243840420876,"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."}}