{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:APLNV4HOBQ4X222TPYE6LRGW3B","short_pith_number":"pith:APLNV4HO","schema_version":"1.0","canonical_sha256":"03d6daf0ee0c397d6b537e09e5c4d6d84cab8fc0989ad1901ae7b55734475936","source":{"kind":"arxiv","id":"1512.04138","version":5},"attestation_state":"computed","paper":{"title":"Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than One","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Noah Stephens-Davidowitz","submitted_at":"2015-12-13T23:41:21Z","abstract_excerpt":"We show the first dimension-preserving search-to-decision reductions for approximate SVP and CVP. In particular, for any $\\gamma \\leq 1 + O(\\log n/n)$, we obtain an efficient dimension-preserving reduction from $\\gamma^{O(n/\\log n)}$-SVP to $\\gamma$-GapSVP and an efficient dimension-preserving reduction from $\\gamma^{O(n)}$-CVP to $\\gamma$-GapCVP. These results generalize the known equivalences of the search and decision versions of these problems in the exact case when $\\gamma = 1$. For SVP, we actually obtain something slightly stronger than a search-to-decision reduction---we reduce $\\gamma"},"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":"1512.04138","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-13T23:41:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e4c002e5b7783a42ec042e72ddfcd1e600f71d448c6e194b30bb1a0ea50fd5a6","abstract_canon_sha256":"c155940b213fa63f13aab62b3e70b6906248339d92c80e837d95cb979a67adbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:34.915371Z","signature_b64":"e8LB2H3SEAKlV8meGByUoZyhFet4fTUjUsZZiwXU/S2mQqle9uWfCdUvcR/eePSmUhYv3CZ7XOsNkynL3teUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03d6daf0ee0c397d6b537e09e5c4d6d84cab8fc0989ad1901ae7b55734475936","last_reissued_at":"2026-05-17T23:55:34.914751Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:34.914751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than One","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Noah Stephens-Davidowitz","submitted_at":"2015-12-13T23:41:21Z","abstract_excerpt":"We show the first dimension-preserving search-to-decision reductions for approximate SVP and CVP. In particular, for any $\\gamma \\leq 1 + O(\\log n/n)$, we obtain an efficient dimension-preserving reduction from $\\gamma^{O(n/\\log n)}$-SVP to $\\gamma$-GapSVP and an efficient dimension-preserving reduction from $\\gamma^{O(n)}$-CVP to $\\gamma$-GapCVP. These results generalize the known equivalences of the search and decision versions of these problems in the exact case when $\\gamma = 1$. For SVP, we actually obtain something slightly stronger than a search-to-decision reduction---we reduce $\\gamma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04138","kind":"arxiv","version":5},"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":"1512.04138","created_at":"2026-05-17T23:55:34.914834+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.04138v5","created_at":"2026-05-17T23:55:34.914834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04138","created_at":"2026-05-17T23:55:34.914834+00:00"},{"alias_kind":"pith_short_12","alias_value":"APLNV4HOBQ4X","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"APLNV4HOBQ4X222T","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"APLNV4HO","created_at":"2026-05-18T12:29:10.953037+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/APLNV4HOBQ4X222TPYE6LRGW3B","json":"https://pith.science/pith/APLNV4HOBQ4X222TPYE6LRGW3B.json","graph_json":"https://pith.science/api/pith-number/APLNV4HOBQ4X222TPYE6LRGW3B/graph.json","events_json":"https://pith.science/api/pith-number/APLNV4HOBQ4X222TPYE6LRGW3B/events.json","paper":"https://pith.science/paper/APLNV4HO"},"agent_actions":{"view_html":"https://pith.science/pith/APLNV4HOBQ4X222TPYE6LRGW3B","download_json":"https://pith.science/pith/APLNV4HOBQ4X222TPYE6LRGW3B.json","view_paper":"https://pith.science/paper/APLNV4HO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.04138&json=true","fetch_graph":"https://pith.science/api/pith-number/APLNV4HOBQ4X222TPYE6LRGW3B/graph.json","fetch_events":"https://pith.science/api/pith-number/APLNV4HOBQ4X222TPYE6LRGW3B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/APLNV4HOBQ4X222TPYE6LRGW3B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/APLNV4HOBQ4X222TPYE6LRGW3B/action/storage_attestation","attest_author":"https://pith.science/pith/APLNV4HOBQ4X222TPYE6LRGW3B/action/author_attestation","sign_citation":"https://pith.science/pith/APLNV4HOBQ4X222TPYE6LRGW3B/action/citation_signature","submit_replication":"https://pith.science/pith/APLNV4HOBQ4X222TPYE6LRGW3B/action/replication_record"}},"created_at":"2026-05-17T23:55:34.914834+00:00","updated_at":"2026-05-17T23:55:34.914834+00:00"}