{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6KMCOUYWDBQL6GYUWPQNJBK2SX","short_pith_number":"pith:6KMCOUYW","schema_version":"1.0","canonical_sha256":"f2982753161860bf1b14b3e0d4855a95d7eb8f03ff86d4b32c7660bd46e1f9e9","source":{"kind":"arxiv","id":"1705.02828","version":2},"attestation_state":"computed","paper":{"title":"Faster tuple lattice sieving using spherical locality-sensitive filters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Thijs Laarhoven","submitted_at":"2017-05-08T11:24:10Z","abstract_excerpt":"To overcome the large memory requirement of classical lattice sieving algorithms for solving hard lattice problems, Bai-Laarhoven-Stehl\\'{e} [ANTS 2016] studied tuple lattice sieving, where tuples instead of pairs of lattice vectors are combined to form shorter vectors. Herold-Kirshanova [PKC 2017] recently improved upon their results for arbitrary tuple sizes, for example showing that a triple sieve can solve the shortest vector problem (SVP) in dimension $d$ in time $2^{0.3717d + o(d)}$, using a technique similar to locality-sensitive hashing for finding nearest neighbors.\n  In this work, we"},"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":"1705.02828","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-08T11:24:10Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"ed5221811402e5e8803b9bf7771fcaf4ca70b4f4ec159d356a6dd8f8a131d8e7","abstract_canon_sha256":"fbfb130ecbb58f80b2fb5ed8923ce5e883168aa7fcfd050af92515f5d810659a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:44.746110Z","signature_b64":"WoxvggMWcufgDGjKV0Svd3Plwa0iO5/Wk3q3xcmmWzB3pxhxdehYrqaFz++NiuTYd3dUUNMhmOSNfDdUI425Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2982753161860bf1b14b3e0d4855a95d7eb8f03ff86d4b32c7660bd46e1f9e9","last_reissued_at":"2026-05-18T00:22:44.745564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:44.745564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster tuple lattice sieving using spherical locality-sensitive filters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Thijs Laarhoven","submitted_at":"2017-05-08T11:24:10Z","abstract_excerpt":"To overcome the large memory requirement of classical lattice sieving algorithms for solving hard lattice problems, Bai-Laarhoven-Stehl\\'{e} [ANTS 2016] studied tuple lattice sieving, where tuples instead of pairs of lattice vectors are combined to form shorter vectors. Herold-Kirshanova [PKC 2017] recently improved upon their results for arbitrary tuple sizes, for example showing that a triple sieve can solve the shortest vector problem (SVP) in dimension $d$ in time $2^{0.3717d + o(d)}$, using a technique similar to locality-sensitive hashing for finding nearest neighbors.\n  In this work, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02828","kind":"arxiv","version":2},"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":"1705.02828","created_at":"2026-05-18T00:22:44.745647+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02828v2","created_at":"2026-05-18T00:22:44.745647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02828","created_at":"2026-05-18T00:22:44.745647+00:00"},{"alias_kind":"pith_short_12","alias_value":"6KMCOUYWDBQL","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6KMCOUYWDBQL6GYU","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6KMCOUYW","created_at":"2026-05-18T12:31:03.183658+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/6KMCOUYWDBQL6GYUWPQNJBK2SX","json":"https://pith.science/pith/6KMCOUYWDBQL6GYUWPQNJBK2SX.json","graph_json":"https://pith.science/api/pith-number/6KMCOUYWDBQL6GYUWPQNJBK2SX/graph.json","events_json":"https://pith.science/api/pith-number/6KMCOUYWDBQL6GYUWPQNJBK2SX/events.json","paper":"https://pith.science/paper/6KMCOUYW"},"agent_actions":{"view_html":"https://pith.science/pith/6KMCOUYWDBQL6GYUWPQNJBK2SX","download_json":"https://pith.science/pith/6KMCOUYWDBQL6GYUWPQNJBK2SX.json","view_paper":"https://pith.science/paper/6KMCOUYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02828&json=true","fetch_graph":"https://pith.science/api/pith-number/6KMCOUYWDBQL6GYUWPQNJBK2SX/graph.json","fetch_events":"https://pith.science/api/pith-number/6KMCOUYWDBQL6GYUWPQNJBK2SX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6KMCOUYWDBQL6GYUWPQNJBK2SX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6KMCOUYWDBQL6GYUWPQNJBK2SX/action/storage_attestation","attest_author":"https://pith.science/pith/6KMCOUYWDBQL6GYUWPQNJBK2SX/action/author_attestation","sign_citation":"https://pith.science/pith/6KMCOUYWDBQL6GYUWPQNJBK2SX/action/citation_signature","submit_replication":"https://pith.science/pith/6KMCOUYWDBQL6GYUWPQNJBK2SX/action/replication_record"}},"created_at":"2026-05-18T00:22:44.745647+00:00","updated_at":"2026-05-18T00:22:44.745647+00:00"}