{"as_of":"2026-08-17T07:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:12c025495b727d8b35971128d603272241fd2d85264f616b0bf89a0acf8cbba0","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-16T05:45:51.779323Z","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-08T17:54:42.248728Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.13877","last_updated":"2025-02-27T19:23:37Z","snapshot_observed_at":"2026-08-16T12:56:55.808876Z","submitted_at":"2025-02-19T17:02:36Z","title":"Near-Optimal List-Recovery of Linear Code Families","version":2},"cited_work":{"arxiv_id":"2502.13877","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.13877","snapshot_observed_at":"2026-08-08T17:54:42.248728Z","title":"Near-Optimal List-Recovery of Linear Code Families","venue":"cs.IT","work_id":"9f94dbee-d2cd-4cb1-87da-852a8c9cfa2d","year":2025},"citing_paper":{"arxiv_id":"2502.05858","last_updated":"2025-05-08T19:26:25Z","snapshot_observed_at":"2026-08-14T03:00:47.861872Z","submitted_at":"2025-02-09T11:34:54Z","title":"Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-08T17:54:42.168427Z"},"links":{"cited_paper":"/paper/2502.13877","citing_paper":"/paper/2502.05858"},"observation_digest":"sha256:8ed1f2f4bfa207554ec8ef8e5582e90f02ce938e9df5d4ad26a7d67161694a65","observation_id":"32a73985-d623-4745-be06-47333123db6e","resolution":{"observed_at":"2026-08-08T17:54:42.252837Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13877","last_updated":"2025-02-27T19:23:37Z","snapshot_observed_at":"2026-08-16T12:56:55.808876Z","submitted_at":"2025-02-19T17:02:36Z","title":"Near-Optimal List-Recovery of Linear Code Families","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13877","snapshot_observed_at":"2026-08-16T05:45:51.779323Z","title":"Near-optimal list-recovery of linear code families","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.20333","last_updated":"2025-07-17T16:20:01Z","snapshot_observed_at":"2026-08-16T05:29:29.404518Z","submitted_at":"2025-04-29T00:53:34Z","title":"List Decoding Expander-Based Codes up to Capacity in Near-Linear Time","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-16T05:45:51.779323Z"},"links":{"cited_paper":"/paper/2502.13877","citing_paper":"/paper/2504.20333"},"observation_digest":"sha256:b55ff1cbb635ea5bd46526600d7ae4f8e02abc5d55fd07ffcf6c62dc661629ad","observation_id":"11823244-9645-457b-845d-b7c9c21d38d0","resolution":{"observed_at":"2026-08-16T05:45:51.779323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13877","last_updated":"2025-02-27T19:23:37Z","snapshot_observed_at":"2026-08-16T12:56:55.808876Z","submitted_at":"2025-02-19T17:02:36Z","title":"Near-Optimal List-Recovery of Linear Code Families","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.13877","snapshot_observed_at":"2026-08-15T23:07:01.157645Z","title":"Near-optimal list-recovery of linear code families, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.05935","last_updated":"2025-05-09T10:26:12Z","snapshot_observed_at":"2026-08-17T05:01:02.807040Z","submitted_at":"2025-05-09T10:26:12Z","title":"List-Recovery of Random Linear Codes over Small Fields","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T23:07:01.157645Z"},"links":{"cited_paper":"/paper/2502.13877","citing_paper":"/paper/2505.05935"},"observation_digest":"sha256:968e3d2aff8dda083bdc64040a2eaddb4f511fa77b8f1bd11bef0873ebf88a5a","observation_id":"6de8bfba-123e-4333-86a6-32b0d4923005","resolution":{"observed_at":"2026-08-15T23:07:01.157645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.13877/citation-record","integrity":"/paper/2502.13877/integrity","json":"/paper/2502.13877/citation-record.json","paper":"/paper/2502.13877"},"outbound":[],"paper":{"arxiv_id":"2502.13877","last_updated":"2025-02-27T19:23:37Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T12:56:55.808876Z","submitted_at":"2025-02-19T17:02:36Z","title":"Near-Optimal List-Recovery of Linear Code Families"},"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:2502.13877."}