{"as_of":"2026-08-12T22:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:033d732282d099be573516e1493202d53a5c13d9dd80d11393f1b6bbfe38d9b1","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T20:26:29.913987Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-05T23:39:43.449005Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1412.7994","last_updated":"2015-09-15T17:47:49Z","snapshot_observed_at":"2026-07-06T04:04:45.963762Z","submitted_at":"2014-12-26T21:36:03Z","title":"Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.7994","snapshot_observed_at":"2026-08-07T20:26:29.913987Z","title":"Solving the Short- est Vector Problem in 2 n Time via Discrete Gaussian Sampling,","venue":null,"work_id":null,"year":2015},"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":10,"source":"pdf_text","source_observed_at":"2026-08-07T20:26:29.913987Z"},"links":{"cited_paper":"/paper/1412.7994","citing_paper":"/paper/2502.09820"},"observation_digest":"sha256:e7d833134f8963afb755b169bea7d506259a95b60591e869d0118facc87bca4a","observation_id":"5c442ea2-9a06-403e-964f-1ea069751c05","resolution":{"observed_at":"2026-08-07T20:26:29.913987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.7994","last_updated":"2015-09-15T17:47:49Z","snapshot_observed_at":"2026-07-06T04:04:45.963762Z","submitted_at":"2014-12-26T21:36:03Z","title":"Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling","version":5},"cited_work":{"arxiv_id":"1412.7994","doi":null,"metadata_source":"pith","pith_arxiv_id":"1412.7994","snapshot_observed_at":"2026-08-05T23:39:43.449005Z","title":"Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling","venue":"cs.DS","work_id":"4a51279a-e721-414f-8e7e-0cafe68f095c","year":2014},"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":2015,"source":"pdf_text","source_observed_at":"2026-08-05T23:39:42.903360Z"},"links":{"cited_paper":"/paper/1412.7994","citing_paper":"/paper/2608.03220"},"observation_digest":"sha256:0bbd2b7aea729565820fff7747e8def65174e727745df057b61db059365131e4","observation_id":"ffbd6501-d373-43ce-b6aa-b8e0e83d2dc7","resolution":{"observed_at":"2026-08-05T23:39:43.454744Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1412.7994/citation-record","integrity":"/paper/1412.7994/integrity","json":"/paper/1412.7994/citation-record.json","paper":"/paper/1412.7994"},"outbound":[],"paper":{"arxiv_id":"1412.7994","last_updated":"2015-09-15T17:47:49Z","latest_version":5,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T04:04:45.963762Z","submitted_at":"2014-12-26T21:36:03Z","title":"Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1412.7994."}