{"as_of":"2026-08-13T05:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1fd4b786a72d611b7547b253a135041563c0db985e1cd2131a57ce22861c76a0","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-12T06:34:41.77262+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-11T04:16:21.710491Z","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-12T10:51:29.889134Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.01728","last_updated":"2025-04-02T13:37:29Z","snapshot_observed_at":"2026-08-07T16:14:37.211295Z","submitted_at":"2025-04-02T13:37:29Z","title":"Linear Time Iterative Decoders for Hypergraph-Product and Lifted-Product Codes","version":1},"cited_work":{"arxiv_id":"2504.01728","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.01728","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Linear time iterative decoders for hypergraph-product and lifted-product codes","venue":null,"work_id":"89e8498a-4e98-4b0f-8e8e-4d342ae045c1","year":2025},"citing_paper":{"arxiv_id":"2605.03218","last_updated":"2026-05-04T23:16:16Z","snapshot_observed_at":"2026-08-10T22:28:05.872027Z","submitted_at":"2026-05-04T23:16:16Z","title":"Edge-Based Anisotropic Decoding for Generalized Bicycle Codes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-08T18:01:02.695918Z"},"links":{"cited_paper":"/paper/2504.01728","citing_paper":"/paper/2605.03218"},"observation_digest":"sha256:1b976989dfd95f85ea75a1af9fad64be68cb3e5f3d4c54c4a2bb74fbb1542f29","observation_id":"7196dc6a-b651-484d-9b0f-baa627ce17ac","resolution":{"observed_at":"2026-05-12T10:51:29.891201Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01728","last_updated":"2025-04-02T13:37:29Z","snapshot_observed_at":"2026-08-07T16:14:37.211295Z","submitted_at":"2025-04-02T13:37:29Z","title":"Linear Time Iterative Decoders for Hypergraph-Product and Lifted-Product Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.01728","snapshot_observed_at":"2026-07-11T07:07:39.359688Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.05386","last_updated":"2026-07-09T17:58:26Z","snapshot_observed_at":"2026-08-08T13:08:36.166528Z","submitted_at":"2026-07-06T17:56:55Z","title":"Logical Spectroscopy: Lifted-Product Codes with Addressable Bases","version":2},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-07-11T07:07:39.359688Z"},"links":{"cited_paper":"/paper/2504.01728","citing_paper":"/paper/2607.05386"},"observation_digest":"sha256:72c941728f9b2378efbe336941bd0c65e882fbee7a0c1f8e6083f2bf3684972b","observation_id":"8e75682c-99a5-4c7c-9b23-e5548719ebd1","resolution":{"observed_at":"2026-07-11T07:07:39.359688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.01728","last_updated":"2025-04-02T13:37:29Z","snapshot_observed_at":"2026-08-07T16:14:37.211295Z","submitted_at":"2025-04-02T13:37:29Z","title":"Linear Time Iterative Decoders for Hypergraph-Product and Lifted-Product Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.01728","snapshot_observed_at":"2026-08-11T04:16:21.710491Z","title":"Linear Time Iterative Decoders for Hypergraph-Product and Lifted -Product Codes,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.07783","last_updated":"2026-08-07T22:06:41Z","snapshot_observed_at":"2026-08-13T05:11:34.578749Z","submitted_at":"2026-08-07T22:06:41Z","title":"Multistage Rewinding Decoder for QLDPC Codes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T04:16:21.710491Z"},"links":{"cited_paper":"/paper/2504.01728","citing_paper":"/paper/2608.07783"},"observation_digest":"sha256:d25c15833059bc105c5030de9f891615db645af9e189c9d1774674fef1492df8","observation_id":"3e02c8bd-bc8b-4e32-83b2-2e25a7414778","resolution":{"observed_at":"2026-08-11T04:16:21.710491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.01728/citation-record","integrity":"/paper/2504.01728/integrity","json":"/paper/2504.01728/citation-record.json","paper":"/paper/2504.01728"},"outbound":[],"paper":{"arxiv_id":"2504.01728","last_updated":"2025-04-02T13:37:29Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-07T16:14:37.211295Z","submitted_at":"2025-04-02T13:37:29Z","title":"Linear Time Iterative Decoders for Hypergraph-Product and Lifted-Product 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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2504.01728."}