{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:H3QXB24TAUUDTXPNSANODMAOUG","short_pith_number":"pith:H3QXB24T","canonical_record":{"source":{"id":"1408.4048","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-18T15:48:53Z","cross_cats_sorted":[],"title_canon_sha256":"cd9c46b4e52c8d253a1983e8d3c74bf01d5f37298a820b621cdaca9d4e24df4c","abstract_canon_sha256":"89ea02e6c9f213b8696d9bc03b461d6aaa2277fa5b14e2b125cdd7a8d24f2569"},"schema_version":"1.0"},"canonical_sha256":"3ee170eb93052839dded901ae1b00ea199b847ae8ca83a98646ec1f139ee5988","source":{"kind":"arxiv","id":"1408.4048","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4048","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4048v2","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4048","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"H3QXB24TAUUD","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"H3QXB24TAUUDTXPN","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"H3QXB24T","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:H3QXB24TAUUDTXPNSANODMAOUG","target":"record","payload":{"canonical_record":{"source":{"id":"1408.4048","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-18T15:48:53Z","cross_cats_sorted":[],"title_canon_sha256":"cd9c46b4e52c8d253a1983e8d3c74bf01d5f37298a820b621cdaca9d4e24df4c","abstract_canon_sha256":"89ea02e6c9f213b8696d9bc03b461d6aaa2277fa5b14e2b125cdd7a8d24f2569"},"schema_version":"1.0"},"canonical_sha256":"3ee170eb93052839dded901ae1b00ea199b847ae8ca83a98646ec1f139ee5988","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:58.277523Z","signature_b64":"/LF7/StAUnmqSSR4p7Mr4nUlMiiuLuAveDseTGos5uOhTOLxxlbY002EzSVdqKioIUcF7FmZIgh/hp5+3jPgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ee170eb93052839dded901ae1b00ea199b847ae8ca83a98646ec1f139ee5988","last_reissued_at":"2026-05-18T01:26:58.277089Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:58.277089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.4048","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:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yW7roxJLrrnkVSg+ZW+cUHA9V3Ae+QIBEmhCT03pYNZ8D5az1jBc1rVvzzWWQAxJ07xHjPGF+rWRykh3q/seBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:21:05.021260Z"},"content_sha256":"bb7768422dd85d78f640b263dc7ba2ff176325e53fd4e02ff65136a917e2c2ff","schema_version":"1.0","event_id":"sha256:bb7768422dd85d78f640b263dc7ba2ff176325e53fd4e02ff65136a917e2c2ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:H3QXB24TAUUDTXPNSANODMAOUG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Approximation Algorithms for Projection Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dana Moshkovitz, Pasin Manurangsi","submitted_at":"2014-08-18T15:48:53Z","abstract_excerpt":"The projection games (aka Label-Cover) problem is of great importance to the field of approximation algorithms, since most of the NP-hardness of approximation results we know today are reductions from Label-Cover. In this paper we design several approximation algorithms for projection games: 1. A polynomial-time approximation algorithm that improves on the previous best approximation by Charikar, Hajiaghayi and Karloff. 2. A sub-exponential time algorithm with much tighter approximation for the case of smooth projection games. 3. A polynomial-time approximation scheme (PTAS) for projection gam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4048","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:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xNNYsdjUGFvNKA9xlYrW6GxxpQ0UGe6zeuIN/zUk+Bx8oPsD5ORzdiJmWlIYoS1Ss4kSLJsFRAYIIV+oJ1bvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:21:05.021614Z"},"content_sha256":"ead6047f8b9d06ea10a56aaf0e877ab72437485a46ca4fb47d31b3d4ce0f2af6","schema_version":"1.0","event_id":"sha256:ead6047f8b9d06ea10a56aaf0e877ab72437485a46ca4fb47d31b3d4ce0f2af6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H3QXB24TAUUDTXPNSANODMAOUG/bundle.json","state_url":"https://pith.science/pith/H3QXB24TAUUDTXPNSANODMAOUG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H3QXB24TAUUDTXPNSANODMAOUG/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-06-01T22:21:05Z","links":{"resolver":"https://pith.science/pith/H3QXB24TAUUDTXPNSANODMAOUG","bundle":"https://pith.science/pith/H3QXB24TAUUDTXPNSANODMAOUG/bundle.json","state":"https://pith.science/pith/H3QXB24TAUUDTXPNSANODMAOUG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H3QXB24TAUUDTXPNSANODMAOUG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:H3QXB24TAUUDTXPNSANODMAOUG","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":"89ea02e6c9f213b8696d9bc03b461d6aaa2277fa5b14e2b125cdd7a8d24f2569","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-18T15:48:53Z","title_canon_sha256":"cd9c46b4e52c8d253a1983e8d3c74bf01d5f37298a820b621cdaca9d4e24df4c"},"schema_version":"1.0","source":{"id":"1408.4048","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4048","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4048v2","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4048","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"H3QXB24TAUUD","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"H3QXB24TAUUDTXPN","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"H3QXB24T","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:ead6047f8b9d06ea10a56aaf0e877ab72437485a46ca4fb47d31b3d4ce0f2af6","target":"graph","created_at":"2026-05-18T01:26:58Z","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 projection games (aka Label-Cover) problem is of great importance to the field of approximation algorithms, since most of the NP-hardness of approximation results we know today are reductions from Label-Cover. In this paper we design several approximation algorithms for projection games: 1. A polynomial-time approximation algorithm that improves on the previous best approximation by Charikar, Hajiaghayi and Karloff. 2. A sub-exponential time algorithm with much tighter approximation for the case of smooth projection games. 3. A polynomial-time approximation scheme (PTAS) for projection gam","authors_text":"Dana Moshkovitz, Pasin Manurangsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-18T15:48:53Z","title":"Improved Approximation Algorithms for Projection Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4048","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:bb7768422dd85d78f640b263dc7ba2ff176325e53fd4e02ff65136a917e2c2ff","target":"record","created_at":"2026-05-18T01:26:58Z","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":"89ea02e6c9f213b8696d9bc03b461d6aaa2277fa5b14e2b125cdd7a8d24f2569","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-18T15:48:53Z","title_canon_sha256":"cd9c46b4e52c8d253a1983e8d3c74bf01d5f37298a820b621cdaca9d4e24df4c"},"schema_version":"1.0","source":{"id":"1408.4048","kind":"arxiv","version":2}},"canonical_sha256":"3ee170eb93052839dded901ae1b00ea199b847ae8ca83a98646ec1f139ee5988","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ee170eb93052839dded901ae1b00ea199b847ae8ca83a98646ec1f139ee5988","first_computed_at":"2026-05-18T01:26:58.277089Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:58.277089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/LF7/StAUnmqSSR4p7Mr4nUlMiiuLuAveDseTGos5uOhTOLxxlbY002EzSVdqKioIUcF7FmZIgh/hp5+3jPgBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:58.277523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.4048","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb7768422dd85d78f640b263dc7ba2ff176325e53fd4e02ff65136a917e2c2ff","sha256:ead6047f8b9d06ea10a56aaf0e877ab72437485a46ca4fb47d31b3d4ce0f2af6"],"state_sha256":"b54162abb3e4549ecea93ad003e6d052c4401d0114df7f91a701614b5bdc7783"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o5SVOyPeONkYK3SAjUUOfJZDezciECDAELUDa3QMgGyrFYGi1x+pFNf1LNFV4Okzurk/tksLNVU5fj2oNYeMDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:21:05.023483Z","bundle_sha256":"abc3090a2c8ce2dd40f86b8262aecb340f3cd3ddd08f345b710aa160a9161570"}}