{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000795874,0.0001485932,0.0002693866,0.000140856,0.0003825576,0.0002375645,0.000824835,0.00004063757,0.00001882173],"category_scores_gemma":[0.00007640564,0.00009993884,0.0001626922,0.0003454465,0.0001157707,0.0002501691,0.0002712994,0.0004158285,0.00001183896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002123993,"about_ca_system_score_gemma":0.00007559163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001493027,"about_ca_topic_score_gemma":0.000002262634,"domain_scores_codex":[0.998602,0.000147807,0.000385473,0.0002156125,0.0003831175,0.0002660073],"domain_scores_gemma":[0.9987816,0.0004243081,0.0002586841,0.0003030712,0.00009092391,0.0001413725],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008969784,0.0001002807,0.0004089158,0.00001449836,0.0001004106,0.00001848774,0.00281376,0.008232299,0.0001718517,0.09154362,0.003742405,0.8927638],"study_design_scores_gemma":[0.004414647,0.0001601363,0.006297261,0.0002292112,0.0000143183,0.0005089557,0.00006848777,0.9590788,0.0005810185,0.012765,0.01562415,0.0002579709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1417131,0.00126804,0.8469383,0.006034161,0.001825886,0.0001897839,0.000001351684,0.00008344001,0.001945971],"genre_scores_gemma":[0.9210244,0.00005518919,0.07773907,0.0007216384,0.0003526474,2.843746e-7,9.590089e-8,0.000007383566,0.00009923877],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9508466,"threshold_uncertainty_score":0.4075387,"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."}}