{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HSY4GQV22DHAKCUCSGPUKLMMVJ","short_pith_number":"pith:HSY4GQV2","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"},"canonical_sha256":"3cb1c342bad0ce050a82919f452d8caa604235f51e5d2bbee03de6fff345628b","source":{"kind":"arxiv","id":"1503.00753","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HSY4GQV22DHAKCUCSGPUKLMMVJ","target":"record","payload":{"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"},"canonical_sha256":"3cb1c342bad0ce050a82919f452d8caa604235f51e5d2bbee03de6fff345628b","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"},"source_kind":"arxiv","source_id":"1503.00753","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:25:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T26zWZbxCzJmQlTo5cK5LYJM3o6hpYMTCPuTMZwUDmjr2y+nmXI2CSJfAa5ZRaUddvpurlRsWKr8se+wZtyzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T23:31:46.360921Z"},"content_sha256":"2120ec2c9c7d74245c597e5683ffe1edaeb3b36a4e5cdcca8a4497138b278b7f","schema_version":"1.0","event_id":"sha256:2120ec2c9c7d74245c597e5683ffe1edaeb3b36a4e5cdcca8a4497138b278b7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HSY4GQV22DHAKCUCSGPUKLMMVJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:25:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pjuTqVvXdICiKVjL3gABqnRdRR/UidwBv0u22xYaWLCkgQEEdlHWbOZbWplHBYl/Whs5kDJcrz3pzJd6gaJxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T23:31:46.361621Z"},"content_sha256":"e1797b024c05f703d73a7e19633c91b591a5ec616d67aac67a8d97696109f500","schema_version":"1.0","event_id":"sha256:e1797b024c05f703d73a7e19633c91b591a5ec616d67aac67a8d97696109f500"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HSY4GQV22DHAKCUCSGPUKLMMVJ/bundle.json","state_url":"https://pith.science/pith/HSY4GQV22DHAKCUCSGPUKLMMVJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HSY4GQV22DHAKCUCSGPUKLMMVJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-23T23:31:46Z","links":{"resolver":"https://pith.science/pith/HSY4GQV22DHAKCUCSGPUKLMMVJ","bundle":"https://pith.science/pith/HSY4GQV22DHAKCUCSGPUKLMMVJ/bundle.json","state":"https://pith.science/pith/HSY4GQV22DHAKCUCSGPUKLMMVJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HSY4GQV22DHAKCUCSGPUKLMMVJ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oyKoFcyJOfrqw4S9OJOu/JRiuC4keujRml4sOMerTtZL7vWOLGN+fArKqqjfOJ2NmD6cbsr1KOPcRC43LhGYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T23:31:46.364658Z","bundle_sha256":"0bd0f8e86514344a844cc705a54b24ecaaf2bb319703082483429fd20c2b5532"}}