{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WPG65JHYLBXXWXB5HMYXUFUGMJ","short_pith_number":"pith:WPG65JHY","schema_version":"1.0","canonical_sha256":"b3cdeea4f8586f7b5c3d3b317a1686627444ed04faac097f66e48b66bb97ee18","source":{"kind":"arxiv","id":"1112.1564","version":1},"attestation_state":"computed","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/"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1112.1564","created_at":"2026-05-18T04:06:54.339567+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.1564v1","created_at":"2026-05-18T04:06:54.339567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1564","created_at":"2026-05-18T04:06:54.339567+00:00"},{"alias_kind":"pith_short_12","alias_value":"WPG65JHYLBXX","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WPG65JHYLBXXWXB5","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WPG65JHY","created_at":"2026-05-18T12:26:44.992195+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WPG65JHYLBXXWXB5HMYXUFUGMJ","json":"https://pith.science/pith/WPG65JHYLBXXWXB5HMYXUFUGMJ.json","graph_json":"https://pith.science/api/pith-number/WPG65JHYLBXXWXB5HMYXUFUGMJ/graph.json","events_json":"https://pith.science/api/pith-number/WPG65JHYLBXXWXB5HMYXUFUGMJ/events.json","paper":"https://pith.science/paper/WPG65JHY"},"agent_actions":{"view_html":"https://pith.science/pith/WPG65JHYLBXXWXB5HMYXUFUGMJ","download_json":"https://pith.science/pith/WPG65JHYLBXXWXB5HMYXUFUGMJ.json","view_paper":"https://pith.science/paper/WPG65JHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.1564&json=true","fetch_graph":"https://pith.science/api/pith-number/WPG65JHYLBXXWXB5HMYXUFUGMJ/graph.json","fetch_events":"https://pith.science/api/pith-number/WPG65JHYLBXXWXB5HMYXUFUGMJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WPG65JHYLBXXWXB5HMYXUFUGMJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WPG65JHYLBXXWXB5HMYXUFUGMJ/action/storage_attestation","attest_author":"https://pith.science/pith/WPG65JHYLBXXWXB5HMYXUFUGMJ/action/author_attestation","sign_citation":"https://pith.science/pith/WPG65JHYLBXXWXB5HMYXUFUGMJ/action/citation_signature","submit_replication":"https://pith.science/pith/WPG65JHYLBXXWXB5HMYXUFUGMJ/action/replication_record"}},"created_at":"2026-05-18T04:06:54.339567+00:00","updated_at":"2026-05-18T04:06:54.339567+00:00"}