{"as_of":"2026-08-08T21:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:487288a49c75eac950ae54522bbcbc82c54599a92c3c9bd6187ab7c4baedd962","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:26:46.116147Z","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-07T10:26:46.170437Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2202.07736","last_updated":"2022-02-15T21:30:39Z","snapshot_observed_at":"2026-08-04T15:38:17.654748Z","submitted_at":"2022-02-15T21:30:39Z","title":"Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes","version":1},"cited_work":{"arxiv_id":"2202.07736","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.07736","snapshot_observed_at":"2026-08-07T10:26:46.170437Z","title":"Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes","venue":"cs.CC","work_id":"a920d3ed-0fd2-42ef-9448-3092c83982c9","year":2022},"citing_paper":{"arxiv_id":"2506.05711","last_updated":"2025-06-06T03:23:54Z","snapshot_observed_at":"2026-08-07T10:11:17.348434Z","submitted_at":"2025-06-06T03:23:54Z","title":"A symmetric LWE-based Multi-Recipient Cryptosystem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T10:26:46.116147Z"},"links":{"cited_paper":"/paper/2202.07736","citing_paper":"/paper/2506.05711"},"observation_digest":"sha256:b724d6fbbc7932beeb14fd6d1fde17553fbd1fc3c1f3eeb59a32b5c405bb2d42","observation_id":"4fa00e14-bfa4-4fb8-a2a4-02b468a3cb5f","resolution":{"observed_at":"2026-08-07T10:26:46.176596Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2202.07736/citation-record","integrity":"/paper/2202.07736/integrity","json":"/paper/2202.07736/citation-record.json","paper":"/paper/2202.07736"},"outbound":[],"paper":{"arxiv_id":"2202.07736","last_updated":"2022-02-15T21:30:39Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-04T15:38:17.654748Z","submitted_at":"2022-02-15T21:30:39Z","title":"Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2202.07736."}