{"as_of":"2026-08-16T20:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b38a126694e899bd6bd66825c1905dcc84d4f06d94c8a1bfd1df52d3bc8db481","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-16T06:30:59.297886+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-16T11:34:52.383213Z","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-07-08T19:55:33.860027Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.05748","last_updated":"2025-02-26T02:02:12Z","snapshot_observed_at":"2026-08-16T12:59:22.560018Z","submitted_at":"2025-01-10T06:44:08Z","title":"From Bit to Block: Decoding on Erasure Channels","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.05748","snapshot_observed_at":"2026-08-16T11:34:52.383213Z","title":"From bit to bloc k: Decoding on erasure channels,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.15394","last_updated":"2025-04-21T19:00:24Z","snapshot_observed_at":"2026-08-16T11:25:29.150741Z","submitted_at":"2025-04-21T19:00:24Z","title":"Capacity on BMS Channels via Code Symmetry and Nesting","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T11:34:52.383213Z"},"links":{"cited_paper":"/paper/2501.05748","citing_paper":"/paper/2504.15394"},"observation_digest":"sha256:935b5a7f778a8d83b5d4bd3d77ac7303f2abe506fee2df67c72eab2d38d6774f","observation_id":"9b8c867b-da9c-412f-a70f-ddd3898d331a","resolution":{"observed_at":"2026-08-16T11:34:52.383213Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.05748","last_updated":"2025-02-26T02:02:12Z","snapshot_observed_at":"2026-08-16T12:59:22.560018Z","submitted_at":"2025-01-10T06:44:08Z","title":"From Bit to Block: Decoding on Erasure Channels","version":2},"cited_work":{"arxiv_id":"2501.05748","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.05748","snapshot_observed_at":"2026-07-08T19:55:33.860027Z","title":"From Bit to Block: Decoding on Erasure Channels","venue":"cs.IT","work_id":"a40d1634-08d1-4c75-a399-511be1f3e931","year":2025},"citing_paper":{"arxiv_id":"2607.05816","last_updated":"2026-07-18T12:18:09Z","snapshot_observed_at":"2026-08-06T22:42:05.992423Z","submitted_at":"2026-07-07T04:27:44Z","title":"From Bit to Block: Capacity Achievement via Code Concatenation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-08T19:52:42.129227Z"},"links":{"cited_paper":"/paper/2501.05748","citing_paper":"/paper/2607.05816"},"observation_digest":"sha256:868bfa94e8e2534eac1f7e93bbec9cc80e7d00c28f818cd0aaf1e55757fc942b","observation_id":"ff6b6d42-56df-46d1-bd21-06146edf779f","resolution":{"observed_at":"2026-07-08T19:55:33.861237Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.05748","last_updated":"2025-02-26T02:02:12Z","snapshot_observed_at":"2026-08-16T12:59:22.560018Z","submitted_at":"2025-01-10T06:44:08Z","title":"From Bit to Block: Decoding on Erasure Channels","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.05748","snapshot_observed_at":"2026-08-02T08:36:08.639618Z","title":"From bit to block: Decoding on erasure channels,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.05816","last_updated":"2026-07-18T12:18:09Z","snapshot_observed_at":"2026-08-06T22:42:05.992423Z","submitted_at":"2026-07-07T04:27:44Z","title":"From Bit to Block: Capacity Achievement via Code Concatenation","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T08:36:08.639618Z"},"links":{"cited_paper":"/paper/2501.05748","citing_paper":"/paper/2607.05816"},"observation_digest":"sha256:6b13762bed663569ace6976854d3451f71bfff626baa91a6342280c279616d16","observation_id":"c6345462-28f9-42e6-a838-b67e79ba2d00","resolution":{"observed_at":"2026-08-02T08:36:08.639618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.05748/citation-record","integrity":"/paper/2501.05748/integrity","json":"/paper/2501.05748/citation-record.json","paper":"/paper/2501.05748"},"outbound":[],"paper":{"arxiv_id":"2501.05748","last_updated":"2025-02-26T02:02:12Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T12:59:22.560018Z","submitted_at":"2025-01-10T06:44:08Z","title":"From Bit to Block: Decoding on Erasure Channels"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2501.05748."}