{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HSY4GQV22DHAKCUCSGPUKLMMVJ","short_pith_number":"pith:HSY4GQV2","schema_version":"1.0","canonical_sha256":"3cb1c342bad0ce050a82919f452d8caa604235f51e5d2bbee03de6fff345628b","source":{"kind":"arxiv","id":"1503.00753","version":2},"attestation_state":"computed","paper":{"title":"No Small Linear Program Approximates Vertex Cover within a Factor $2 - \\epsilon$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Abbas Bazzi, Ola Svensson, Samuel Fiorini, Sebastian Pokutta","submitted_at":"2015-03-02T21:26:23Z","abstract_excerpt":"The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev (2003) proved that the problem is NP-hard to approximate within a factor $2 - \\epsilon$, assuming the Unique Games Conjecture (UGC). This is tight because the problem has an easy 2-approximation algorithm. Without resorting to the UGC, the best inapproximability result for the problem is due to Dinur and Safra (2002): vertex cover is NP-hard to approximate within a factor 1.3606. We prove the following unconditional result about linear programming (LP) relaxations o"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1503.00753","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-02T21:26:23Z","cross_cats_sorted":[],"title_canon_sha256":"3014c2a1fae31af235f81ce2df0a4393c9c8eea3b1abba2972d0904be83a1921","abstract_canon_sha256":"031e8ca8de4c73779519d6943d93da96eff1d9d498e13d07dc42ec3bbc8db2a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:55.472204Z","signature_b64":"OPOm2yqQAIkKXvP7JbynZyTBb7g8dnrRKuCwMHc0WgWj6O1d+hESnVkQeE9Ytf8oSr/lEgD4elodK7RtDo9oCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cb1c342bad0ce050a82919f452d8caa604235f51e5d2bbee03de6fff345628b","last_reissued_at":"2026-05-18T01:25:55.471624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:55.471624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"No Small Linear Program Approximates Vertex Cover within a Factor $2 - \\epsilon$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Abbas Bazzi, Ola Svensson, Samuel Fiorini, Sebastian Pokutta","submitted_at":"2015-03-02T21:26:23Z","abstract_excerpt":"The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev (2003) proved that the problem is NP-hard to approximate within a factor $2 - \\epsilon$, assuming the Unique Games Conjecture (UGC). This is tight because the problem has an easy 2-approximation algorithm. Without resorting to the UGC, the best inapproximability result for the problem is due to Dinur and Safra (2002): vertex cover is NP-hard to approximate within a factor 1.3606. We prove the following unconditional result about linear programming (LP) relaxations o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00753","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.00753","created_at":"2026-05-18T01:25:55.471700+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.00753v2","created_at":"2026-05-18T01:25:55.471700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00753","created_at":"2026-05-18T01:25:55.471700+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSY4GQV22DHA","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSY4GQV22DHAKCUC","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSY4GQV2","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HSY4GQV22DHAKCUCSGPUKLMMVJ","json":"https://pith.science/pith/HSY4GQV22DHAKCUCSGPUKLMMVJ.json","graph_json":"https://pith.science/api/pith-number/HSY4GQV22DHAKCUCSGPUKLMMVJ/graph.json","events_json":"https://pith.science/api/pith-number/HSY4GQV22DHAKCUCSGPUKLMMVJ/events.json","paper":"https://pith.science/paper/HSY4GQV2"},"agent_actions":{"view_html":"https://pith.science/pith/HSY4GQV22DHAKCUCSGPUKLMMVJ","download_json":"https://pith.science/pith/HSY4GQV22DHAKCUCSGPUKLMMVJ.json","view_paper":"https://pith.science/paper/HSY4GQV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.00753&json=true","fetch_graph":"https://pith.science/api/pith-number/HSY4GQV22DHAKCUCSGPUKLMMVJ/graph.json","fetch_events":"https://pith.science/api/pith-number/HSY4GQV22DHAKCUCSGPUKLMMVJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSY4GQV22DHAKCUCSGPUKLMMVJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSY4GQV22DHAKCUCSGPUKLMMVJ/action/storage_attestation","attest_author":"https://pith.science/pith/HSY4GQV22DHAKCUCSGPUKLMMVJ/action/author_attestation","sign_citation":"https://pith.science/pith/HSY4GQV22DHAKCUCSGPUKLMMVJ/action/citation_signature","submit_replication":"https://pith.science/pith/HSY4GQV22DHAKCUCSGPUKLMMVJ/action/replication_record"}},"created_at":"2026-05-18T01:25:55.471700+00:00","updated_at":"2026-05-18T01:25:55.471700+00:00"}