{"id":"W2004012902","doi":"10.1145/780542.780629","title":"A new multilayered PCP and the hardness of hypergraph vertex cover","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Environment and Climate Change Canada","keywords":"Hypergraph; Cover (algebra); Vertex (graph theory); Vertex cover; Edge cover; Computer science; Combinatorics; Mathematics; Algorithm; Theoretical computer science; Engineering; Approximation algorithm; Graph; Mechanical engineering","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.001169373,0.0003927145,0.0008256646,0.0008609704,0.001201779,0.002505704,0.001694428,0.001412573,0.004378406],"category_scores_gemma":[0.01001541,0.0006440799,0.000926354,0.00166494,0.001978677,0.007507447,0.004929562,0.00266228,0.0005015809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002008073,"about_ca_system_score_gemma":0.00145833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002952025,"about_ca_topic_score_gemma":0.002307147,"domain_scores_codex":[0.9973648,0.0004299952,0.0001608903,0.0006755056,0.0008821842,0.0004866837],"domain_scores_gemma":[0.9916942,0.003884872,0.000918131,0.002358334,0.0006784293,0.000466102],"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.001439986,0.000256692,0.01012765,0.0005999134,0.0001561481,0.000859576,0.0007686961,0.220233,0.04253287,0.5456842,0.01103855,0.1663028],"study_design_scores_gemma":[0.0001267723,0.0002993674,0.003231024,0.00008928961,0.00009062352,0.001335917,0.0001976039,0.6320621,0.02549211,0.3273273,0.00963444,0.0001135218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3316674,0.0007690124,0.6481904,0.00235732,0.00006995133,0.0001446018,0.001416913,0.00130631,0.014078],"genre_scores_gemma":[0.8959808,0.0003860997,0.09949016,0.0003105652,0.00007672138,0.0001239422,0.0007416,0.0001032226,0.002786988],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004378406,"threshold_uncertainty_score":0.01464725,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01256467607444679,"score_gpt":0.2133160636748331,"score_spread":0.2007513876003863,"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."}}