{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002932367,0.001301099,0.001491323,0.001511429,0.001439412,0.003373315,0.002784259,0.001625033,0.006072147],"category_scores_gemma":[0.02701009,0.0008436812,0.001674005,0.001483326,0.004535548,0.01016098,0.006800423,0.00773757,0.001004636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003089268,"about_ca_system_score_gemma":0.001313507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001164818,"about_ca_topic_score_gemma":0.0007905342,"domain_scores_codex":[0.9924647,0.001535091,0.0002597824,0.001474368,0.002995202,0.001270959],"domain_scores_gemma":[0.9698703,0.02237568,0.001105752,0.004570398,0.001382524,0.0006953151],"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.0006484613,0.0002288328,0.002420657,0.0005935318,0.00009720647,0.0004524262,0.0009293665,0.1751693,0.01694307,0.7296311,0.004552728,0.06833313],"study_design_scores_gemma":[0.00006268809,0.0001473692,0.0004801897,0.00004732094,0.00003838758,0.0003419562,0.0001079766,0.3543281,0.01160844,0.6278724,0.00491664,0.0000483969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1621212,0.0008232406,0.7902309,0.003622302,0.0001213219,0.0002312234,0.0005389304,0.001661796,0.04064913],"genre_scores_gemma":[0.8898072,0.0006289134,0.09935071,0.0008172281,0.0003379909,0.000443971,0.0004427432,0.0003946276,0.007776632],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006072147,"threshold_uncertainty_score":0.02241427,"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."}}