{"as_of":"2026-08-15T00:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4f5a9b2f18cddeff472fc6c742ef4ed075b147e558e9a5e6d9122cea1487d428","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-14T06:32:32.682623+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-01T12:53:27.551431Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-10T09:43:48.820229Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.15394","last_updated":"2025-04-21T19:00:24Z","snapshot_observed_at":"2026-08-07T16:00:27.894749Z","submitted_at":"2025-04-21T19:00:24Z","title":"Capacity on BMS Channels via Code Symmetry and Nesting","version":1},"cited_work":{"arxiv_id":"2504.15394","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.15394","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Capacity on BMS channels via code symmetry and nesting","venue":null,"work_id":"61819de9-d3c0-41ec-a251-26b7a43a81bc","year":2025},"citing_paper":{"arxiv_id":"2604.15295","last_updated":"2026-04-16T17:55:50Z","snapshot_observed_at":"2026-08-11T14:17:12.856591Z","submitted_at":"2026-04-16T17:55:50Z","title":"Reed--Muller Codes Achieve the Symmetric Capacity on Finite-State Channels","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-10T09:43:00.976046Z"},"links":{"cited_paper":"/paper/2504.15394","citing_paper":"/paper/2604.15295"},"observation_digest":"sha256:868f6b94dc914ff6331a3274676b398b8e295dfda0391eae96b5785e0139124e","observation_id":"39682bf8-dfb3-4da1-b377-fe589369e85b","resolution":{"observed_at":"2026-05-10T09:43:48.823152Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2504.15394","last_updated":"2025-04-21T19:00:24Z","snapshot_observed_at":"2026-08-07T16:00:27.894749Z","submitted_at":"2025-04-21T19:00:24Z","title":"Capacity on BMS Channels via Code Symmetry and Nesting","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.15394","snapshot_observed_at":"2026-07-13T01:48:59.942574Z","title":"Capacity on BMS channels via code symmetry and nesting,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09602","last_updated":"2026-07-10T16:55:44Z","snapshot_observed_at":"2026-08-13T02:23:37.296024Z","submitted_at":"2026-07-10T16:55:44Z","title":"Density Evolution of Soft-Decision Collapsed Projection-Aggregation Decoding for Reed-Muller Codes over the BIAWGN Channel","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-13T01:48:59.942574Z"},"links":{"cited_paper":"/paper/2504.15394","citing_paper":"/paper/2607.09602"},"observation_digest":"sha256:f8b4c3289107d10f2bb49df295d6794fe45da965f5a4369ce9d1741aae4ef0b9","observation_id":"22f5852b-e06e-4d6a-9f06-a7cc57b3d5d1","resolution":{"observed_at":"2026-07-13T01:48:59.942574Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.15394","last_updated":"2025-04-21T19:00:24Z","snapshot_observed_at":"2026-08-07T16:00:27.894749Z","submitted_at":"2025-04-21T19:00:24Z","title":"Capacity on BMS Channels via Code Symmetry and Nesting","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.15394","snapshot_observed_at":"2026-08-01T12:53:27.551431Z","title":"arXiv preprint arXiv:2504.15394 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:27.551431Z"},"links":{"cited_paper":"/paper/2504.15394","citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:9742ee608b0e895fbc94f44719ec30f4bab83770394d72896de0ead8894c636d","observation_id":"ad5161d0-32c4-4d8c-a342-6454fcd9be3b","resolution":{"observed_at":"2026-08-01T12:53:27.551431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.15394/citation-record","integrity":"/paper/2504.15394/integrity","json":"/paper/2504.15394/citation-record.json","paper":"/paper/2504.15394"},"outbound":[],"paper":{"arxiv_id":"2504.15394","last_updated":"2025-04-21T19:00:24Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-07T16:00:27.894749Z","submitted_at":"2025-04-21T19:00:24Z","title":"Capacity on BMS Channels via Code Symmetry and Nesting"},"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 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2504.15394."}