{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WPG65JHYLBXXWXB5HMYXUFUGMJ","short_pith_number":"pith:WPG65JHY","canonical_record":{"source":{"id":"1112.1564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-07T13:58:29Z","cross_cats_sorted":[],"title_canon_sha256":"d602ad156a61cc686ed56f2648585dcecf15c353b3c3f010276e3c0a365bc446","abstract_canon_sha256":"773c77bbd75f8f2508d439aa2b88834c765f97cc81b1e1bf3961f4b4bedf777f"},"schema_version":"1.0"},"canonical_sha256":"b3cdeea4f8586f7b5c3d3b317a1686627444ed04faac097f66e48b66bb97ee18","source":{"kind":"arxiv","id":"1112.1564","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1564","created_at":"2026-05-18T04:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1564v1","created_at":"2026-05-18T04:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1564","created_at":"2026-05-18T04:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"WPG65JHYLBXX","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WPG65JHYLBXXWXB5","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WPG65JHY","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WPG65JHYLBXXWXB5HMYXUFUGMJ","target":"record","payload":{"canonical_record":{"source":{"id":"1112.1564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-07T13:58:29Z","cross_cats_sorted":[],"title_canon_sha256":"d602ad156a61cc686ed56f2648585dcecf15c353b3c3f010276e3c0a365bc446","abstract_canon_sha256":"773c77bbd75f8f2508d439aa2b88834c765f97cc81b1e1bf3961f4b4bedf777f"},"schema_version":"1.0"},"canonical_sha256":"b3cdeea4f8586f7b5c3d3b317a1686627444ed04faac097f66e48b66bb97ee18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:54.339917Z","signature_b64":"oKSnDhOuLk5drdiQHIuQPeaTkGrzs56Rji2SeEuf0VSw0QvJL/SP+vHdZCI0GzRRJStShvDU/YRv5tT+LqkSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3cdeea4f8586f7b5c3d3b317a1686627444ed04faac097f66e48b66bb97ee18","last_reissued_at":"2026-05-18T04:06:54.339510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:54.339510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.1564","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-18T04:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"REJIfRGIUw4d5h+9ashO9WzuE7kMdS24Bv4bWaXQtvewzUBZhzMP5LZZXZ4Q1uzsZOPiBlt0xGYxG04GIJngCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:20:17.010277Z"},"content_sha256":"997cdb91894c23ee2912daec2d4a7a0d1d0b5d5ca47bd0d958cd9c75197869b9","schema_version":"1.0","event_id":"sha256:997cdb91894c23ee2912daec2d4a7a0d1d0b5d5ca47bd0d958cd9c75197869b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WPG65JHYLBXXWXB5HMYXUFUGMJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved hardness results for unique shortest vector problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Chandan Dubey, Divesh Aggarwal","submitted_at":"2011-12-07T13:58:29Z","abstract_excerpt":"We give several improvements on the known hardness of the unique shortest vector problem. - We give a deterministic reduction from the shortest vector problem to the unique shortest vector problem. As a byproduct, we get deterministic NP-hardness for unique shortest vector problem in the $\\ell_\\infty$ norm. - We give a randomized reduction from SAT to uSVP_{1+1/poly(n)}. This shows that uSVP_{1+1/poly(n)} is NP-hard under randomized reductions. - We show that if GapSVP_\\gamma \\in coNP (or coAM) then uSVP_{\\sqrt{\\gamma}} \\in coNP (coAM respectively). This simplifies previously known uSVP_{n^{1/"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1564","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-18T04:06:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XkcPScakLfMDRmpZ86RC/5P6XRRl2/Mes7xlWNG3/TgWqFo2VZBw9+feS2/t28FrUaqNPcxssLrsEd0sWmVFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:20:17.010637Z"},"content_sha256":"e9ebec7f38e66b254c306f1642778dffaefc531e4abfe4ab000e537eef8e8869","schema_version":"1.0","event_id":"sha256:e9ebec7f38e66b254c306f1642778dffaefc531e4abfe4ab000e537eef8e8869"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WPG65JHYLBXXWXB5HMYXUFUGMJ/bundle.json","state_url":"https://pith.science/pith/WPG65JHYLBXXWXB5HMYXUFUGMJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WPG65JHYLBXXWXB5HMYXUFUGMJ/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-23T18:20:17Z","links":{"resolver":"https://pith.science/pith/WPG65JHYLBXXWXB5HMYXUFUGMJ","bundle":"https://pith.science/pith/WPG65JHYLBXXWXB5HMYXUFUGMJ/bundle.json","state":"https://pith.science/pith/WPG65JHYLBXXWXB5HMYXUFUGMJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WPG65JHYLBXXWXB5HMYXUFUGMJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WPG65JHYLBXXWXB5HMYXUFUGMJ","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":"773c77bbd75f8f2508d439aa2b88834c765f97cc81b1e1bf3961f4b4bedf777f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-07T13:58:29Z","title_canon_sha256":"d602ad156a61cc686ed56f2648585dcecf15c353b3c3f010276e3c0a365bc446"},"schema_version":"1.0","source":{"id":"1112.1564","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1564","created_at":"2026-05-18T04:06:54Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1564v1","created_at":"2026-05-18T04:06:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1564","created_at":"2026-05-18T04:06:54Z"},{"alias_kind":"pith_short_12","alias_value":"WPG65JHYLBXX","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WPG65JHYLBXXWXB5","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WPG65JHY","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:e9ebec7f38e66b254c306f1642778dffaefc531e4abfe4ab000e537eef8e8869","target":"graph","created_at":"2026-05-18T04:06: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":"We give several improvements on the known hardness of the unique shortest vector problem. - We give a deterministic reduction from the shortest vector problem to the unique shortest vector problem. As a byproduct, we get deterministic NP-hardness for unique shortest vector problem in the $\\ell_\\infty$ norm. - We give a randomized reduction from SAT to uSVP_{1+1/poly(n)}. This shows that uSVP_{1+1/poly(n)} is NP-hard under randomized reductions. - We show that if GapSVP_\\gamma \\in coNP (or coAM) then uSVP_{\\sqrt{\\gamma}} \\in coNP (coAM respectively). This simplifies previously known uSVP_{n^{1/","authors_text":"Chandan Dubey, Divesh Aggarwal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-07T13:58:29Z","title":"Improved hardness results for unique shortest vector problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1564","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:997cdb91894c23ee2912daec2d4a7a0d1d0b5d5ca47bd0d958cd9c75197869b9","target":"record","created_at":"2026-05-18T04:06: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":"773c77bbd75f8f2508d439aa2b88834c765f97cc81b1e1bf3961f4b4bedf777f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-07T13:58:29Z","title_canon_sha256":"d602ad156a61cc686ed56f2648585dcecf15c353b3c3f010276e3c0a365bc446"},"schema_version":"1.0","source":{"id":"1112.1564","kind":"arxiv","version":1}},"canonical_sha256":"b3cdeea4f8586f7b5c3d3b317a1686627444ed04faac097f66e48b66bb97ee18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3cdeea4f8586f7b5c3d3b317a1686627444ed04faac097f66e48b66bb97ee18","first_computed_at":"2026-05-18T04:06:54.339510Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:54.339510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oKSnDhOuLk5drdiQHIuQPeaTkGrzs56Rji2SeEuf0VSw0QvJL/SP+vHdZCI0GzRRJStShvDU/YRv5tT+LqkSAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:54.339917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1564","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:997cdb91894c23ee2912daec2d4a7a0d1d0b5d5ca47bd0d958cd9c75197869b9","sha256:e9ebec7f38e66b254c306f1642778dffaefc531e4abfe4ab000e537eef8e8869"],"state_sha256":"e69e27e5e7ed557e70d754a66100e5d1671b8aef3e2e3bcfaf768f767bef8227"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T5CTCRKU04hffR1yAgCnlISQWJ2lIdSNOyl9AzEPKLvCjsWxd+1Tp6VpW1DONY9JR22JEpiCslTRd+Idcg5aAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T18:20:17.012527Z","bundle_sha256":"487d791a66de9c7cc116faf978f326922929f258ce34428f9623ff748eb225d2"}}