{"as_of":"2026-08-19T17:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9f2b26eda687e61ba0329533fd2feef8e2139bb22170fedfa5587447cb52becd","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-19T06:32:44.657259+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-11T20:10:57.946978Z","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-11T20:10:58.305754Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2012.04990","last_updated":"2020-12-17T12:01:59Z","snapshot_observed_at":"2026-08-19T15:21:14.605081Z","submitted_at":"2020-12-09T11:42:47Z","title":"Performance and Complexity of Sequential Decoding of PAC Codes","version":2},"cited_work":{"arxiv_id":"2012.04990","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.04990","snapshot_observed_at":"2026-08-11T20:10:58.305754Z","title":"Performance and Complexity of Sequential Decoding of PAC Codes","venue":"cs.IT","work_id":"f138e869-85c3-46d9-9f71-bf70723091c9","year":2020},"citing_paper":{"arxiv_id":"2412.06072","last_updated":"2025-08-14T16:52:55Z","snapshot_observed_at":"2026-08-19T08:31:50.365803Z","submitted_at":"2024-12-08T21:34:04Z","title":"PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T20:10:57.946978Z"},"links":{"cited_paper":"/paper/2012.04990","citing_paper":"/paper/2412.06072"},"observation_digest":"sha256:7eead41c38d6041b8636913fdd0b4c6c4bad924bd32a2eedc164a932ee8309c7","observation_id":"89b49125-63b4-4f0d-a27d-5896ef6d28a0","resolution":{"observed_at":"2026-08-11T20:10:58.311642Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2012.04990/citation-record","integrity":"/paper/2012.04990/integrity","json":"/paper/2012.04990/citation-record.json","paper":"/paper/2012.04990"},"outbound":[],"paper":{"arxiv_id":"2012.04990","last_updated":"2020-12-17T12:01:59Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-19T15:21:14.605081Z","submitted_at":"2020-12-09T11:42:47Z","title":"Performance and Complexity of Sequential Decoding of PAC 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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2012.04990."}