{"as_of":"2026-08-13T15:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e61ea793f0e34a91c4ca82d0a8eb4126131456e1e0c6b8ef33397a8571add8a8","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:54:33.021557Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.13876/citation-record","integrity":"/paper/2411.13876/integrity","json":"/paper/2411.13876/citation-record.json","paper":"/paper/2411.13876"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:54:32.967338Z","title":"Low-density parity-check codes,","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:32.967338Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:1f43ed3b47e8c239fae72cf6ce0359245588bfdba9827f1cdab263c65ffb1fc1","observation_id":"70a5882e-7f55-4727-8699-615f218bee83","resolution":{"observed_at":"2026-08-12T15:54:32.967338Z","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-08-12T15:54:32.970406Z","title":"Near shannon limit performance of low density parity check codes,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:32.970406Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:8f0bf7a5fc874b9b1aff426f056c69bf1c1a0efa26b3bac07f2e6f2c80f012e8","observation_id":"729244ac-9635-4fc4-9822-4d6d4ac73d16","resolution":{"observed_at":"2026-08-12T15:54:32.970406Z","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-08-12T15:54:32.972952Z","title":"Iterative soft decoding of Reed-Solomon codes,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:32.972952Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:99f87379554a7af69eeff95f2215ae42d171152f876b6711808200f5d5e69c79","observation_id":"4aec1860-f023-4795-a0b6-1ea423b7da67","resolution":{"observed_at":"2026-08-12T15:54:32.972952Z","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-08-12T15:54:32.976036Z","title":"Iterative soft-input soft-output decoding of Reed–Solomon codes by adapting the parity-check matrix,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:32.976036Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:c4def5a5553545aaeba6f429e276453a2083280588d866094b3f36db0a97f8b4","observation_id":"4023f810-9a2f-4090-98a1-54bf98c6c681","resolution":{"observed_at":"2026-08-12T15:54:32.976036Z","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-08-12T15:54:32.979118Z","title":"Random redundant soft-in soft-out decoding of linear block codes,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:32.979118Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:c17f0a7c171399134d4551579c7e2ea2839c473e2bab5b1dd4ada57cd86071b6","observation_id":"b232bea1-b6fb-48c0-8c75-3e15fe3e7c8a","resolution":{"observed_at":"2026-08-12T15:54:32.979118Z","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-08-12T15:54:32.981979Z","title":"Improved random redundant iterative hdpc decoding,","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:32.981979Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:b46e999d5ad6d9b84b96dc6c42067579bbe1c9800d8631c5ec5cd39154735690","observation_id":"1afb489a-74ac-4f03-b4e2-65a9807f04e3","resolution":{"observed_at":"2026-08-12T15:54:32.981979Z","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-08-12T15:54:32.984693Z","title":"Multiple-bases belief-propagation decoding of high-density cyclic codes,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:32.984693Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:6b94d6dfe902053f07dcfb752801a60187f03394d2e803a4caafbf0ed34d9b74","observation_id":"612e1fcb-44fc-43c3-b4f1-77a4a1a9fd4e","resolution":{"observed_at":"2026-08-12T15:54:32.984693Z","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-08-12T15:54:32.987173Z","title":"Efficient decoding of short length linear cyclic codes,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:32.987173Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:3415631cdb2a05850395c0230b5314c7329eebe8d8a02e3f7364ecd8f2c78abf","observation_id":"6ddeeadd-5472-497c-bdb9-7c399a28dcbc","resolution":{"observed_at":"2026-08-12T15:54:32.987173Z","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-08-12T15:54:32.989669Z","title":"A generalized parity- check transformation for iterative soft-decision decoding of binary cyclic codes,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:32.989669Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:4a9277de37587917d2a51afc5872f86b711f78401246bcb9266aa6914aa97826","observation_id":"02b3bfea-1df2-43f0-9a43-007cc85fc1c5","resolution":{"observed_at":"2026-08-12T15:54:32.989669Z","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-08-12T15:54:32.992000Z","title":"On iterative soft-decision decoding of linear binary block codes and product codes,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:32.992000Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:44d1f674b19adb1c8f58f2c696ff7bd1ef2e23387f6c2b6152e785dd92b2fe28","observation_id":"973d9e4b-7cee-4ddb-8b97-8f27c888d3e8","resolution":{"observed_at":"2026-08-12T15:54:32.992000Z","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-08-12T15:54:32.994908Z","title":"Generating code representa- tions suitable for belief propagation decoding,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:32.994908Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:d0307ca3064ed5c418bc9a968297635ebc1fdbdfd037f5e5bf56a4f80df9720d","observation_id":"13a5a805-4f0f-4675-9f55-76a5695adbb4","resolution":{"observed_at":"2026-08-12T15:54:32.994908Z","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-08-12T15:54:32.997362Z","title":"Low-density parity-check codes based on finite geometries: a rediscovery and new results,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:32.997362Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:43e8f961897441b147ca756c580e5d8bdc22b339b3fb1abdb83e1f0a35bf899b","observation_id":"57cd2fe8-f748-4393-a350-8e31c5e89943","resolution":{"observed_at":"2026-08-12T15:54:32.997362Z","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-08-12T15:54:33.000253Z","title":"Deep learning methods for improved decoding of linear codes,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:33.000253Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:7f5d7bd619f3fc92b7e139eee3738c9497905934a308e80096f68eaa57e879c7","observation_id":"e1e852ac-481d-46ed-8986-451470b13410","resolution":{"observed_at":"2026-08-12T15:54:33.000253Z","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-08-12T15:54:33.003620Z","title":"Learned belief- propagation decoding with simple scaling and SNR adaptation,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:33.003620Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:9bccedc3aebb99b42f512aacead02a45bce4194869938dfc4cca509114db2987","observation_id":"becf286c-a998-49ea-a1db-13ca632a685c","resolution":{"observed_at":"2026-08-12T15:54:33.003620Z","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-08-12T15:54:33.006005Z","title":"Soft-decision decoding of linear block codes based on ordered statistics,","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:33.006005Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:ce6f2edb9e3af372615cb983e725dd723c113273a1cbf37d055a23d2b7e0c79f","observation_id":"0a505d15-5287-45dd-87c7-46e17aa76593","resolution":{"observed_at":"2026-08-12T15:54:33.006005Z","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-08-12T15:54:33.008341Z","title":"On hard and soft decision decoding of BCH codes,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:33.008341Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:a8fa8475278e839ca9dee3362736d8cff935f41797620aeb5e7f8bce69e49db4","observation_id":"87db0508-b084-4a73-9f53-4bf75d136bc2","resolution":{"observed_at":"2026-08-12T15:54:33.008341Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:54:33.061372Z","title":"Boosting ordered statistics decoding of short LDPC codes with simple neural network models,","venue":null,"work_id":"df320974-4731-4713-a4f6-1910aa14bfae","year":2024},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:33.011157Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:e967d8247f6ede78d36622818fd9c239dafd73fe44b8b1eaad9f992a2e3bb85a","observation_id":"9ef36239-c9e6-4555-b4e2-eec7f62bcfd3","resolution":{"observed_at":"2026-08-12T15:54:33.065785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:54:33.053890Z","title":null,"venue":null,"work_id":"7acc0f79-0261-41f5-b799-a0abf3f0e8cb","year":2018},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:33.014484Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:0dc2fd7c12104df7c2b61e75d631e6a5715f755f534ba4d61ca1242c40a0a3fa","observation_id":"8cbeac47-dfd4-495b-800e-daec103ec563","resolution":{"observed_at":"2026-08-12T15:54:33.056780Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:54:33.016911Z","title":"Database of Channel Codes and ML Simulation Results,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:33.016911Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:98be6ef99a3effa644e4a0878f2e22eae23db59f1fd9071d41daa7af69f3d33e","observation_id":"872ad815-29e1-4e10-8738-62d47fec0132","resolution":{"observed_at":"2026-08-12T15:54:33.016911Z","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-08-12T15:54:33.019172Z","title":"Iterative soft-decision decoding of binary cyclic codes,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:33.019172Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:50f8a0a7ab97a002120124075aed6135dee424edc3de6da812fa5604e77a3d29","observation_id":"25ea80d5-bc58-47ef-a5dd-0f4321592ef1","resolution":{"observed_at":"2026-08-12T15:54:33.019172Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:54:33.037584Z","title":"Chollet et al","venue":null,"work_id":"92a5572e-84da-42eb-b934-8adbfe3b6b77","year":2015},"citing_paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T15:54:33.021557Z"},"links":{"citing_paper":"/paper/2411.13876"},"observation_digest":"sha256:7ffe2e93b90dfac3f7fc4aa43cb6f67034de7246af0cc56eb0c58e3bcc909fa0","observation_id":"d09e941c-c03b-4283-b47e-7f2476586c67","resolution":{"observed_at":"2026-08-12T15:54:33.041024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.13876","last_updated":"2024-11-21T06:23:04Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-12T15:45:03.114541Z","submitted_at":"2024-11-21T06:23:04Z","title":"Iterative decoding of short BCH codes and its post-processing"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":0,"verified_fuzzy":2},"total_outbound_references":21},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2411.13876."}