{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HSY4GQV22DHAKCUCSGPUKLMMVJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"031e8ca8de4c73779519d6943d93da96eff1d9d498e13d07dc42ec3bbc8db2a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-02T21:26:23Z","title_canon_sha256":"3014c2a1fae31af235f81ce2df0a4393c9c8eea3b1abba2972d0904be83a1921"},"schema_version":"1.0","source":{"id":"1503.00753","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00753","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00753v2","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00753","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"pith_short_12","alias_value":"HSY4GQV22DHA","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HSY4GQV22DHAKCUC","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HSY4GQV2","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:e1797b024c05f703d73a7e19633c91b591a5ec616d67aac67a8d97696109f500","target":"graph","created_at":"2026-05-18T01:25:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Abbas Bazzi, Ola Svensson, Samuel Fiorini, Sebastian Pokutta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-02T21:26:23Z","title":"No Small Linear Program Approximates Vertex Cover within a Factor $2 - \\epsilon$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00753","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2120ec2c9c7d74245c597e5683ffe1edaeb3b36a4e5cdcca8a4497138b278b7f","target":"record","created_at":"2026-05-18T01:25:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"031e8ca8de4c73779519d6943d93da96eff1d9d498e13d07dc42ec3bbc8db2a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-02T21:26:23Z","title_canon_sha256":"3014c2a1fae31af235f81ce2df0a4393c9c8eea3b1abba2972d0904be83a1921"},"schema_version":"1.0","source":{"id":"1503.00753","kind":"arxiv","version":2}},"canonical_sha256":"3cb1c342bad0ce050a82919f452d8caa604235f51e5d2bbee03de6fff345628b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cb1c342bad0ce050a82919f452d8caa604235f51e5d2bbee03de6fff345628b","first_computed_at":"2026-05-18T01:25:55.471624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:55.471624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OPOm2yqQAIkKXvP7JbynZyTBb7g8dnrRKuCwMHc0WgWj6O1d+hESnVkQeE9Ytf8oSr/lEgD4elodK7RtDo9oCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:55.472204Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00753","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2120ec2c9c7d74245c597e5683ffe1edaeb3b36a4e5cdcca8a4497138b278b7f","sha256:e1797b024c05f703d73a7e19633c91b591a5ec616d67aac67a8d97696109f500"],"state_sha256":"140d27bf645fea48c9769c30b2d287c32b98d7d6fb1021ad527eb15d41fe1654"}