{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:WIFSR4I5J7JVSESTJCINBGR7DM","short_pith_number":"pith:WIFSR4I5","canonical_record":{"source":{"id":"2211.11693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2022-11-21T18:11:46Z","cross_cats_sorted":["cs.CR","cs.DS"],"title_canon_sha256":"9814a87f931a3505c5695da0833170ca372e94be77feffdcd2cc36590fc78ff1","abstract_canon_sha256":"8312291e0668d9e0537ff977fbe056531cb4c8ddbaf2706a89145b2f8741b4a6"},"schema_version":"1.0"},"canonical_sha256":"b20b28f11d4fd35912534890d09a3f1b0a5b6c9e568038c97c957958212db3bf","source":{"kind":"arxiv","id":"2211.11693","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.11693","created_at":"2026-07-05T05:17:56Z"},{"alias_kind":"arxiv_version","alias_value":"2211.11693v1","created_at":"2026-07-05T05:17:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.11693","created_at":"2026-07-05T05:17:56Z"},{"alias_kind":"pith_short_12","alias_value":"WIFSR4I5J7JV","created_at":"2026-07-05T05:17:56Z"},{"alias_kind":"pith_short_16","alias_value":"WIFSR4I5J7JVSEST","created_at":"2026-07-05T05:17:56Z"},{"alias_kind":"pith_short_8","alias_value":"WIFSR4I5","created_at":"2026-07-05T05:17:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:WIFSR4I5J7JVSESTJCINBGR7DM","target":"record","payload":{"canonical_record":{"source":{"id":"2211.11693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2022-11-21T18:11:46Z","cross_cats_sorted":["cs.CR","cs.DS"],"title_canon_sha256":"9814a87f931a3505c5695da0833170ca372e94be77feffdcd2cc36590fc78ff1","abstract_canon_sha256":"8312291e0668d9e0537ff977fbe056531cb4c8ddbaf2706a89145b2f8741b4a6"},"schema_version":"1.0"},"canonical_sha256":"b20b28f11d4fd35912534890d09a3f1b0a5b6c9e568038c97c957958212db3bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:17:56.955605Z","signature_b64":"M/mcMm78a7cvE1DmSq4rNZJqd7x52JRih7htQGOY5OPMxvqfo+JJlIPKo6tU2lS30ktLfmiqezCqTq7G1ClUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b20b28f11d4fd35912534890d09a3f1b0a5b6c9e568038c97c957958212db3bf","last_reissued_at":"2026-07-05T05:17:56.955182Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:17:56.955182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.11693","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-07-05T05:17:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QJf1xh4e7gDAGRCywnWteEuDLfdZqBjwSqE7J1e7jbZbuxWXN8YDJKrBnPjgoXpECQzII7T8oD7jdaaHHm+aBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T20:49:29.461427Z"},"content_sha256":"ea592762d1b99edc1ee6836de98a05e2b91dd7ed5c0b3063ccd038758c8d2c9c","schema_version":"1.0","event_id":"sha256:ea592762d1b99edc1ee6836de98a05e2b91dd7ed5c0b3063ccd038758c8d2c9c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:WIFSR4I5J7JVSESTJCINBGR7DM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lattice Problems Beyond Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS"],"primary_cat":"cs.CC","authors_text":"Alexander Golovnev, Divesh Aggarwal, Huck Bennett, Noah Stephens-Davidowitz, Rajendra Kumar, Spencer Peters, Vinod Vaikuntanathan, Zeyong Li, Zvika Brakerski","submitted_at":"2022-11-21T18:11:46Z","abstract_excerpt":"We study the complexity of lattice problems in a world where algorithms, reductions, and protocols can run in superpolynomial time, revisiting four foundational results: two worst-case to average-case reductions and two protocols. We also show a novel protocol.\n  1. We prove that secret-key cryptography exists if $\\widetilde{O}(\\sqrt{n})$-approximate SVP is hard for $2^{\\varepsilon n}$-time algorithms. I.e., we extend to our setting (Micciancio and Regev's improved version of) Ajtai's celebrated polynomial-time worst-case to average-case reduction from $\\widetilde{O}(n)$-approximate SVP to SIS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.11693","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.11693/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:17:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oc8IshI6fRMIW+nB5K9pdFrACzthUOOUf5JkePT+gfgDwAjX1PYVrmqJYijW3/Yq+GzdEMeXwenYNfVx3F67BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T20:49:29.461932Z"},"content_sha256":"1d9cc561573187bc85a5cfb4b3e80ca1ea1b06bd1c46dedbe62ba267a59f5b7c","schema_version":"1.0","event_id":"sha256:1d9cc561573187bc85a5cfb4b3e80ca1ea1b06bd1c46dedbe62ba267a59f5b7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WIFSR4I5J7JVSESTJCINBGR7DM/bundle.json","state_url":"https://pith.science/pith/WIFSR4I5J7JVSESTJCINBGR7DM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WIFSR4I5J7JVSESTJCINBGR7DM/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-08-04T20:49:29Z","links":{"resolver":"https://pith.science/pith/WIFSR4I5J7JVSESTJCINBGR7DM","bundle":"https://pith.science/pith/WIFSR4I5J7JVSESTJCINBGR7DM/bundle.json","state":"https://pith.science/pith/WIFSR4I5J7JVSESTJCINBGR7DM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WIFSR4I5J7JVSESTJCINBGR7DM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:WIFSR4I5J7JVSESTJCINBGR7DM","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":"8312291e0668d9e0537ff977fbe056531cb4c8ddbaf2706a89145b2f8741b4a6","cross_cats_sorted":["cs.CR","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2022-11-21T18:11:46Z","title_canon_sha256":"9814a87f931a3505c5695da0833170ca372e94be77feffdcd2cc36590fc78ff1"},"schema_version":"1.0","source":{"id":"2211.11693","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.11693","created_at":"2026-07-05T05:17:56Z"},{"alias_kind":"arxiv_version","alias_value":"2211.11693v1","created_at":"2026-07-05T05:17:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.11693","created_at":"2026-07-05T05:17:56Z"},{"alias_kind":"pith_short_12","alias_value":"WIFSR4I5J7JV","created_at":"2026-07-05T05:17:56Z"},{"alias_kind":"pith_short_16","alias_value":"WIFSR4I5J7JVSEST","created_at":"2026-07-05T05:17:56Z"},{"alias_kind":"pith_short_8","alias_value":"WIFSR4I5","created_at":"2026-07-05T05:17:56Z"}],"graph_snapshots":[{"event_id":"sha256:1d9cc561573187bc85a5cfb4b3e80ca1ea1b06bd1c46dedbe62ba267a59f5b7c","target":"graph","created_at":"2026-07-05T05:17:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.11693/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the complexity of lattice problems in a world where algorithms, reductions, and protocols can run in superpolynomial time, revisiting four foundational results: two worst-case to average-case reductions and two protocols. We also show a novel protocol.\n  1. We prove that secret-key cryptography exists if $\\widetilde{O}(\\sqrt{n})$-approximate SVP is hard for $2^{\\varepsilon n}$-time algorithms. I.e., we extend to our setting (Micciancio and Regev's improved version of) Ajtai's celebrated polynomial-time worst-case to average-case reduction from $\\widetilde{O}(n)$-approximate SVP to SIS","authors_text":"Alexander Golovnev, Divesh Aggarwal, Huck Bennett, Noah Stephens-Davidowitz, Rajendra Kumar, Spencer Peters, Vinod Vaikuntanathan, Zeyong Li, Zvika Brakerski","cross_cats":["cs.CR","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2022-11-21T18:11:46Z","title":"Lattice Problems Beyond Polynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.11693","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:ea592762d1b99edc1ee6836de98a05e2b91dd7ed5c0b3063ccd038758c8d2c9c","target":"record","created_at":"2026-07-05T05:17:56Z","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":"8312291e0668d9e0537ff977fbe056531cb4c8ddbaf2706a89145b2f8741b4a6","cross_cats_sorted":["cs.CR","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2022-11-21T18:11:46Z","title_canon_sha256":"9814a87f931a3505c5695da0833170ca372e94be77feffdcd2cc36590fc78ff1"},"schema_version":"1.0","source":{"id":"2211.11693","kind":"arxiv","version":1}},"canonical_sha256":"b20b28f11d4fd35912534890d09a3f1b0a5b6c9e568038c97c957958212db3bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b20b28f11d4fd35912534890d09a3f1b0a5b6c9e568038c97c957958212db3bf","first_computed_at":"2026-07-05T05:17:56.955182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:17:56.955182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M/mcMm78a7cvE1DmSq4rNZJqd7x52JRih7htQGOY5OPMxvqfo+JJlIPKo6tU2lS30ktLfmiqezCqTq7G1ClUDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:17:56.955605Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.11693","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea592762d1b99edc1ee6836de98a05e2b91dd7ed5c0b3063ccd038758c8d2c9c","sha256:1d9cc561573187bc85a5cfb4b3e80ca1ea1b06bd1c46dedbe62ba267a59f5b7c"],"state_sha256":"aa343bfe832f35856cc02384debce187360429ef1dd3cd4d98bd9279e5435c62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"clAzuulavmFhVQIHRbn2Zh649lsE8UgAGXjqDD4uW+8Qzb44dLKgXOQRVmzSQfvPAwLAkRlxR9Q3F4CHqiwQCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T20:49:29.466101Z","bundle_sha256":"8a1e9525675687d809b7316df69dee859a3fde7951fae0b65dac3387600009d0"}}