{"as_of":"2026-08-19T14:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f8fc00527f370c1c071a12cf05a412c06cafaaa808f0b7e4a0d8f63240327ec4","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T17:44:07.538256Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"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-16T10:45:32.302229Z","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-16T10:45:32.434269Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"cited_work":{"arxiv_id":"2501.11993","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.11993","snapshot_observed_at":"2026-08-16T10:45:32.434269Z","title":"Subcode Ensemble Decoding of Linear Block Codes","venue":"cs.IT","work_id":"79b05cd5-d8bd-40c0-bb61-c0f95391bdd5","year":2025},"citing_paper":{"arxiv_id":"2504.17511","last_updated":"2025-04-24T12:55:23Z","snapshot_observed_at":"2026-08-17T19:50:38.634113Z","submitted_at":"2025-04-24T12:55:23Z","title":"Subcode Ensemble Decoding of Polar Codes","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-16T10:45:32.302229Z"},"links":{"cited_paper":"/paper/2501.11993","citing_paper":"/paper/2504.17511"},"observation_digest":"sha256:3f4be01637ad74c993a62b43e7ea5149a5ff0b256c9f0ef227833f9027784a97","observation_id":"c218dd16-7ff1-47b0-9b61-328eb4455582","resolution":{"observed_at":"2026-08-16T10:45:32.442033Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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/2501.11993/citation-record","integrity":"/paper/2501.11993/integrity","json":"/paper/2501.11993/citation-record.json","paper":"/paper/2501.11993"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.445049Z","title":"Richardson and R","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.445049Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:46f1753420383d8f08391ec1398ee4625e126e5a0950109908c7e20e45aa2ee3","observation_id":"51ba367c-d747-482e-b383-1e20954cf216","resolution":{"observed_at":"2026-08-10T17:44:07.445049Z","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-10T17:44:07.845582Z","title":"Short block-length codes for ultra-reliable l ow latency communications,","venue":null,"work_id":"20a1e204-34e6-4ede-9b77-47382289e7b6","year":2019},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.450302Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:0cf29b258a7b39832ad7d6e1281d1608b78f4f357c3153d85357b8bf88c563b7","observation_id":"43450ff4-4ba8-4ea2-a64d-b345ee1ce6d0","resolution":{"observed_at":"2026-08-10T17:44:07.850508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.831188Z","title":"Trends in channel coding for 6g,","venue":null,"work_id":"cd0bc8bd-8a0b-4408-9544-4ce42bf1ebe4","year":2024},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.455074Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:fd567144d3b0c3f05370c976ae4a218cf04934ac2ab84ed82a11a3ccb7e95e6c","observation_id":"959aca7f-5b23-44b4-be84-fd4f6948715f","resolution":{"observed_at":"2026-08-10T17:44:07.835733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.817234Z","title":"6G: A welcome chance to unify channel coding?","venue":null,"work_id":"93f2bb50-212b-4549-a9d8-1434eb615951","year":2023},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.459867Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:01cde6217cb5e9f283894e60e9bd5d8a7962b3603172b67b84c364b9e24a47f0","observation_id":"e0528ffe-efce-4312-9f44-35d171a23ca4","resolution":{"observed_at":"2026-08-10T17:44:07.821808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.464545Z","title":"Automorphism ensemble decoding of Reed-Muller codes,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.464545Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:be97208897d0cb43d83da573f0e17bfe1cd4e4bc0334f6c8c96cd5b8fb661159","observation_id":"81a8707a-0e31-445d-8de4-2e06538f5541","resolution":{"observed_at":"2026-08-10T17:44:07.464545Z","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-10T17:44:07.793787Z","title":"Mul tiple-bases belief-propagation decoding of high-density cyclic codes ,","venue":null,"work_id":"2331a358-8774-4309-9024-c88bdddea12a","year":2010},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.469423Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:041dfeaec46693be0724ad01a7a40ff0f1d84edda00eb6ee36949c3e0fa791bd","observation_id":"ae9b778f-432b-498e-8900-d30de9016cc3","resolution":{"observed_at":"2026-08-10T17:44:07.798491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.780414Z","title":"Rate-comp atible polar codes for automorphism ensemble decoding,","venue":null,"work_id":"eb3146f1-a155-4f18-b3eb-b1f26849f366","year":2023},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.474395Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:3dbd283ba63161cb483e077badd8587ad53e9b79ae9ff5a6d695e2ce706541cf","observation_id":"e8e21481-af23-4302-abc5-8ea714c5b896","resolution":{"observed_at":"2026-08-10T17:44:07.784943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.765022Z","title":"Automorphism ensemble decoding of quasi-cyclic LDPC code s by breaking graph symmetries,","venue":null,"work_id":"9ba14779-787e-4d74-aaa1-1b4dbee10817","year":2022},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.478796Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:1507f27d641b6285bd2735e841f8f3d3fafb4d48aadaa080f973a457fd338c18","observation_id":"952ceae0-8f8c-4d60-9b79-47b4da51ec0a","resolution":{"observed_at":"2026-08-10T17:44:07.771361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.752677Z","title":"Noise-aided belief propagation list d ecoding of polar codes,","venue":null,"work_id":"446387f6-5126-4b63-842f-2f09af2318f1","year":2019},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.483232Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:4a6eb315eb424297e7a9789e60d8c7d62d5a9de8728fdda247c72d4c867b2703","observation_id":"874a6189-5e93-482e-80fc-965cedb1a78c","resolution":{"observed_at":"2026-08-10T17:44:07.756791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.739417Z","title":"A new L DPC decoder hardware implementation with improved error rates ,","venue":null,"work_id":"d596f13e-ed74-4815-a509-d6ba70e7720f","year":2015},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.487683Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:23b6fa67c3a410c51de4d39222510d13a37a629bb4ed087d7426b1df8be4e0f1","observation_id":"69d2cb4e-68b1-4c84-bbd0-efc069d3c3b5","resolution":{"observed_at":"2026-08-10T17:44:07.743842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.726286Z","title":"Mu ltiple-bases belief-propagation for decoding of short block codes,","venue":null,"work_id":"1d06afaf-fed7-48ea-9c90-7a21e1f85536","year":2007},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.491872Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:4fd0ffb3a85059cf4535fafe64a318508d7f2cb5a4c5fdcd973d6f316b754f1b","observation_id":"b78ee8eb-d867-4f41-9bdb-1768e1df13d6","resolution":{"observed_at":"2026-08-10T17:44:07.730539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.712518Z","title":"Multiple-b ases belief- propagation with leaking for decoding of moderate-length b lock codes,","venue":null,"work_id":"643a253b-3cf8-47bf-9cff-7ebaee25413b","year":2008},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.496106Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:7a7b859a250708716a5803dde632fa0765a699fbb8f871fa01b04dc7e80727ba","observation_id":"998d9c1c-7c26-4c85-85db-ea7304d905b4","resolution":{"observed_at":"2026-08-10T17:44:07.717143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.698998Z","title":"Endo morphisms of linear block codes,","venue":null,"work_id":"9b1a4e5c-6ba6-4ed7-82fc-fb345599fee0","year":2024},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.500492Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:34a889a8e71e490444836aacf65c1e4f936ab118cc695da726ac03ba0df7404e","observation_id":"bb8ca3e1-7d2e-46d7-8105-de81de8100e6","resolution":{"observed_at":"2026-08-10T17:44:07.703370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.685097Z","title":"Generalized automor- phisms of channel codes: Properties, code design, and a deco der,","venue":null,"work_id":"49abf92c-aee5-41c1-bf8f-73c55e0ad5fe","year":2023},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.505062Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:a457767fed5619bb3c6e9184059913777aed4770ebba996120160fe7b2784488","observation_id":"dab0cea4-8e41-44e3-8139-e079e705cfaf","resolution":{"observed_at":"2026-08-10T17:44:07.689598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.670882Z","title":"A comparative study of ensemble decoding methods for short length LDPC cod es,","venue":null,"work_id":"01b08f0c-5f38-43f7-948e-3df0e9093985","year":null},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.509459Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:7e3938604813bae5d50bc55926e5241186f6f3d86350a3f2fd3ba43988e6566e","observation_id":"06ec9d13-0701-402f-8971-ebd8ea6ca443","resolution":{"observed_at":"2026-08-10T17:44:07.675737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.642220Z","title":"The intractability of computing the minimum distance of a code,","venue":null,"work_id":"6890e060-a05d-43dd-8f28-3f4f2f279f47","year":1997},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.518164Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:fce5e0eadb1dc218b4cd59246a3df8c5a95c141e3e485f62707e5666b53fe0e3","observation_id":"7673ab74-be07-4457-bda3-0af8e268098e","resolution":{"observed_at":"2026-08-10T17:44:07.647120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.627158Z","title":"Ensemble belief propagation decoding for short linear block codes,","venue":null,"work_id":"afcceddc-65e6-4896-b32a-fc93dd32bb5a","year":2023},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.522155Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:74722f7b04ce6467764c98acf8eb59be1a124a6108dccda5fbbf2ff56e51e6ce","observation_id":"99db1d02-ddef-4c80-bb7d-3e9070ba0b9c","resolution":{"observed_at":"2026-08-10T17:44:07.631796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.612831Z","title":"Covering numbers in linear algebra,","venue":null,"work_id":"1c3e91fb-e1ef-449f-9808-74f71e1662d9","year":2012},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.526097Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:2f6a71d17b5cdb5c16dc280d0433813a3d8d8d66f9888abd8b7f1301a7d3914f","observation_id":"7fc1ba2a-3f2b-4acf-b43a-317c452159cf","resolution":{"observed_at":"2026-08-10T17:44:07.617326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.598442Z","title":"Approximation algori thms for maximum coverage and max cut with given sizes of parts,","venue":null,"work_id":"4beb9e05-68bc-4645-8e38-c728dcc72741","year":1999},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.530157Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:4894115dd9c23ce75202af1e6b3b080ba59f68caa71c76acdac1bf7584f7cf9b","observation_id":"ddadb2e6-d313-40a8-9f95-711303e15749","resolution":{"observed_at":"2026-08-10T17:44:07.603218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.584541Z","title":"TS 38.212, Mar","venue":null,"work_id":"e4b08d58-64ca-4713-8a92-0818e87f040b","year":2023},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.534017Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:7aac7a69291218815ee423ee5b8a30245fdb0113ac5ca47bf71d17e6426a8bd3","observation_id":"67317864-d762-47ff-a53d-1297566c6142","resolution":{"observed_at":"2026-08-10T17:44:07.589028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.567742Z","title":"Information theory, inference, and le arning algo- rithms: Codes files,","venue":null,"work_id":"72345a17-07c9-4a39-8707-6361174a0636","year":2024},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.538256Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:423c4cf8bac9d6f161ed61152db4d8992e7716adc6fa27fae2c2040efde83459","observation_id":"f164f5d2-1e5d-4ca0-a1db-0711adccb361","resolution":{"observed_at":"2026-08-10T17:44:07.574224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:44:07.656841Z","title":"Available: https://arxiv.org/abs/2410","venue":null,"work_id":"852bf128-3b61-453c-b7ea-ba8b14133d79","year":null},"citing_paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-10T17:44:07.513863Z"},"links":{"citing_paper":"/paper/2501.11993"},"observation_digest":"sha256:be02ca5090e939aed79410ca851367449757b84529730a50e382a83d0926f73e","observation_id":"9e627adf-8c47-40a0-8a13-10337cdca2b9","resolution":{"observed_at":"2026-08-10T17:44:07.661602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2501.11993","last_updated":"2025-01-21T09:28:55Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-10T17:35:14.512772Z","submitted_at":"2025-01-21T09:28:55Z","title":"Subcode Ensemble Decoding of Linear Block Codes"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":20},"total_outbound_references":22},"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 22 of 22 outbound references and 1 inbound Pith citation observation for arXiv:2501.11993."}