{"id":"W2115404728","doi":"10.1137/s0097539704443057","title":"A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Environment and Climate Change Canada","keywords":"Hypergraph; Combinatorics; Vertex cover; Mathematics; Cover (algebra); Vertex (graph theory); Hardness of approximation; Constant (computer programming); Combinatorial proof; Discrete mathematics; Code (set theory); Approximation algorithm; Graph; Computer science; Set (abstract data type)","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.001820087,0.0005239265,0.0009393329,0.001206568,0.001425262,0.003143008,0.002303002,0.001524575,0.006289759],"category_scores_gemma":[0.01662952,0.0009467838,0.00148973,0.001657746,0.00254118,0.009352597,0.005460059,0.003825418,0.0006529469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002711235,"about_ca_system_score_gemma":0.002153759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003363526,"about_ca_topic_score_gemma":0.003055898,"domain_scores_codex":[0.9961893,0.0006205583,0.0001986168,0.0009937007,0.001399134,0.0005987295],"domain_scores_gemma":[0.9862385,0.007534175,0.001345482,0.003265189,0.0009943921,0.0006222909],"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.00120546,0.000289639,0.008078534,0.0008257068,0.0002172603,0.0008644548,0.0007667934,0.1840987,0.03292281,0.6143765,0.01203282,0.1443212],"study_design_scores_gemma":[0.0001426292,0.000216201,0.002381001,0.0001209071,0.0001228765,0.0009913022,0.0001328629,0.5431622,0.0201774,0.4232664,0.00916701,0.0001193782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.207773,0.0009128733,0.7666709,0.004090214,0.0001076346,0.0001954789,0.001514985,0.001656332,0.01707857],"genre_scores_gemma":[0.8306049,0.0005940212,0.1628971,0.0006095628,0.0001773886,0.0001775573,0.0008883076,0.0001863296,0.003864762],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006289759,"threshold_uncertainty_score":0.02104133,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01418656009218223,"score_gpt":0.2435712217290283,"score_spread":0.2293846616368461,"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."}}