{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6KMCOUYWDBQL6GYUWPQNJBK2SX","short_pith_number":"pith:6KMCOUYW","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"},"canonical_sha256":"f2982753161860bf1b14b3e0d4855a95d7eb8f03ff86d4b32c7660bd46e1f9e9","source":{"kind":"arxiv","id":"1705.02828","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02828","created_at":"2026-05-18T00:22:44Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02828v2","created_at":"2026-05-18T00:22:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02828","created_at":"2026-05-18T00:22:44Z"},{"alias_kind":"pith_short_12","alias_value":"6KMCOUYWDBQL","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6KMCOUYWDBQL6GYU","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6KMCOUYW","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6KMCOUYWDBQL6GYUWPQNJBK2SX","target":"record","payload":{"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"},"canonical_sha256":"f2982753161860bf1b14b3e0d4855a95d7eb8f03ff86d4b32c7660bd46e1f9e9","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"},"source_kind":"arxiv","source_id":"1705.02828","source_version":2,"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:22:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmhLYIpV3SSVttdCdgfqlUp2IFB67G20pkzGOaA5l/gZS35izjGKHYzOCkM9NLPFmpdLD2AgFohyx1ieCGThCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:00:35.420350Z"},"content_sha256":"65bfee2f779d3c5b1b3cb5ae7de3acd464587e638295971f9107bfcd2635ab64","schema_version":"1.0","event_id":"sha256:65bfee2f779d3c5b1b3cb5ae7de3acd464587e638295971f9107bfcd2635ab64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6KMCOUYWDBQL6GYUWPQNJBK2SX","target":"graph","payload":{"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"},"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:22:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+TXZtP50KQ1806nDALaKzwUh6F+okiUJ6K1ZCjCAj9DhM4iBJyLJHDShFKufYa2JPFlxAdadrGshCq9cWZOeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:00:35.420861Z"},"content_sha256":"23a29f122c0f3ed7bb92ea0f0c3788e0492970f62235770d7722eb9940ac7830","schema_version":"1.0","event_id":"sha256:23a29f122c0f3ed7bb92ea0f0c3788e0492970f62235770d7722eb9940ac7830"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6KMCOUYWDBQL6GYUWPQNJBK2SX/bundle.json","state_url":"https://pith.science/pith/6KMCOUYWDBQL6GYUWPQNJBK2SX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6KMCOUYWDBQL6GYUWPQNJBK2SX/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-05-25T19:00:35Z","links":{"resolver":"https://pith.science/pith/6KMCOUYWDBQL6GYUWPQNJBK2SX","bundle":"https://pith.science/pith/6KMCOUYWDBQL6GYUWPQNJBK2SX/bundle.json","state":"https://pith.science/pith/6KMCOUYWDBQL6GYUWPQNJBK2SX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6KMCOUYWDBQL6GYUWPQNJBK2SX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6KMCOUYWDBQL6GYUWPQNJBK2SX","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":"fbfb130ecbb58f80b2fb5ed8923ce5e883168aa7fcfd050af92515f5d810659a","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-08T11:24:10Z","title_canon_sha256":"ed5221811402e5e8803b9bf7771fcaf4ca70b4f4ec159d356a6dd8f8a131d8e7"},"schema_version":"1.0","source":{"id":"1705.02828","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02828","created_at":"2026-05-18T00:22:44Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02828v2","created_at":"2026-05-18T00:22:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02828","created_at":"2026-05-18T00:22:44Z"},{"alias_kind":"pith_short_12","alias_value":"6KMCOUYWDBQL","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6KMCOUYWDBQL6GYU","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6KMCOUYW","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:23a29f122c0f3ed7bb92ea0f0c3788e0492970f62235770d7722eb9940ac7830","target":"graph","created_at":"2026-05-18T00:22:44Z","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":"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","authors_text":"Thijs Laarhoven","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-08T11:24:10Z","title":"Faster tuple lattice sieving using spherical locality-sensitive filters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02828","kind":"arxiv","version":2},"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:65bfee2f779d3c5b1b3cb5ae7de3acd464587e638295971f9107bfcd2635ab64","target":"record","created_at":"2026-05-18T00:22:44Z","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":"fbfb130ecbb58f80b2fb5ed8923ce5e883168aa7fcfd050af92515f5d810659a","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-08T11:24:10Z","title_canon_sha256":"ed5221811402e5e8803b9bf7771fcaf4ca70b4f4ec159d356a6dd8f8a131d8e7"},"schema_version":"1.0","source":{"id":"1705.02828","kind":"arxiv","version":2}},"canonical_sha256":"f2982753161860bf1b14b3e0d4855a95d7eb8f03ff86d4b32c7660bd46e1f9e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2982753161860bf1b14b3e0d4855a95d7eb8f03ff86d4b32c7660bd46e1f9e9","first_computed_at":"2026-05-18T00:22:44.745564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:44.745564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WoxvggMWcufgDGjKV0Svd3Plwa0iO5/Wk3q3xcmmWzB3pxhxdehYrqaFz++NiuTYd3dUUNMhmOSNfDdUI425Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:44.746110Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02828","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65bfee2f779d3c5b1b3cb5ae7de3acd464587e638295971f9107bfcd2635ab64","sha256:23a29f122c0f3ed7bb92ea0f0c3788e0492970f62235770d7722eb9940ac7830"],"state_sha256":"860e0747b64b24360cf9e198490aec609d442a82e2375ba67e819b7993cc63fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pp43oo+rL4Q5pr3kz32n0KXZnxfycLk9bmVqJ4ab5vHa774XTjP/gdOxJJ4lg5o58SGkGK7NOp3ekRHfMkQUAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:00:35.424108Z","bundle_sha256":"dba2cb3ce9535d5ced66e459b60599b23c053e61dbb03b7182d2bf3c3aac0a8a"}}