{"as_of":"2026-08-13T14:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:35a49bdf7e707173c8fda927681c8b0b3ce0d3c3fc644e16b8834067c136cb0d","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T20:26:29.873675Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-23T18:35:46.209501Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.07955","last_updated":"2025-08-17T11:17:31Z","snapshot_observed_at":"2026-08-12T23:31:52.976915Z","submitted_at":"2020-02-19T01:38:34Z","title":"Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding","version":6},"cited_work":{"arxiv_id":"2002.07955","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.07955","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Improved classical and quan- tum algorithms for the shortest vector problem via bounded distance decoding","venue":null,"work_id":"ba43824d-655f-4e91-b1c3-bf2d4216305a","year":2002},"citing_paper":{"arxiv_id":"2410.13759","last_updated":"2025-02-17T22:16:30Z","snapshot_observed_at":"2026-08-12T16:32:47.255535Z","submitted_at":"2024-10-17T16:54:41Z","title":"On the practicality of quantum sieving algorithms for the shortest vector problem","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-23T18:34:16.823293Z"},"links":{"cited_paper":"/paper/2002.07955","citing_paper":"/paper/2410.13759"},"observation_digest":"sha256:4138ae6a867b7f01cb3b2603a1adefe705245b4337a47025d1cc19349366e127","observation_id":"76e23bf2-e594-4ecc-8e44-99cf2e881d40","resolution":{"observed_at":"2026-05-23T18:35:46.212330Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.07955","last_updated":"2025-08-17T11:17:31Z","snapshot_observed_at":"2026-08-12T23:31:52.976915Z","submitted_at":"2020-02-19T01:38:34Z","title":"Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.07955","snapshot_observed_at":"2026-08-07T20:26:29.873675Z","title":"Improved Classical and Quan- tum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2502.09820","last_updated":"2025-02-13T23:33:36Z","snapshot_observed_at":"2026-08-10T03:39:47.471825Z","submitted_at":"2025-02-13T23:33:36Z","title":"A Unified Framework for High-Dimensional Pure Root Lattices, Sphere Packing, and Cosmological Implications","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T20:26:29.873675Z"},"links":{"cited_paper":"/paper/2002.07955","citing_paper":"/paper/2502.09820"},"observation_digest":"sha256:07922c5353d25f57d76a7a43d06bfa8d3cb96012c5fd678d43878f65d359be9f","observation_id":"bf675563-e33c-4f20-9ba1-142e6c43556c","resolution":{"observed_at":"2026-08-07T20:26:29.873675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.07955","last_updated":"2025-08-17T11:17:31Z","snapshot_observed_at":"2026-08-12T23:31:52.976915Z","submitted_at":"2020-02-19T01:38:34Z","title":"Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.07955","snapshot_observed_at":"2026-08-05T23:39:42.898145Z","title":"[ADRS15] Divesh Aggarwal, Daniel Dadush, Oded Regev, and Noah Stephens-Davidowitz","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.03220","last_updated":"2026-08-04T06:53:28Z","snapshot_observed_at":"2026-08-11T18:04:40.087476Z","submitted_at":"2026-08-04T06:53:28Z","title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:42.898145Z"},"links":{"cited_paper":"/paper/2002.07955","citing_paper":"/paper/2608.03220"},"observation_digest":"sha256:2e1636de073b4843dff02cdec1b6bff753f1acc5e8e10e3da401c2f3915e4006","observation_id":"77658ccd-ad4a-4c2f-9129-39698c686470","resolution":{"observed_at":"2026-08-05T23:39:42.898145Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2002.07955/citation-record","integrity":"/paper/2002.07955/integrity","json":"/paper/2002.07955/citation-record.json","paper":"/paper/2002.07955"},"outbound":[],"paper":{"arxiv_id":"2002.07955","last_updated":"2025-08-17T11:17:31Z","latest_version":6,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T23:31:52.976915Z","submitted_at":"2020-02-19T01:38:34Z","title":"Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2002.07955."}