{"as_of":"2026-08-14T20:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:16a106ef4f35667567dcf4ff0b0036505d789c62cd3d0a04fad1cf488a296ad8","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-14T06:32:32.682623+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-08T13:16:44.949130Z","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-08T13:16:45.091713Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1302.2261","last_updated":"2013-07-09T23:48:20Z","snapshot_observed_at":"2026-07-06T03:06:03.997370Z","submitted_at":"2013-02-09T19:41:59Z","title":"On the list decodability of random linear codes with large error rates","version":3},"cited_work":{"arxiv_id":"1302.2261","doi":null,"metadata_source":"pith","pith_arxiv_id":"1302.2261","snapshot_observed_at":"2026-08-08T13:16:45.091713Z","title":"On the list decodability of random linear codes with large error rates","venue":"cs.IT","work_id":"0c848572-8979-4773-9b52-572311510536","year":2013},"citing_paper":{"arxiv_id":"2502.07308","last_updated":"2025-02-11T07:11:29Z","snapshot_observed_at":"2026-08-13T18:26:40.702706Z","submitted_at":"2025-02-11T07:11:29Z","title":"Explicit Codes approaching Generalized Singleton Bound using Expanders","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-08T13:16:44.949130Z"},"links":{"cited_paper":"/paper/1302.2261","citing_paper":"/paper/2502.07308"},"observation_digest":"sha256:e4873b9b9821607a480d3a586174e139fd0325e25dabdefe5dd9664fd2fca179","observation_id":"b9b18eee-2f71-4f52-b51b-bbc0e6af40f4","resolution":{"observed_at":"2026-08-08T13:16:45.096536Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1302.2261/citation-record","integrity":"/paper/1302.2261/integrity","json":"/paper/1302.2261/citation-record.json","paper":"/paper/1302.2261"},"outbound":[],"paper":{"arxiv_id":"1302.2261","last_updated":"2013-07-09T23:48:20Z","latest_version":3,"primary_category":"cs.IT","snapshot_observed_at":"2026-07-06T03:06:03.997370Z","submitted_at":"2013-02-09T19:41:59Z","title":"On the list decodability of random linear codes with large error rates"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1302.2261."}