{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TVTJXWT2DBOAWQP7B44LSUOMMR","short_pith_number":"pith:TVTJXWT2","canonical_record":{"source":{"id":"1204.5489","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-24T20:12:25Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bb34533a70548c72258e93f743a993fb800006d92817dbfd2a0bf97575e03be1","abstract_canon_sha256":"eba3338e642d5d86a31b1fc14cc6b08fe83c79b8a7d09ad2c7d7cd0b3431d14a"},"schema_version":"1.0"},"canonical_sha256":"9d669bda7a185c0b41ff0f38b951cc646ea753ba2d5a656b4b875e4cf91a1c08","source":{"kind":"arxiv","id":"1204.5489","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5489","created_at":"2026-05-18T03:42:23Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5489v2","created_at":"2026-05-18T03:42:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5489","created_at":"2026-05-18T03:42:23Z"},{"alias_kind":"pith_short_12","alias_value":"TVTJXWT2DBOA","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TVTJXWT2DBOAWQP7","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TVTJXWT2","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TVTJXWT2DBOAWQP7B44LSUOMMR","target":"record","payload":{"canonical_record":{"source":{"id":"1204.5489","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-24T20:12:25Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bb34533a70548c72258e93f743a993fb800006d92817dbfd2a0bf97575e03be1","abstract_canon_sha256":"eba3338e642d5d86a31b1fc14cc6b08fe83c79b8a7d09ad2c7d7cd0b3431d14a"},"schema_version":"1.0"},"canonical_sha256":"9d669bda7a185c0b41ff0f38b951cc646ea753ba2d5a656b4b875e4cf91a1c08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:23.821987Z","signature_b64":"91EGZHNh70Q3f/t7qHNhRTW2VTRKFHRI5ykAqBexkPnunlwI7EC9BFdJa4VH99PBSLvA41p15O6pY2sD1NfdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d669bda7a185c0b41ff0f38b951cc646ea753ba2d5a656b4b875e4cf91a1c08","last_reissued_at":"2026-05-18T03:42:23.821124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:23.821124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.5489","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-18T03:42:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QPDQVYic9xqSWoDlh7VXKn7don6o6O/ACXbKysBiKT5ONvgT1drce0i3aPWf1siR0Inx0twBB56HS+TU4E+0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:48:51.359139Z"},"content_sha256":"05e5e4e0e454d0ea77c533b445d9148616031c3e9c84b2f11afc01479d716d55","schema_version":"1.0","event_id":"sha256:05e5e4e0e454d0ea77c533b445d9148616031c3e9c84b2f11afc01479d716d55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TVTJXWT2DBOAWQP7B44LSUOMMR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Eden Chlamtac, Konstantinos Georgiou, Zac Friggstad","submitted_at":"2012-04-24T20:12:25Z","abstract_excerpt":"Recently, Cygan, Kowalik, and Wykurz [IPL 2009] gave sub-exponential-time approximation algorithms for the Set-Cover problem with approximation ratios better than ln(n). In light of this result, it is natural to ask whether such improvements can be achieved using lift-and-project methods. We present a simpler combinatorial algorithm which has nearly the same time-approximation tradeoff as the algorithm of Cygan et al., and which lends itself naturally to a lift-and-project based approach.\n  At a high level, our approach is similar to the recent work of Karlin, Mathieu, and Nguyen [IPCO 2011], "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5489","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-18T03:42:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eADRDmovhX/dF31vvcgF19+PhbDwTrE5iz3+gWpontwKmPC01ZvlVTXgNkHUIdrWVpmDIzF+Le0ZbmEem0rGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:48:51.359509Z"},"content_sha256":"3a28381efb3f7d743a96b4666e0f6abc15695a779fe905e8dcf4491147024de3","schema_version":"1.0","event_id":"sha256:3a28381efb3f7d743a96b4666e0f6abc15695a779fe905e8dcf4491147024de3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TVTJXWT2DBOAWQP7B44LSUOMMR/bundle.json","state_url":"https://pith.science/pith/TVTJXWT2DBOAWQP7B44LSUOMMR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TVTJXWT2DBOAWQP7B44LSUOMMR/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-30T08:48:51Z","links":{"resolver":"https://pith.science/pith/TVTJXWT2DBOAWQP7B44LSUOMMR","bundle":"https://pith.science/pith/TVTJXWT2DBOAWQP7B44LSUOMMR/bundle.json","state":"https://pith.science/pith/TVTJXWT2DBOAWQP7B44LSUOMMR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TVTJXWT2DBOAWQP7B44LSUOMMR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TVTJXWT2DBOAWQP7B44LSUOMMR","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":"eba3338e642d5d86a31b1fc14cc6b08fe83c79b8a7d09ad2c7d7cd0b3431d14a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-24T20:12:25Z","title_canon_sha256":"bb34533a70548c72258e93f743a993fb800006d92817dbfd2a0bf97575e03be1"},"schema_version":"1.0","source":{"id":"1204.5489","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.5489","created_at":"2026-05-18T03:42:23Z"},{"alias_kind":"arxiv_version","alias_value":"1204.5489v2","created_at":"2026-05-18T03:42:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5489","created_at":"2026-05-18T03:42:23Z"},{"alias_kind":"pith_short_12","alias_value":"TVTJXWT2DBOA","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TVTJXWT2DBOAWQP7","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TVTJXWT2","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:3a28381efb3f7d743a96b4666e0f6abc15695a779fe905e8dcf4491147024de3","target":"graph","created_at":"2026-05-18T03:42:23Z","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":"Recently, Cygan, Kowalik, and Wykurz [IPL 2009] gave sub-exponential-time approximation algorithms for the Set-Cover problem with approximation ratios better than ln(n). In light of this result, it is natural to ask whether such improvements can be achieved using lift-and-project methods. We present a simpler combinatorial algorithm which has nearly the same time-approximation tradeoff as the algorithm of Cygan et al., and which lends itself naturally to a lift-and-project based approach.\n  At a high level, our approach is similar to the recent work of Karlin, Mathieu, and Nguyen [IPCO 2011], ","authors_text":"Eden Chlamtac, Konstantinos Georgiou, Zac Friggstad","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-24T20:12:25Z","title":"Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5489","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:05e5e4e0e454d0ea77c533b445d9148616031c3e9c84b2f11afc01479d716d55","target":"record","created_at":"2026-05-18T03:42:23Z","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":"eba3338e642d5d86a31b1fc14cc6b08fe83c79b8a7d09ad2c7d7cd0b3431d14a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-24T20:12:25Z","title_canon_sha256":"bb34533a70548c72258e93f743a993fb800006d92817dbfd2a0bf97575e03be1"},"schema_version":"1.0","source":{"id":"1204.5489","kind":"arxiv","version":2}},"canonical_sha256":"9d669bda7a185c0b41ff0f38b951cc646ea753ba2d5a656b4b875e4cf91a1c08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d669bda7a185c0b41ff0f38b951cc646ea753ba2d5a656b4b875e4cf91a1c08","first_computed_at":"2026-05-18T03:42:23.821124Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:23.821124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"91EGZHNh70Q3f/t7qHNhRTW2VTRKFHRI5ykAqBexkPnunlwI7EC9BFdJa4VH99PBSLvA41p15O6pY2sD1NfdBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:23.821987Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.5489","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05e5e4e0e454d0ea77c533b445d9148616031c3e9c84b2f11afc01479d716d55","sha256:3a28381efb3f7d743a96b4666e0f6abc15695a779fe905e8dcf4491147024de3"],"state_sha256":"adcaf4315dc7080bbd9c9d838b96d7e44da98ca3f35e33ccce37dc9dd1250f0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YY2BGtvl9pqxKJUQmAPg6ur0yhPJOf/71wT/JDMT4ejvAtRKJyYWSGDX282lPI3g5E33cPIFVUeiT57aflO2Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:48:51.361837Z","bundle_sha256":"b368e66be1fb048856149fb6068ca7eae00c801ac520c837ccc7986b7640cadb"}}