{"as_of":"2026-08-19T14:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4b0023eda197ebd674819341ebef34a8bc16eff49d1348fff6303a56ac71a744","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:26:02.329972Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2505.09978/citation-record","integrity":"/paper/2505.09978/integrity","json":"/paper/2505.09978/citation-record.json","paper":"/paper/2505.09978"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:26:02.609851Z","title":"Short block-length codes for ultra-reliable low latency communications,","venue":null,"work_id":"e62af6ab-af26-4c03-8cac-cab2930d677b","year":2019},"citing_paper":{"arxiv_id":"2505.09978","last_updated":"2025-05-15T05:32:03Z","snapshot_observed_at":"2026-08-17T15:04:27.750869Z","submitted_at":"2025-05-15T05:32:03Z","title":"Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T21:26:02.257252Z"},"links":{"citing_paper":"/paper/2505.09978"},"observation_digest":"sha256:3f44b219641274928c14c16a92c8280098682869ba7f809ae526dc08d49d4744","observation_id":"630b0aaf-1699-45a2-a830-185d636a6054","resolution":{"observed_at":"2026-08-15T21:26:02.614717Z","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-15T21:26:02.593811Z","title":"Soft-decision decoding of linear block codes based on ordered statistics,","venue":null,"work_id":"2ebbe5e1-0eb5-4697-aed9-87a91d33e429","year":1995},"citing_paper":{"arxiv_id":"2505.09978","last_updated":"2025-05-15T05:32:03Z","snapshot_observed_at":"2026-08-17T15:04:27.750869Z","submitted_at":"2025-05-15T05:32:03Z","title":"Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T21:26:02.262642Z"},"links":{"citing_paper":"/paper/2505.09978"},"observation_digest":"sha256:7927cd43b2f1119b94f8c0817270bad577be69b22a7f58f99bd4f8040681f00d","observation_id":"54e31645-3129-4ca3-8c73-97741c383a52","resolution":{"observed_at":"2026-08-15T21:26:02.599339Z","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-15T21:26:02.576765Z","title":"Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes,","venue":null,"work_id":"02091524-1276-4674-9f7d-1dbf9a1eae57","year":1993},"citing_paper":{"arxiv_id":"2505.09978","last_updated":"2025-05-15T05:32:03Z","snapshot_observed_at":"2026-08-17T15:04:27.750869Z","submitted_at":"2025-05-15T05:32:03Z","title":"Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T21:26:02.267429Z"},"links":{"citing_paper":"/paper/2505.09978"},"observation_digest":"sha256:c20be6a7cf4e108943c9de9845c5125fbc2f2d13d533ae9e9a57a3feee994c3b","observation_id":"ea2a7197-a42a-46f3-873e-75c7c9a27f03","resolution":{"observed_at":"2026-08-15T21:26:02.582476Z","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-15T21:26:02.559106Z","title":"Ona ∗ algo- rithms for decoding short linear block codes,","venue":null,"work_id":"ac76c5b4-1aea-4623-aa2d-07683b403d47","year":2015},"citing_paper":{"arxiv_id":"2505.09978","last_updated":"2025-05-15T05:32:03Z","snapshot_observed_at":"2026-08-17T15:04:27.750869Z","submitted_at":"2025-05-15T05:32:03Z","title":"Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T21:26:02.272259Z"},"links":{"citing_paper":"/paper/2505.09978"},"observation_digest":"sha256:c952c689dba8bb555f19f8ec836151a7ccd6393998eb195d7974a0276a491713","observation_id":"b6229b2d-e1c5-4536-95ca-c239e41fb586","resolution":{"observed_at":"2026-08-15T21:26:02.564214Z","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-15T21:26:02.277194Z","title":"Box and match techniques applied to soft-decision decoding,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2505.09978","last_updated":"2025-05-15T05:32:03Z","snapshot_observed_at":"2026-08-17T15:04:27.750869Z","submitted_at":"2025-05-15T05:32:03Z","title":"Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T21:26:02.277194Z"},"links":{"citing_paper":"/paper/2505.09978"},"observation_digest":"sha256:717ad55c970fdcbcd3d112b1cb0e22b8ee66827d671206c27c9e68dca2dc882a","observation_id":"e998882a-afc9-4383-b007-f7443edebc27","resolution":{"observed_at":"2026-08-15T21:26:02.277194Z","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-15T21:26:02.527926Z","title":"Reliability-based soft-decision decoding with multiple biases,","venue":null,"work_id":"4a7b765a-6425-4683-9bc4-bd927fb36f96","year":2007},"citing_paper":{"arxiv_id":"2505.09978","last_updated":"2025-05-15T05:32:03Z","snapshot_observed_at":"2026-08-17T15:04:27.750869Z","submitted_at":"2025-05-15T05:32:03Z","title":"Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T21:26:02.282329Z"},"links":{"citing_paper":"/paper/2505.09978"},"observation_digest":"sha256:75aefd9517868106dc17f228875259adb4d7cdea7f02efc21cdab5f08a53dbf5","observation_id":"0ce1ac07-b53b-4f6b-aa35-19eb7ac3cecd","resolution":{"observed_at":"2026-08-15T21:26:02.534081Z","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-15T21:26:02.510047Z","title":"Iterative reliability- based decoding of linear block codes with adaptive belief propagation,","venue":null,"work_id":"cdc614c3-811b-45de-adf0-838ced3cfd4b","year":2005},"citing_paper":{"arxiv_id":"2505.09978","last_updated":"2025-05-15T05:32:03Z","snapshot_observed_at":"2026-08-17T15:04:27.750869Z","submitted_at":"2025-05-15T05:32:03Z","title":"Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T21:26:02.287661Z"},"links":{"citing_paper":"/paper/2505.09978"},"observation_digest":"sha256:8dfc4502b51d599350611f9b3b7fdfad88c25f5a3e036f0da96bbb1ad6cc5f20","observation_id":"b3512857-2518-4d48-bdc3-5125e7d2c848","resolution":{"observed_at":"2026-08-15T21:26:02.515181Z","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-15T21:26:02.492870Z","title":"Tree-search decoding with path constraints for linear block codes,","venue":null,"work_id":"af6f22c1-a1d3-402e-825d-ced063901657","year":2014},"citing_paper":{"arxiv_id":"2505.09978","last_updated":"2025-05-15T05:32:03Z","snapshot_observed_at":"2026-08-17T15:04:27.750869Z","submitted_at":"2025-05-15T05:32:03Z","title":"Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T21:26:02.292252Z"},"links":{"citing_paper":"/paper/2505.09978"},"observation_digest":"sha256:469bc17810025efd4a1791ce5c260450d66144d294f5f0e51c75bc7de44c13f6","observation_id":"79cbda1a-eb70-49ec-8b8d-918099f79c24","resolution":{"observed_at":"2026-08-15T21:26:02.498501Z","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-15T21:26:02.474568Z","title":"Tree-search decoding using reduced-size stacks,","venue":null,"work_id":"814afec7-b13e-4d6e-85f8-42ddea31c550","year":2018},"citing_paper":{"arxiv_id":"2505.09978","last_updated":"2025-05-15T05:32:03Z","snapshot_observed_at":"2026-08-17T15:04:27.750869Z","submitted_at":"2025-05-15T05:32:03Z","title":"Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T21:26:02.296744Z"},"links":{"citing_paper":"/paper/2505.09978"},"observation_digest":"sha256:6f7145c5072791ad108765e131c433bf88b43e760eebfcfbb215156b81f00a02","observation_id":"aefc9e30-7c67-4522-8097-67177768c1dc","resolution":{"observed_at":"2026-08-15T21:26:02.479527Z","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-15T21:26:02.459037Z","title":"A systematic (16,8) code for correcting double errors and detecting triple-adjacent errors,","venue":null,"work_id":"c7a69fba-e101-4557-9951-d7fd7165e381","year":1993},"citing_paper":{"arxiv_id":"2505.09978","last_updated":"2025-05-15T05:32:03Z","snapshot_observed_at":"2026-08-17T15:04:27.750869Z","submitted_at":"2025-05-15T05:32:03Z","title":"Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T21:26:02.301644Z"},"links":{"citing_paper":"/paper/2505.09978"},"observation_digest":"sha256:68b2522461d0a5ffb08c1f092e00070b46eeb22277f46fe2e6c898bbc736b31a","observation_id":"9dd170af-7c26-4f07-afc5-31704689c90d","resolution":{"observed_at":"2026-08-15T21:26:02.464287Z","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-15T21:26:02.443750Z","title":"Lin and D","venue":null,"work_id":"14fec0aa-2d1e-4e24-9f49-02c5cdb1f971","year":2004},"citing_paper":{"arxiv_id":"2505.09978","last_updated":"2025-05-15T05:32:03Z","snapshot_observed_at":"2026-08-17T15:04:27.750869Z","submitted_at":"2025-05-15T05:32:03Z","title":"Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T21:26:02.306036Z"},"links":{"citing_paper":"/paper/2505.09978"},"observation_digest":"sha256:4cec9854653752d6db5fb5d3789f7f5c117e9f4301d2816c8a21299af797724b","observation_id":"be7caa26-5a41-4175-9d75-5cd42e521b7b","resolution":{"observed_at":"2026-08-15T21:26:02.448305Z","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":{"arxiv_id":"1908.09594","last_updated":"2019-09-09T16:15:56Z","snapshot_observed_at":"2026-08-19T09:37:40.619438Z","submitted_at":"2019-08-26T11:05:47Z","title":"From sequential decoding to channel polarization and back again","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.09594","snapshot_observed_at":"2026-08-15T21:26:02.310637Z","title":"From sequential decoding to channel polarization and back again,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.09978","last_updated":"2025-05-15T05:32:03Z","snapshot_observed_at":"2026-08-17T15:04:27.750869Z","submitted_at":"2025-05-15T05:32:03Z","title":"Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T21:26:02.310637Z"},"links":{"cited_paper":"/paper/1908.09594","citing_paper":"/paper/2505.09978"},"observation_digest":"sha256:955700c680d5318616dee648ab5e260439144eb9012cf1693ad3275dabf8b57d","observation_id":"c473021e-084f-4539-9d28-7e1e08c75248","resolution":{"observed_at":"2026-08-15T21:26:02.310637Z","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":"10.1049/cmu2.12587","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:26:02.361881Z","title":"Fast list decoders for polarization-adjusted convolutional (pac) codes,","venue":null,"work_id":"b089f5ac-c7f2-4822-b974-624c9b972cb1","year":2023},"citing_paper":{"arxiv_id":"2505.09978","last_updated":"2025-05-15T05:32:03Z","snapshot_observed_at":"2026-08-17T15:04:27.750869Z","submitted_at":"2025-05-15T05:32:03Z","title":"Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T21:26:02.315603Z"},"links":{"citing_paper":"/paper/2505.09978"},"observation_digest":"sha256:e344886e0349cb41e1fa8c89d57de6587cd225ad45992ebb8af8136fe973643a","observation_id":"41f73dde-5bf2-4eb9-a46e-a1ab465b6097","resolution":{"observed_at":"2026-08-15T21:26:02.368408Z","resolver_source":"doi","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:26:02.426596Z","title":"An improvement to generalized-minimum- distance decoding,","venue":null,"work_id":"df171040-0204-4a7e-9eaf-d902d91d48cf","year":1991},"citing_paper":{"arxiv_id":"2505.09978","last_updated":"2025-05-15T05:32:03Z","snapshot_observed_at":"2026-08-17T15:04:27.750869Z","submitted_at":"2025-05-15T05:32:03Z","title":"Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T21:26:02.320486Z"},"links":{"citing_paper":"/paper/2505.09978"},"observation_digest":"sha256:9fad9c72af8afaebf35009f8cd8a93b90683915fe4439319365bf136ec0aeaec","observation_id":"b08636e4-d28d-4439-ba99-4bf38c586e0e","resolution":{"observed_at":"2026-08-15T21:26:02.432363Z","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-15T21:26:02.407743Z","title":"Optimal decoding of linear codes for minimizing symbol error rate (corresp.),","venue":null,"work_id":"a3db28f9-9a82-48a1-aca5-5f57eb88fcd3","year":1974},"citing_paper":{"arxiv_id":"2505.09978","last_updated":"2025-05-15T05:32:03Z","snapshot_observed_at":"2026-08-17T15:04:27.750869Z","submitted_at":"2025-05-15T05:32:03Z","title":"Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T21:26:02.324875Z"},"links":{"citing_paper":"/paper/2505.09978"},"observation_digest":"sha256:83a53f87115e795877a519ddac38f0a09eaae1d5e8c64b457d5e4df0001f1711","observation_id":"70f03f45-c55a-4d7e-a6c9-8147b1b7e3c6","resolution":{"observed_at":"2026-08-15T21:26:02.412825Z","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-15T21:26:02.329972Z","title":"Convergence behavior of iteratively decoded parallel concatenated codes,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.09978","last_updated":"2025-05-15T05:32:03Z","snapshot_observed_at":"2026-08-17T15:04:27.750869Z","submitted_at":"2025-05-15T05:32:03Z","title":"Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T21:26:02.329972Z"},"links":{"citing_paper":"/paper/2505.09978"},"observation_digest":"sha256:cd9e18aa9b43532d4fd542a6f535cd2ba0b3268283cc76f0a56b1520293cbfdb","observation_id":"4c56e96e-7272-468d-9266-bb24194ff8ee","resolution":{"observed_at":"2026-08-15T21:26:02.329972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.09978","last_updated":"2025-05-15T05:32:03Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-17T15:04:27.750869Z","submitted_at":"2025-05-15T05:32:03Z","title":"Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":1,"verified_fuzzy":12},"total_outbound_references":16},"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 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2505.09978."}