{"id":"W2135134090","doi":"","title":"Uniform Hardness Amplification in NP via Monotone Codes","year":2006,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monotone polygon; Mathematics; Decoding methods; Lemma (botany); Code (set theory); Discrete mathematics; Combinatorics; Algorithm; Computer science","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.000680235,0.0003556739,0.0004020857,0.0005071727,0.0004368687,0.0002432389,0.001188435,0.0001033388,0.00005512593],"category_scores_gemma":[0.00002470098,0.0003973794,0.0001534438,0.001694209,0.0002227797,0.000470084,0.0002231677,0.0005119352,0.000102185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006826065,"about_ca_system_score_gemma":0.0003928824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006731771,"about_ca_topic_score_gemma":0.001302467,"domain_scores_codex":[0.9966487,0.0002089679,0.0006617025,0.0008427028,0.0007893735,0.0008485958],"domain_scores_gemma":[0.9984716,0.0003492686,0.0002301124,0.0006126887,0.0002347586,0.0001015244],"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.00005266789,0.0005127116,0.000635098,0.0000120833,0.00001713077,0.000008171767,0.00006579532,0.04185895,0.000123256,0.9523449,0.000854122,0.003515134],"study_design_scores_gemma":[0.0007097548,0.0001639966,0.04500647,0.00001296874,0.000003273504,0.00002727117,0.000005333489,0.385709,0.0001941022,0.5643404,0.003519182,0.0003083122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06804111,0.0001221786,0.9243793,0.002691805,0.0003749483,0.0005906581,0.00002575595,0.0003775406,0.003396668],"genre_scores_gemma":[0.9703081,0.000005503134,0.02853455,0.000510959,0.0001360229,0.00008913966,0.0001938543,0.00002041825,0.0002014427],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.902267,"threshold_uncertainty_score":0.9998478,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01916991826963298,"score_gpt":0.2556825115246827,"score_spread":0.2365125932550498,"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."}}