{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:F7UCICPDHU7AZ2NTT7SJH7TBZI","short_pith_number":"pith:F7UCICPD","canonical_record":{"source":{"id":"1111.0405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-02T07:06:31Z","cross_cats_sorted":[],"title_canon_sha256":"d8953d43eca21e9a6cf406a795468d95e29cc35ef9383228f7a341a810699b7b","abstract_canon_sha256":"f0a1098da501df10ebc0ef4ac87107080d1cd31069c378749f51840f6dbb274a"},"schema_version":"1.0"},"canonical_sha256":"2fe82409e33d3e0ce9b39fe493fe61ca34fb733e8c11831a2f3439adebdf9053","source":{"kind":"arxiv","id":"1111.0405","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0405","created_at":"2026-05-18T00:56:54Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0405v1","created_at":"2026-05-18T00:56:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0405","created_at":"2026-05-18T00:56:54Z"},{"alias_kind":"pith_short_12","alias_value":"F7UCICPDHU7A","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"F7UCICPDHU7AZ2NT","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"F7UCICPD","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:F7UCICPDHU7AZ2NTT7SJH7TBZI","target":"record","payload":{"canonical_record":{"source":{"id":"1111.0405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-02T07:06:31Z","cross_cats_sorted":[],"title_canon_sha256":"d8953d43eca21e9a6cf406a795468d95e29cc35ef9383228f7a341a810699b7b","abstract_canon_sha256":"f0a1098da501df10ebc0ef4ac87107080d1cd31069c378749f51840f6dbb274a"},"schema_version":"1.0"},"canonical_sha256":"2fe82409e33d3e0ce9b39fe493fe61ca34fb733e8c11831a2f3439adebdf9053","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:54.044389Z","signature_b64":"sx0iAcYmituB1Nhg9W92JjwNjBrJnQhDWeUppOsFg74x4l29dsSMJP8jMa8rsqwgFlqIi++iSDl88m1Dd2+/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fe82409e33d3e0ce9b39fe493fe61ca34fb733e8c11831a2f3439adebdf9053","last_reissued_at":"2026-05-18T00:56:54.043730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:54.043730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.0405","source_version":1,"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-18T00:56:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pe+iyiqfT5QhGiXGPs5YFEmQoORVmaHbId1UoN5uNejaWzQLaUX1WxbOyDSl6FX6AEBVyIeA8naPHcmwIMpACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:59:30.163106Z"},"content_sha256":"2cae9d281c3b5464e6b8e40d00c5250ec4212d31f2f2ec3c11befce62f127ca3","schema_version":"1.0","event_id":"sha256:2cae9d281c3b5464e6b8e40d00c5250ec4212d31f2f2ec3c11befce62f127ca3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:F7UCICPDHU7AZ2NTT7SJH7TBZI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Making the long code shorter, with applications to the Unique Games Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Boaz Barak, David Steurer, Johan Hastad, Parikshit Gopalan, Prasad Raghavendra, Raghu Meka","submitted_at":"2011-11-02T07:06:31Z","abstract_excerpt":"The long code is a central tool in hardness of approximation, especially in questions related to the unique games conjecture. We construct a new code that is exponentially more efficient, but can still be used in many of these applications. Using the new code we obtain exponential improvements over several known results, including the following:\n  1. For any eps > 0, we show the existence of an n vertex graph G where every set of o(n) vertices has expansion 1 - eps, but G's adjacency matrix has more than exp(log^delta n) eigenvalues larger than 1 - eps, where delta depends only on eps. This an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0405","kind":"arxiv","version":1},"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-18T00:56:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kZm6JX45YdBQIWU3GW8lB3FnRcCDM0SWz26RN6/pM2bDycW2BOmai29qDIWpTaK0fheihjOKO7oK+qsl2LIsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:59:30.163522Z"},"content_sha256":"71ff703f587c67d71fa4fbc33cdb139d86dc41f7f46d539dda2ab346e4e17c3b","schema_version":"1.0","event_id":"sha256:71ff703f587c67d71fa4fbc33cdb139d86dc41f7f46d539dda2ab346e4e17c3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F7UCICPDHU7AZ2NTT7SJH7TBZI/bundle.json","state_url":"https://pith.science/pith/F7UCICPDHU7AZ2NTT7SJH7TBZI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F7UCICPDHU7AZ2NTT7SJH7TBZI/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-28T12:59:30Z","links":{"resolver":"https://pith.science/pith/F7UCICPDHU7AZ2NTT7SJH7TBZI","bundle":"https://pith.science/pith/F7UCICPDHU7AZ2NTT7SJH7TBZI/bundle.json","state":"https://pith.science/pith/F7UCICPDHU7AZ2NTT7SJH7TBZI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F7UCICPDHU7AZ2NTT7SJH7TBZI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:F7UCICPDHU7AZ2NTT7SJH7TBZI","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":"f0a1098da501df10ebc0ef4ac87107080d1cd31069c378749f51840f6dbb274a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-02T07:06:31Z","title_canon_sha256":"d8953d43eca21e9a6cf406a795468d95e29cc35ef9383228f7a341a810699b7b"},"schema_version":"1.0","source":{"id":"1111.0405","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0405","created_at":"2026-05-18T00:56:54Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0405v1","created_at":"2026-05-18T00:56:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0405","created_at":"2026-05-18T00:56:54Z"},{"alias_kind":"pith_short_12","alias_value":"F7UCICPDHU7A","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"F7UCICPDHU7AZ2NT","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"F7UCICPD","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:71ff703f587c67d71fa4fbc33cdb139d86dc41f7f46d539dda2ab346e4e17c3b","target":"graph","created_at":"2026-05-18T00:56:54Z","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 long code is a central tool in hardness of approximation, especially in questions related to the unique games conjecture. We construct a new code that is exponentially more efficient, but can still be used in many of these applications. Using the new code we obtain exponential improvements over several known results, including the following:\n  1. For any eps > 0, we show the existence of an n vertex graph G where every set of o(n) vertices has expansion 1 - eps, but G's adjacency matrix has more than exp(log^delta n) eigenvalues larger than 1 - eps, where delta depends only on eps. This an","authors_text":"Boaz Barak, David Steurer, Johan Hastad, Parikshit Gopalan, Prasad Raghavendra, Raghu Meka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-02T07:06:31Z","title":"Making the long code shorter, with applications to the Unique Games Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0405","kind":"arxiv","version":1},"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:2cae9d281c3b5464e6b8e40d00c5250ec4212d31f2f2ec3c11befce62f127ca3","target":"record","created_at":"2026-05-18T00:56:54Z","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":"f0a1098da501df10ebc0ef4ac87107080d1cd31069c378749f51840f6dbb274a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-02T07:06:31Z","title_canon_sha256":"d8953d43eca21e9a6cf406a795468d95e29cc35ef9383228f7a341a810699b7b"},"schema_version":"1.0","source":{"id":"1111.0405","kind":"arxiv","version":1}},"canonical_sha256":"2fe82409e33d3e0ce9b39fe493fe61ca34fb733e8c11831a2f3439adebdf9053","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fe82409e33d3e0ce9b39fe493fe61ca34fb733e8c11831a2f3439adebdf9053","first_computed_at":"2026-05-18T00:56:54.043730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:54.043730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sx0iAcYmituB1Nhg9W92JjwNjBrJnQhDWeUppOsFg74x4l29dsSMJP8jMa8rsqwgFlqIi++iSDl88m1Dd2+/BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:54.044389Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.0405","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2cae9d281c3b5464e6b8e40d00c5250ec4212d31f2f2ec3c11befce62f127ca3","sha256:71ff703f587c67d71fa4fbc33cdb139d86dc41f7f46d539dda2ab346e4e17c3b"],"state_sha256":"640bbf73b396aa732a6a872dcd059e83081609354ce5aa280124d5b0d874d58c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n+njiMa4UK0JUxh+4WcozRbNss365msI4spXmgDn+/fvf/NtkOQ1NFglAT1WRY3muUn16bDAa8YNUH52VoIiAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:59:30.165518Z","bundle_sha256":"eeba9020c2ad04123cf4c7a925c27addaead07808ab6acff9cc30db425ff9157"}}