{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000414434,0.0001419834,0.0003470977,0.0002688521,0.0001625657,0.00008337833,0.001221217,0.00009158616,0.000136866],"category_scores_gemma":[0.00008370256,0.0001159667,0.000186977,0.0003179841,0.0002797136,0.0002914435,0.0001511911,0.0004171486,0.00003320772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004129353,"about_ca_system_score_gemma":0.0000975205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008032502,"about_ca_topic_score_gemma":0.000007001829,"domain_scores_codex":[0.9985569,0.0001003465,0.0004707496,0.0001983975,0.000352235,0.0003214307],"domain_scores_gemma":[0.9987884,0.0001489453,0.0003570909,0.0003583857,0.000187999,0.000159174],"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.00009872025,0.000330788,0.009560293,0.000008125099,0.0000889174,0.0005034669,0.0002919684,0.0001506345,0.0006368142,0.9460161,0.01566987,0.02664435],"study_design_scores_gemma":[0.001182005,0.001365341,0.09432337,0.00004044304,0.00001910984,0.004607395,0.00001994241,0.0193007,0.0005661686,0.7743759,0.1039377,0.0002619066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6104856,0.0003542304,0.3729003,0.009308256,0.002320121,0.00007013597,0.000002830259,0.00006783492,0.004490729],"genre_scores_gemma":[0.7084529,0.0001883422,0.2874211,0.002622132,0.001096937,0.000002548163,0.000001837806,0.00001347409,0.0002007782],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1716402,"threshold_uncertainty_score":0.4728986,"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."}}