{"as_of":"2026-08-17T20:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6ea62a3e86eda4ccf860d16556247ff136ecbab48ab8af3bd85020a139293aab","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T10:51:44.498651Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2510.08473/citation-record","integrity":"/paper/2510.08473/integrity","json":"/paper/2510.08473/citation-record.json","paper":"/paper/2510.08473"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:39.550137Z","title":"Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:39.550137Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:ee45c577f5a8b68220bbb3c65f390566b520516ccd0b90c3aba38b311574888b","observation_id":"516317b0-1b4e-42cb-89e9-76cd3559b95b","resolution":{"observed_at":"2026-08-04T10:51:39.550137Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:39.635680Z","title":"Albrecht, L \\'e o Ducas, Gottfried Herold, Elena Kirshanova, Eamonn W","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:39.635680Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:72f1a8127fd5598fa62ce6fafcce0a01e0b1b7815f958b930a465e44f4bb4dc1","observation_id":"c99655ff-14ba-455c-80b8-7844e4ae2926","resolution":{"observed_at":"2026-08-04T10:51:39.635680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:39.834672Z","title":"Solving the shortest vector problem in 2\\( ^ n \\) time using discrete G aussian sampling: Extended abstract","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:39.834672Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:430d38a2a8f555209afd1e5ac693b3b4050570abbb29aa0b606c72ead6ba86b3","observation_id":"45aed143-b297-4e22-9ef4-b7cc660b4ad0","resolution":{"observed_at":"2026-08-04T10:51:39.834672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:39.958723Z","title":"Generating hard instances of lattice problems (extended abstract)","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:39.958723Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:361fea3be163d98ab9eed8e329ba9b5fb4ffb02c477553302698ff15a75cd300","observation_id":"cd8f1bac-364a-4236-a34e-4f16b6829cf0","resolution":{"observed_at":"2026-08-04T10:51:39.958723Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:40.055522Z","title":"Sivakumar","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:40.055522Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:75486fdd99a6b03ea420060843b1f501e9d0beba66f2b152ea4f368cf45e5b68","observation_id":"44b8782e-4658-43e5-9614-bbd755e24510","resolution":{"observed_at":"2026-08-04T10:51:40.055522Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:40.102367Z","title":"Quantum walk algorithm for element distinctness","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:40.102367Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:59c2829c50c8d6906952bb08f930a563c5d2e1b8c010c1210debdcb992e50a3d","observation_id":"0e77ef50-4b13-44d4-95f8-f5831b59cd8c","resolution":{"observed_at":"2026-08-04T10:51:40.102367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:40.248291Z","title":"Quantum search with variable times","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:40.248291Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:b8130b75197a6968a71bf7c234f26dc21ec7c1a62167bb352d622d83c35dfc5d","observation_id":"649d56e8-8aa8-45d0-a778-8e8ca525c6fc","resolution":{"observed_at":"2026-08-04T10:51:40.248291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:40.350477Z","title":"Just take the average! A n embarrassingly simple 2^n -time algorithm for SVP (and CVP)","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:40.350477Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:96c70b89dfa48a5fcd12a38a4dda08272bc82bbad110b6b9f32d12d5ee89f6fd","observation_id":"4d760661-c76e-44a1-8059-17191c0aa1fa","resolution":{"observed_at":"2026-08-04T10:51:40.350477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:40.469615Z","title":"Finding many collisions via reusable quantum walks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:40.469615Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:a396c3dc27d793cff23f08718e8d924b6bbc9bd5b741b0df0c0d34f359948714","observation_id":"6af5cc24-08a1-45da-9c9d-7ade6a38747a","resolution":{"observed_at":"2026-08-04T10:51:40.469615Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:40.560719Z","title":"New directions in nearest neighbor searching with applications to lattice sieving","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:40.560719Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:9e9daa469cc5f72b4491c160452b628245559e724aadd722a4ef46adc278be58","observation_id":"47d80814-5831-4d79-9e36-c75208f76ad8","resolution":{"observed_at":"2026-08-04T10:51:40.560719Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:40.683245Z","title":"Quantum amplitude amplification and estimation","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:40.683245Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:848b8263c9c5a8d96a920a25b7e5fceb985dc31fa71b3bfcfa197a0dee399872","observation_id":"752b10e4-84e8-4912-a31e-e6383cca72ec","resolution":{"observed_at":"2026-08-04T10:51:40.683245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9705002","last_updated":"1997-05-01T21:59:56Z","snapshot_observed_at":"2026-07-07T07:26:48.967930Z","submitted_at":"1997-05-01T21:59:56Z","title":"Quantum Algorithm for the Collision Problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9705002","snapshot_observed_at":"2026-08-04T10:51:40.816169Z","title":"Quantum algorithm for the collision problem","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:40.816169Z"},"links":{"cited_paper":"/paper/quant-ph/9705002","citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:7e05b69083e6082c416b86a46f9d2491315530e935d6f085b76a259e29480ac4","observation_id":"fee95da3-4602-4bda-8717-35b43626ed55","resolution":{"observed_at":"2026-08-04T10:51:40.816169Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:40.943568Z","title":"Tuple lattice sieving","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:40.943568Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:6f4a17c3937ef793ff00714c839baa03cf3dec267122b4ce6d86154d68a96d01","observation_id":"b4023060-7625-4914-be12-c4026fadcf35","resolution":{"observed_at":"2026-08-04T10:51:40.943568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:41.082855Z","title":"Lattice-based FHE as secure as PKE","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:41.082855Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:1a4b766666095fc2f8296d527db861ac980059d37255a7907761f18d4daa5486","observation_id":"bf87cdd8-8eb6-442a-891e-06569075e548","resolution":{"observed_at":"2026-08-04T10:51:41.082855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:41.195492Z","title":"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations","venue":null,"work_id":null,"year":1952},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:41.195492Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:d0d7dff7606cab90e9cc9167b1a2f3765ddd9267fa705850d3cd647532fe2b4f","observation_id":"001b123b-e6e8-4afd-bb0c-f47aa501e581","resolution":{"observed_at":"2026-08-04T10:51:41.195492Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:41.362739Z","title":"Lattice sieving via quantum random walks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:41.362739Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:ca5dd2c7ea06e98c074ae0d36678350c2bd8428bb758862314321ec40773c67c","observation_id":"d7aaa8a3-39b1-4ab4-95d7-5b35c1e47c30","resolution":{"observed_at":"2026-08-04T10:51:41.362739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:41.467205Z","title":"Classical and quantum 3 and 4-sieves to solve SVP with low memory","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:41.467205Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:e7affb9987ddbe275a234a3f6867c6da2f57576b2ad7d5e43ec3035c381fdc20","observation_id":"116f712e-0f30-4367-8c0a-2fc4f1a9ceba","resolution":{"observed_at":"2026-08-04T10:51:41.467205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:41.565817Z","title":"Another NP-complete partition problem and the complexity of computing short vectors in a lattice","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:41.565817Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:2d1e2bcfbfc517ace6c1da148c240efa3a7d384b8c834482023e81bf99f977e6","observation_id":"e43d831a-5517-47fe-a649-7e21e07f9bd3","resolution":{"observed_at":"2026-08-04T10:51:41.565817Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:41.680001Z","title":"Fully homomorphic encryption using ideal lattices","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:41.680001Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:0eaa6434a006b9602f86391fdd96bc488a89635f7ca7fa0119c15ce7f789980d","observation_id":"e31bf8ec-4215-4c03-ab0a-9bcf44066306","resolution":{"observed_at":"2026-08-04T10:51:41.680001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.01838","last_updated":"2018-06-05T17:51:03Z","snapshot_observed_at":"2026-08-16T17:05:47.864805Z","submitted_at":"2018-06-05T17:51:03Z","title":"Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.01838","snapshot_observed_at":"2026-08-04T10:51:41.772611Z","title":"Quantum singular value transformation and beyond: E xponential improvements for quantum matrix arithmetics","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:41.772611Z"},"links":{"cited_paper":"/paper/1806.01838","citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:431c0e636dad7742e8a448b21d1909dea1310823c4485497adaef41bef7f14ed","observation_id":"747596af-09ad-4868-a82d-55d2e546e054","resolution":{"observed_at":"2026-08-04T10:51:41.772611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:41.882383Z","title":"Improved quantum hypercone locality sensitive filtering in lattice sieving","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:41.882383Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:67fc298a236d8f2b1818d2c277458be90bfdbaf0ef9e1b5a8f62f9ecaf8e6ce9","observation_id":"ef88dffc-ae06-482f-83cf-fcb6b744fa29","resolution":{"observed_at":"2026-08-04T10:51:41.882383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:42.002269Z","title":"Improved algorithms for the approximate k-list problem in E uclidean norm","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:42.002269Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:0f02198cfe34ddb6bb8d0b372e3aacfc674f492593a4156b3086ff4cb66bec95","observation_id":"4f8b2c53-bfba-436c-ad1d-c1904b01dde9","resolution":{"observed_at":"2026-08-04T10:51:42.002269Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:42.162162Z","title":"Speed-ups and time-memory trade-offs for tuple lattice sieving","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:42.162162Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:7b3251464410ab2b5006de02e7c454ca042e94d6267daedd465ab11968032dd9","observation_id":"eb43aa33-393b-463c-b02e-0ffa7a59b073","resolution":{"observed_at":"2026-08-04T10:51:42.162162Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:42.346241Z","title":"Algorithms for the shortest and closest lattice vector problems","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:42.346241Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:b9d5c8bed54fd2edee7596512eb747f1f7ed0c32ee52a404d157ba0048e1e406","observation_id":"d0bc45e4-f76b-4658-8ae8-3d325306bbf5","resolution":{"observed_at":"2026-08-04T10:51:42.346241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:42.476763Z","title":"Oracles with costs","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:42.476763Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:1bea5b0d9774b7585c68fb8b88c022b0c0cb650114865816fc26592de9dddf37","observation_id":"78bb47cc-4053-4925-a435-e0b5df8c4d79","resolution":{"observed_at":"2026-08-04T10:51:42.476763Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:42.582066Z","title":"Postlethwaite, and Subhayan Roy Moulik","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:42.582066Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:7dfb2ed84dd6b9dd4ac6de1910fb104f5aa89efbc9e009c19b82046fd3425cc2","observation_id":"6859a980-da9f-4665-8e06-f7820c821a56","resolution":{"observed_at":"2026-08-04T10:51:42.582066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:42.720560Z","title":"Search problems in cryptography, from fingerprinting to lattice sieving","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:42.720560Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:20ec9e8c5da6c120cf4af3b3dd09b066da0c03c692d64a0d994f06a03269e670","observation_id":"e6c085e1-a394-4769-aaab-3571214c96c9","resolution":{"observed_at":"2026-08-04T10:51:42.720560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:42.849588Z","title":"Finding shortest lattice vectors faster using quantum search","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:42.849588Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:e938fca4bee4de77860ab0953ffb2543174d5f85364a74a8347df59d7846a018","observation_id":"b88fb7ed-d973-4fda-bd4b-04a9ddfb0def","resolution":{"observed_at":"2026-08-04T10:51:42.849588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:42.974293Z","title":"Worst-case to average-case reductions based on G aussian measures","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:42.974293Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:003d802bdc76f0f378b13bd568236d1de4c48d650a9fe140fa8ff976d8af005a","observation_id":"07440f7e-9b40-4d2f-818f-df842cb9335b","resolution":{"observed_at":"2026-08-04T10:51:42.974293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:43.094671Z","title":"Lattice-based cryptography, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:43.094671Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:448fca4dc0ee968890599ac5e415e143a82b0c8a298a04c9cae5372e51e6dc6c","observation_id":"5c35ddff-8f44-4b00-96cc-79931c025c08","resolution":{"observed_at":"2026-08-04T10:51:43.094671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:43.232266Z","title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:43.232266Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:fe8b6e774dbfacb2912a7c466736be48fc0db671fb8e52e511cf8bb39357d66e","observation_id":"a04b2fdb-07ac-457a-98d0-32d2e18489e6","resolution":{"observed_at":"2026-08-04T10:51:43.232266Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:43.336583Z","title":"Faster exponential time algorithms for the shortest vector problem","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:43.336583Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:f9786eb5320c3d6db5b8fdd7e638a852138e002ce88a2a62880b645d07fb83fe","observation_id":"0a6e2dfc-a49e-4a81-9ed8-bce3132ac66b","resolution":{"observed_at":"2026-08-04T10:51:43.336583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:43.406995Z","title":"Nguyen and Thomas Vidick","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:43.406995Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:6db855cf87c4c84091295232d47ea88f7faa08e10f5ba6b24c427999eaebdb13","observation_id":"7d1e7c30-965c-46a0-8812-3f6c9c5e649f","resolution":{"observed_at":"2026-08-04T10:51:43.406995Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:43.559235Z","title":"Solving the shortest lattice vector problem in time 2\\( ^ 2.465n \\)","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:43.559235Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:e924a69a88aeca8299c1aed0853941cd78abc9f6a83ef918604f342ace601f0e","observation_id":"50224192-c46a-431a-8634-c8c8ef4f07a0","resolution":{"observed_at":"2026-08-04T10:51:43.559235Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:43.646541Z","title":"Lattices in computer science, lecture 8, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:43.646541Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:5ba37599d3b103d21ecbe96720755e64271f3a18fea4753ec7f1e9fb6acdfbab","observation_id":"5fa3f5eb-eae8-41a0-be36-a9dfc925849d","resolution":{"observed_at":"2026-08-04T10:51:43.646541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:43.769021Z","title":"Lattice-based cryptography","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:43.769021Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:c33a3d825d41334cdb8902bc970db5b8964a04d0ffb5d95d854a0cd69bd1b855","observation_id":"1d313094-4722-43f8-b4e1-c552df44c695","resolution":{"observed_at":"2026-08-04T10:51:43.769021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.03703","last_updated":"2024-01-08T07:14:54Z","snapshot_observed_at":"2026-08-17T16:39:10.211548Z","submitted_at":"2024-01-08T07:14:54Z","title":"On Lattices, Learning with Errors, Random Linear Codes, and Cryptography","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.03703","snapshot_observed_at":"2026-08-04T10:51:43.897433Z","title":"On lattices, learning with errors, random linear codes, and cryptography","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:43.897433Z"},"links":{"cited_paper":"/paper/2401.03703","citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:3bcc025f34f21cf7fff94eb4c9bd1e01760d93fb16246c07ab104008383b4f75","observation_id":"0c02f398-13d8-42b8-8655-ec5404b84f31","resolution":{"observed_at":"2026-08-04T10:51:43.897433Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:44.036622Z","title":"A hierarchy of polynomial time lattice basis reduction algorithms","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:44.036622Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:508976406f58b7f1b54664ee434d3c7a77e275f06b83da7b99add7cd4702f737","observation_id":"2a5b1c86-22e6-4460-953c-a6c42da421be","resolution":{"observed_at":"2026-08-04T10:51:44.036622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:51:44.228653Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:44.228653Z"},"links":{"citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:f1bff6bd84b02d7ed0dd300846ffd9e4e8e9652c77ccb0e02b1bbb27bfa71553","observation_id":"24ec7ff0-ba23-41c7-be8f-c6a7f3505514","resolution":{"observed_at":"2026-08-04T10:51:44.228653Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9508027","last_updated":"1996-01-25T22:55:00Z","snapshot_observed_at":"2026-08-15T16:09:05.289270Z","submitted_at":"1995-08-30T14:11:00Z","title":"Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9508027","snapshot_observed_at":"2026-08-04T10:51:44.386026Z","title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:44.386026Z"},"links":{"cited_paper":"/paper/quant-ph/9508027","citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:d7c6fb53df7662877d0e28d69ecdb1d34740b3620b6b1b761c1833500351e58d","observation_id":"4d220264-50f1-4f48-8914-45ba809e2144","resolution":{"observed_at":"2026-08-04T10:51:44.386026Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1409.3305","last_updated":"2014-11-24T23:53:42Z","snapshot_observed_at":"2026-08-14T23:19:55.659277Z","submitted_at":"2014-09-11T03:09:21Z","title":"Fixed-point quantum search with an optimal number of queries","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1409.3305","snapshot_observed_at":"2026-08-04T10:51:44.498651Z","title":"Yoder, Guang Hao Low, and Isaac L","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-04T10:51:44.498651Z"},"links":{"cited_paper":"/paper/1409.3305","citing_paper":"/paper/2510.08473"},"observation_digest":"sha256:2a7d371db1d824f68bf132cc082c10b8c44333f4d8d31b34c7649e47c7abca75","observation_id":"599b9be0-0b47-4ef2-934f-59b698e3a7d7","resolution":{"observed_at":"2026-08-04T10:51:44.498651Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.08473","last_updated":"2026-07-07T11:12:24Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-09T09:43:54.273301Z","submitted_at":"2025-10-09T17:13:07Z","title":"An Improved Quantum Algorithm for 3-Tuple Lattice Sieving"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":41,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":41},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2510.08473."}