{"as_of":"2026-08-19T19:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5280f17e7044be917a4801b503e94e9b0f4e3f3d1325757050bb3b66170a3242","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T22:04:05.674035Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"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-15T14:53:37.671796Z","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-15T14:53:37.733189Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"cited_work":{"arxiv_id":"2607.04045","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.04045","snapshot_observed_at":"2026-08-15T14:53:37.733189Z","title":"SOGRAND decoding of LDPC codes","venue":"cs.IT","work_id":"5e69f7bc-060b-474f-8887-2f6a4dfad692","year":2026},"citing_paper":{"arxiv_id":"2608.04068","last_updated":"2026-08-04T15:37:53Z","snapshot_observed_at":"2026-08-19T05:11:12.594598Z","submitted_at":"2026-08-04T15:37:53Z","title":"Tail-Calibrated Soft-Output GRAND for Finite-Memory Noise-Effect Posteriors","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T14:53:37.671796Z"},"links":{"cited_paper":"/paper/2607.04045","citing_paper":"/paper/2608.04068"},"observation_digest":"sha256:9c8998f61af90bb2c7c0e9ff14d5cdde3b2c49710a5a25da2fda17675fce15e6","observation_id":"7e056cbb-8487-4fd3-8baa-6bae1e15df49","resolution":{"observed_at":"2026-08-15T14:53:37.739622Z","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/2607.04045/citation-record","integrity":"/paper/2607.04045/integrity","json":"/paper/2607.04045/citation-record.json","paper":"/paper/2607.04045"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Channel coding: The road to channel capacity,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:dca6712cc4a81802101a9052bb909c5d9717ab90d8c6ce83c928a7ea5f7a8b05","observation_id":"e3c20eb6-771e-42a4-9a60-6d57a22fda28","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Richardson and R","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:e8001fd5cd4d4d0bb714dae6071da439b111c7f8913b4c6145471c52214a82e7","observation_id":"f0ac0292-f1e0-4014-b7a4-934c69d957e2","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:f369529316d29cc9a829d2ced0abb1078ef3ae00a1ff26b0979a66ce86850570","observation_id":"d2b6cc52-e563-40fa-be29-7155b33edf48","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Near Shannon limit error-correcting coding and decoding: Turbo-codes,","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:e1456359653b87542b59b5c74ba85561358be741383c8de69497b76d91b7aa7d","observation_id":"da15feab-11dc-40ad-856e-0852655f51ce","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Low-density parity-check codes,","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:67754c15ef0eded3bfbff0380253d3b1e50d8e7b1786b1455bed752d772a6ffc","observation_id":"0880ca65-bf2d-4ba4-b9c6-c3b62e400f67","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Near Shannon limit performance of low density parity check codes,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:8be23afa17f0aa3a52e37816485d470c17da594afba31c2a834af749290eb054","observation_id":"23e5fe4c-f62b-44b8-b51b-f345d34f7fa8","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"The capacity of low-density parity- check codes under message-passing decoding,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:c643e2ea004003513476bae519c3e88644efc2b5c7727d183e44cc083e9a9dd7","observation_id":"fee094d1-3823-43c6-9867-103052751b2e","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Efficient encoding of low-density parity-check codes,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:5a4e1b3375cad354279b9743f4a55547ebad437294062098e4ecd56ff80e2440","observation_id":"966cc853-c184-4d60-8373-229e19bf8bbe","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:3ec7e5075246789f119ba0a81ed7f91a0ff3721067a16975990c75edd962898a","observation_id":"34288288-c00a-4a44-8d72-a4329fee36d1","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"High-throughput LDPC de- coders,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:a4d96cde3f5e11df8451cc26e5762770bca6fede471d34a4db9eb1647f1c6d09","observation_id":"e9325ec9-5275-4c9b-8be2-5ca6a75c8d02","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Design of low-density parity check codes for 5G new radio,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:dd82bdcb7ac714aef656ec2b154cfebcad66343163d61b4eba099475efa60e96","observation_id":"31d06d57-0948-425b-85a3-805577b186a6","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Near-optimum decoding of product codes: block turbo codes,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:90c8c1be0aa3cd63043d41fe11779c56e603cb0de0b1cc4be65b8819bc050e50","observation_id":"e715681c-c598-4535-9afc-8046f7e75eef","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Channel coding toward 6G: Technical overview and outlook,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:3d8cb107cf5ad80045b1fc4260a6f21901c07f0f54bb4a4211121758c911ff5c","observation_id":"dfe87dd3-864f-47d5-b6b6-28db2a6806de","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Staircase Codes: FEC for 100 Gb/s OTN,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:5db2a5531c8b651b4e476b484904f0281fd60af78b22ddfa7e404c8eccfadcae","observation_id":"25b25e4f-832c-4e34-90d4-77e86cc7d317","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"An efficient 10GBASE-T ethernet LDPC decoder design with low error floors,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:6baeb3cd83d5791cb3be35abef0480ff78769132c18efe3f2d9d0955550f0e1c","observation_id":"923d0f34-0ca3-4da3-b01f-84901be52eed","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"A survey of FPGA-based LDPC decoders,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:7d44c5c2d8ad55ab3417347b90d0211eae4155e27a65c8ca49122450413c0baf","observation_id":"3a59827c-6b66-4045-9d3b-7b8ec561341a","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Multi-mode qc-ldpc decoding architecture with novel memory access scheduling for 5g new-radio standard,","venue":null,"work_id":null,"year":2035},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:b20847fa5f53467f9aacb43485c1ef625d3c5ca38a379c510de4ae5705343eae","observation_id":"ff2f74a3-97dc-4194-a4a8-5e54ca6196be","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Area-efficient QC- LDPC decoding architecture with thermometer code-based sorting and relative quasi-cyclic shifting,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:bd9abdc81e34f18bed8356b26b12eb75b717c1eb6a547fdc096f97b51e86b8f9","observation_id":"10b1f880-7971-4eb2-bf5b-1ac9ebb03813","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"A generalized adjusted min-sum decoder for 5G LDPC codes: Algorithm and implementation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:76497edc24d225a297e231c7ca6694785cde15aad218ea3e2e847cdf5840274d","observation_id":"1f8a1cee-10ca-4d34-973b-81252ab7ac58","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Soft-output (SO) GRAND and iterative decoding to outperform LDPC codes,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:b4196f6ad5bfdeef95b7a2146d3f285c6e1a9f854159537193cf983f21d92edd","observation_id":"9b25abf6-1cb7-4bf3-8ee4-11e84e6f7152","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Capacity-achieving guessing random additive noise decoding,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:30b9774d49fd61becff45af29f6cb6fa40ffe7b0287d9c42dc9d4222c984d0bc","observation_id":"590b46fd-9c5e-4846-872b-fa368c977414","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Guessing random additive noise decoding for digital data communication,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:7f376eafa4ac19ff467ed44a9af822c020228cf9bf8f1df399d2b24fe55c1bcf","observation_id":"cf54e6fb-4d5f-402b-986e-685be318a986","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Soft maximum likelihood decoding using GRAND,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:015a1c287a29dfea589205bcb49da079a8c9e31347155b55fd791217682c47ce","observation_id":"f67fafec-fe77-4d57-83aa-c1a4bae1bb6b","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Ordered reliability bits guessing random additive noise decoding,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:dc0d43a5e68f3abdff5c0ee2ab387e6f16abab100e6db114a52b4d7c56d5b781","observation_id":"a9f2ba86-14f0-4e3a-9aca-1dc0dfdfee9d","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"List-GRAND: A practical way to achieve maximum likelihood decoding,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:3162cdbdc511a7b57fdca337d44a83c6d55512cbed9b93009a113f0236204418","observation_id":"8bdec9da-d289-4129-98b6-5be143f2fdeb","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Keep the bursts and ditch the interleavers,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:7fee4ad1d2162cec7b046d0795e7c3e696231aa1e3315414e0b48e6cd55006c6","observation_id":"83c87f89-6abe-42bd-9806-2f00a924101e","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Symbol-level GRAND for high- order modulation over block fading channels,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:25ec07d39992eca9959b879a49d30ecfa215887da50571613d5d41c532b1074b","observation_id":"1f81086e-7ff6-434d-8c9c-8c424f6273a6","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Using channel correlation to improve decoding – ORBGRAND-AI,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:6fb9ed7dbf12cbf45939805c59797eb27b23250487b36cb84a3fde8b2a1ff21b","observation_id":"43fda76a-3dd1-4605-917b-e14ed56a003a","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Guessing random additive noise decoding of network coded data transmitted over burst error channels,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:6f5037dfcd7efde26572b62287e1f8588df39d4d74ad03715f41236fd4c16087","observation_id":"4239dba3-273b-48dd-ad78-f1d98cb69326","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Improved step-GRAND: low-latency soft-input guessing random additive noise decoding,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:bd42d83bd5f565b4e1a5d6046c971236ed050907dce27b10301ff04cb98cde46","observation_id":"e2a66a72-7848-4c93-b45d-a3ef2abe9210","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Segmented GRAND: complexity reduction through sub-pattern combination,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:bbc5a270d7b1ca8b4ffd934edc27a9a106c1881c20060855c52120405c96d1a8","observation_id":"4841f64b-500e-4746-9773-e81363187b95","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Multi-code multi-rate universal maximum likelihood decoder using GRAND,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:dac7fd99c6a5ae9e26d979ad8c057a562ca5d2b99bcffe53737912c4f8897056","observation_id":"d255b37c-baba-44f8-a31f-e00c60fc9450","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"A GRANDAB decoder with 8.48 Gbps worst-case throughput in 65nm CMOS,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:40723e5c602e384637acdc5eee3cccec9a5a0c9f2ad42ec44cd359cd10c1dccc","observation_id":"30ac0f50-9ce7-4b39-8ad5-196f950eae19","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"A sub-0.8-pJ/bit universal soft- detection decoder using ORBGRAND,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:22626d319e8eddcf603cc57144f49fe08efe283e7ca5547bca887426234138c0","observation_id":"30bf4a89-bfaf-4ed0-969e-99da89617128","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Low-latency modulation- and correlation-adaptive ORBGRAND-AI decoder,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:4131c7dc5197782fb37fa668e220ba7206b3a8b5a39367f8747bdd16c96bd684","observation_id":"2d0fea16-70fc-4dd2-8d66-ef7949d64c00","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"High-Throughput and Energy-Efficient VLSI Architecture for Ordered Reliability Bits GRAND,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:d75bff45793bbf10374a66c65228b5186793a84bc698a5633bf6c5dfa78d1dca","observation_id":"f497b343-eeef-4471-9275-d0e720be46ba","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"A fixed latency ORBGRAND decoder architecture with LUT-aided error-pattern scheduling,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:caa6408fd073b908f0c5701032d16424871b344b8f91c245bf75a6ab1cfec147","observation_id":"c34683c5-ec6b-4e38-b3c7-a736fa5a95df","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"An efficient hard-detection grand decoder for systematic linear block codes,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:9a709f13bf32742e5fcd47e90dded5b43354b76ad371369394982ef74533edeb","observation_id":"72089a0f-5e6a-4d42-9b6b-f205a48889bb","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Efficient ORBGRAND implementation with parallel noise sequence generation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:3d8ade4c3a07268c0529688b541f15c5b2a37c679b1f00bd3ba6ef38d412475f","observation_id":"77350168-53b8-4010-beb6-51ba7eefe63a","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Exponential error bounds for erasure, list, and decision feedback schemes,","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:49bfa9c45c889e255808598194281764954677ea0c085de97188b0a60a970107","observation_id":"c068dc67-0612-4eff-bd44-8a63a6f422dc","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Guessing what, noise or codeword?","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:088b097f867f39ac6f613f26192b297888ae5b090bd1391ca784ccfdbee2c951","observation_id":"3b12da49-282d-4d9b-9a2a-9464df6e99a4","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Soft-output guessing codeword decoding,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:3b5ad0716a734f9f26986bdbb84d0310f2ccbe7f6aaa2ae5b21d7f3c02dc6dab","observation_id":"166f43e4-bff9-45b4-a2a4-552e3ff149fb","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Soft-output successive can- cellation list decoding,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:7fb40ae1188b03de34c581ed07c4693ca88172cb81c0a3ea004116de6262b029","observation_id":"bf3183a1-de34-492c-b4e2-d00aa9f55af8","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Soft-output from covered space decoding of product codes,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:e45a299e12a53ab1d5db25fba6a271025678490f765d01563c42cb8e34cbaad5","observation_id":"59cb6780-ad37-4df6-8f44-3de18a102fa8","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Soft output threshold-guided CRC decoding with SOGRAND in 40nm CMOS,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:e2b4a464fe97916c011b3bf232b10907d0a514623c769c78e470bf8d95a3fcdb","observation_id":"e3da1eb0-aab3-4bcd-a06d-92769715f850","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.16677","last_updated":"2025-03-20T19:50:55Z","snapshot_observed_at":"2026-08-19T16:27:21.738715Z","submitted_at":"2025-03-20T19:50:55Z","title":"Leveraging Code Structure to Improve Soft Output for GRAND, GCD, OSD, and SCL","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.16677","snapshot_observed_at":"2026-07-11T22:04:05.674035Z","title":"Leveraging code struc- ture to improve soft output for GRAND, GCD, OSD, and SCL,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-11T22:04:05.674035Z"},"links":{"cited_paper":"/paper/2503.16677","citing_paper":"/paper/2607.04045"},"observation_digest":"sha256:54ae3fe66cc3b5d11a22fc206ecee83c88973872040fb6d556bcee4d7590bbde","observation_id":"dcc65e12-dfe5-4be2-bf81-186643538b8c","resolution":{"observed_at":"2026-07-11T22:04:05.674035Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.04045","last_updated":"2026-07-04T22:09:47Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-13T05:00:26.349641Z","submitted_at":"2026-07-04T22:09:47Z","title":"SOGRAND decoding of LDPC codes"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":46,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":46},"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 46 of 46 outbound references and 1 inbound Pith citation observation for arXiv:2607.04045."}