{"as_of":"2026-08-17T17:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:996168e2ae7eaf98f64219a966192ed2c263cda8ab3cf4f3579822dc233bea10","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-17T06:30:58.91139+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-15T18:20:12.057766Z","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-07-02T08:26:48.245348Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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-15T18:20:12.057766Z","title":"BPHSPACE(S)⊆ DSPACE(S3/2)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.18796","last_updated":"2025-07-24T20:33:26Z","snapshot_observed_at":"2026-08-15T18:05:45.074520Z","submitted_at":"2025-07-24T20:33:26Z","title":"Unconditional Pseudorandomness against Shallow Quantum Circuits","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T18:20:12.057766Z"},"links":{"cited_paper":"/paper/2401.03703","citing_paper":"/paper/2507.18796"},"observation_digest":"sha256:a0c5dce345f508d943347c85d9b8c57fe394018a0c955a08cc109697b5a9bbd9","observation_id":"ef753dfe-21db-4750-a55c-d2bdb92beef0","resolution":{"observed_at":"2026-08-15T18:20:12.057766Z","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":{"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":"2401.03703","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.03703","snapshot_observed_at":"2026-07-02T08:26:48.245348Z","title":"Regev, J","venue":null,"work_id":"81df9e1b-50bc-4c28-9ae9-83bd5db20561","year":2009},"citing_paper":{"arxiv_id":"2606.04843","last_updated":"2026-06-03T13:12:15Z","snapshot_observed_at":"2026-08-07T11:35:40.952968Z","submitted_at":"2026-06-03T13:12:15Z","title":"Decoded Quantum Interferometry Beyond Hamming: Rank-Metric and Translation Association Schemes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T06:02:55.755142Z"},"links":{"cited_paper":"/paper/2401.03703","citing_paper":"/paper/2606.04843"},"observation_digest":"sha256:a78870aa68a3a73ad4d72b0ac72cb50086a62dc022b48465570bce48e414507d","observation_id":"27a4a1f5-9c17-4e19-87b3-b2231f2b9aa6","resolution":{"observed_at":"2026-07-02T08:26:48.246811Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2401.03703/citation-record","integrity":"/paper/2401.03703/integrity","json":"/paper/2401.03703/citation-record.json","paper":"/paper/2401.03703"},"outbound":[],"paper":{"arxiv_id":"2401.03703","last_updated":"2024-01-08T07:14:54Z","latest_version":1,"primary_category":"cs.CR","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"},"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-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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2401.03703."}