{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:P5LW5T7TKNR6F6266SX2PSLMNZ","short_pith_number":"pith:P5LW5T7T","canonical_record":{"source":{"id":"1806.04087","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-06-11T16:17:21Z","cross_cats_sorted":[],"title_canon_sha256":"8ec911dd4b5786acf8998a6d18905bc89ac4115af420fd1a87fd8816291456ff","abstract_canon_sha256":"01c5fac770c0346dfb75d1076a6b3422ae0b85687d217dd3aeccbf38d8a7988a"},"schema_version":"1.0"},"canonical_sha256":"7f576ecff35363e2fb5ef4afa7c96c6e66b874e384a3381774354c03ac17438c","source":{"kind":"arxiv","id":"1806.04087","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04087","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04087v1","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04087","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"P5LW5T7TKNR6","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P5LW5T7TKNR6F626","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P5LW5T7T","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:P5LW5T7TKNR6F6266SX2PSLMNZ","target":"record","payload":{"canonical_record":{"source":{"id":"1806.04087","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-06-11T16:17:21Z","cross_cats_sorted":[],"title_canon_sha256":"8ec911dd4b5786acf8998a6d18905bc89ac4115af420fd1a87fd8816291456ff","abstract_canon_sha256":"01c5fac770c0346dfb75d1076a6b3422ae0b85687d217dd3aeccbf38d8a7988a"},"schema_version":"1.0"},"canonical_sha256":"7f576ecff35363e2fb5ef4afa7c96c6e66b874e384a3381774354c03ac17438c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:38.577665Z","signature_b64":"NKzfq85PE+0gbpv6M/MYzdm1zdS55sk6Vko6td8lXCR0oYGRd2PmnP1u3TDLYEUhI8NmIHY/8jzb3XMvrU8JCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f576ecff35363e2fb5ef4afa7c96c6e66b874e384a3381774354c03ac17438c","last_reissued_at":"2026-05-18T00:13:38.576941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:38.576941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.04087","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:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4bFsA/AQgZZhURSU0qu68t1c7KiOpe5aFyFzorqlMqE2r6IBajCb/msIIyFqhwwlfOOX+SwEJX/hZvESOONTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:10:10.280093Z"},"content_sha256":"4fd750f463ea459e1ad4f8ccc3eb409c5f79e6c3ea9b07c26e7e04071fa6fd08","schema_version":"1.0","event_id":"sha256:4fd750f463ea459e1ad4f8ccc3eb409c5f79e6c3ea9b07c26e7e04071fa6fd08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:P5LW5T7TKNR6F6266SX2PSLMNZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ishay Haviv, Oded Regev","submitted_at":"2018-06-11T16:17:21Z","abstract_excerpt":"$ \\newcommand{\\SVP}{\\mathsf{SVP}} \\newcommand{\\NP}{\\mathsf{NP}} \\newcommand{\\RTIME}{\\mathsf{RTIME}} \\newcommand{\\RSUBEXP}{\\mathsf{RSUBEXP}} \\newcommand{\\eps}{\\epsilon} \\newcommand{\\poly}{\\mathop{\\mathrm{poly}}} $We show that unless $\\NP \\subseteq \\RTIME (2^{\\poly(\\log{n})})$, there is no polynomial-time algorithm approximating the Shortest Vector Problem ($\\SVP$) on $n$-dimensional lattices in the $\\ell_p$ norm ($1 \\leq p< \\infty$) to within a factor of $2^{(\\log{n})^{1-\\eps}}$ for any $\\eps > 0$. This improves the previous best factor of $2^{(\\log{n})^{1/2-\\eps}}$ under the same complexity as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04087","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:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M7N/KAR62LaNNSZ6sEyuwHXJzuatqPUU0ZFRLalu3483C8MrlMAV3vYJC0Ew1dI/ZrmjimNo4uNGoK0KR3hrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:10:10.280470Z"},"content_sha256":"39d01f49bb4a549c5fb3149f36ddbaa9ae11edc06b28ecb5740e3c47881bda35","schema_version":"1.0","event_id":"sha256:39d01f49bb4a549c5fb3149f36ddbaa9ae11edc06b28ecb5740e3c47881bda35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P5LW5T7TKNR6F6266SX2PSLMNZ/bundle.json","state_url":"https://pith.science/pith/P5LW5T7TKNR6F6266SX2PSLMNZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P5LW5T7TKNR6F6266SX2PSLMNZ/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-09T05:10:10Z","links":{"resolver":"https://pith.science/pith/P5LW5T7TKNR6F6266SX2PSLMNZ","bundle":"https://pith.science/pith/P5LW5T7TKNR6F6266SX2PSLMNZ/bundle.json","state":"https://pith.science/pith/P5LW5T7TKNR6F6266SX2PSLMNZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P5LW5T7TKNR6F6266SX2PSLMNZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:P5LW5T7TKNR6F6266SX2PSLMNZ","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":"01c5fac770c0346dfb75d1076a6b3422ae0b85687d217dd3aeccbf38d8a7988a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-06-11T16:17:21Z","title_canon_sha256":"8ec911dd4b5786acf8998a6d18905bc89ac4115af420fd1a87fd8816291456ff"},"schema_version":"1.0","source":{"id":"1806.04087","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04087","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04087v1","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04087","created_at":"2026-05-18T00:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"P5LW5T7TKNR6","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P5LW5T7TKNR6F626","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P5LW5T7T","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:39d01f49bb4a549c5fb3149f36ddbaa9ae11edc06b28ecb5740e3c47881bda35","target":"graph","created_at":"2026-05-18T00:13:38Z","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":"$ \\newcommand{\\SVP}{\\mathsf{SVP}} \\newcommand{\\NP}{\\mathsf{NP}} \\newcommand{\\RTIME}{\\mathsf{RTIME}} \\newcommand{\\RSUBEXP}{\\mathsf{RSUBEXP}} \\newcommand{\\eps}{\\epsilon} \\newcommand{\\poly}{\\mathop{\\mathrm{poly}}} $We show that unless $\\NP \\subseteq \\RTIME (2^{\\poly(\\log{n})})$, there is no polynomial-time algorithm approximating the Shortest Vector Problem ($\\SVP$) on $n$-dimensional lattices in the $\\ell_p$ norm ($1 \\leq p< \\infty$) to within a factor of $2^{(\\log{n})^{1-\\eps}}$ for any $\\eps > 0$. This improves the previous best factor of $2^{(\\log{n})^{1/2-\\eps}}$ under the same complexity as","authors_text":"Ishay Haviv, Oded Regev","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-06-11T16:17:21Z","title":"Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04087","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:4fd750f463ea459e1ad4f8ccc3eb409c5f79e6c3ea9b07c26e7e04071fa6fd08","target":"record","created_at":"2026-05-18T00:13:38Z","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":"01c5fac770c0346dfb75d1076a6b3422ae0b85687d217dd3aeccbf38d8a7988a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-06-11T16:17:21Z","title_canon_sha256":"8ec911dd4b5786acf8998a6d18905bc89ac4115af420fd1a87fd8816291456ff"},"schema_version":"1.0","source":{"id":"1806.04087","kind":"arxiv","version":1}},"canonical_sha256":"7f576ecff35363e2fb5ef4afa7c96c6e66b874e384a3381774354c03ac17438c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f576ecff35363e2fb5ef4afa7c96c6e66b874e384a3381774354c03ac17438c","first_computed_at":"2026-05-18T00:13:38.576941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:38.576941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NKzfq85PE+0gbpv6M/MYzdm1zdS55sk6Vko6td8lXCR0oYGRd2PmnP1u3TDLYEUhI8NmIHY/8jzb3XMvrU8JCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:38.577665Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04087","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fd750f463ea459e1ad4f8ccc3eb409c5f79e6c3ea9b07c26e7e04071fa6fd08","sha256:39d01f49bb4a549c5fb3149f36ddbaa9ae11edc06b28ecb5740e3c47881bda35"],"state_sha256":"00f1b8f028e958ca02baafecaf45cc63ef0d6047613a20ef120f28f2d1299a9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Q/mGYWKDhXj96epN2XPqgQXnMWQpJ1Gb9U9WGTKkO+Y6zU6KfRpoHAU7bArBa3YFJY5KvzoHZCg3TlJm+dFCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:10:10.283265Z","bundle_sha256":"fa032b0971425a3709941adcc5084046f1193c08a91d7355ad85929f734f0b04"}}