{"as_of":"2026-08-06T12:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c16d9a37b70a2d5b09c6aaea24220ead0786e35b3e9a4b5e020a70d92ff4f196","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-18T10:55:51.231012Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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-07-31T09:41:19.904743Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2510.01813","snapshot_observed_at":"2026-07-31T09:41:19.904743Z","title":"Parallelism empowered guessing random additive noise decoding,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-06T06:22:47.905992Z","submitted_at":"2026-07-30T15:29:03Z","title":"Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:19.904743Z"},"links":{"cited_paper":"/paper/2510.01813","citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:b7c4b653f9263def62020b305f6c4c2d14d80e205343b5e1468acc63f0ffc05d","observation_id":"b8f15caf-3299-4469-a8c7-603506c78b70","resolution":{"observed_at":"2026-07-31T09:41:19.904743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2510.01813/citation-record","integrity":"/paper/2510.01813/integrity","json":"/paper/2510.01813/citation-record.json","paper":"/paper/2510.01813"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Survey of turbo, LDPC, and polar decoder ASIC implementations","venue":null,"work_id":"d235d708-43e3-4258-b2a0-4ee8d0dd07c6","year":2019},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:d54e4782800405320f007ae552b973651b22568a5aaee2061cf5b3dc87fc0bdd","observation_id":"088fc887-26fa-4b46-bde7-06e04cdef2a0","resolution":{"observed_at":"2026-05-18T10:56:17.843128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Channel coding towards 6G: Technical overview and outlook","venue":null,"work_id":"558ac822-ad98-4537-8bd6-c726940f935f","year":2024},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:7a9bd47e6138c69098ff4ee0af7341e779cda57f7d669c5b448973142db5b6ee","observation_id":"0377260a-06c0-4899-82f8-af7bc16f9097","resolution":{"observed_at":"2026-05-18T10:56:17.835774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A semi-parallel successive-cancellation decoder for polar codes","venue":null,"work_id":"11e89659-83b6-459d-bcfe-ed4532f5e089","year":2012},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:3ed8d89d09f962dfbde36eebb10e072b9ac3bc8e542e8f662ff2c4c69a1a25df","observation_id":"b3e340e7-cdde-4380-ab1a-4c254d5322b5","resolution":{"observed_at":"2026-05-18T10:56:17.831912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"GPU-based, LDPC decoding for 5G and beyond","venue":null,"work_id":"9e201415-e87f-4bc1-a0c0-a5dee086fb46","year":2021},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:9fc0c52025380fd2921dbaf97415dfed74ea91226b0f47a962e015bd67e037dd","observation_id":"76bcaf46-01b4-433b-b760-68725b9ab1ed","resolution":{"observed_at":"2026-05-18T10:56:17.827779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Capacity-achieving guessing random additive noise decoding","venue":null,"work_id":"eb5a9688-82b3-46f2-8002-31371f006566","year":2019},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:8d01583ed1bbac437fd31a328478e1ed34cf2c1a7f197120f4b29749209e5a9a","observation_id":"deb5984d-1b41-4cb4-92f6-694efef951a3","resolution":{"observed_at":"2026-05-18T10:56:17.839671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"63f4b7c7-8a56-471b-bb90-63cdb59b13e6","year":2023},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:027c72555d249bcce25739dacf989b00b7f4ae067b93adcd91c5df5116e3ec40","observation_id":"5e7e269e-5413-4d7e-b5ba-01f92379bfe0","resolution":{"observed_at":"2026-05-18T10:56:17.823923Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Ordered reliability bits guessing random additive noise decoding","venue":null,"work_id":"5f04bac8-0dfd-4add-b76d-b7f10baceab6","year":2022},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:a80de73dad09e6eba14ad2ae80cb6b22bc34b87852cf3741138e299388b60dfa","observation_id":"15124201-2432-4da6-8f54-918b1e0aa917","resolution":{"observed_at":"2026-05-18T10:56:17.862534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Short block-length codes for ultra-reliable low latency communications","venue":null,"work_id":"78fa34d0-e978-4994-b93b-3230140d9b7f","year":2018},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:db209b6c3c6b4a11081fbd31cc8f7f90dad0aa5dbf7d2538bfc61bfed102a6c1","observation_id":"d820d537-1f57-4fa4-a058-35c4a3d46b2b","resolution":{"observed_at":"2026-05-18T10:56:17.820325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"On the road to 6G: Visions, requirements, key technologies, and testbeds","venue":null,"work_id":"5bd6363d-64c1-4475-982e-6ca15b733843","year":2023},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:106fe637ea2c9ab66ed82dad742bf7f39f2886e94e53239389c2956645b93f8e","observation_id":"d7423e69-717d-40f1-89d4-1a8f83ec7e17","resolution":{"observed_at":"2026-05-18T10:56:17.756639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Soft maximum likelihood decoding using GRAND","venue":null,"work_id":"0ae81328-d11a-4465-8ab6-923dce1af560","year":2020},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:a56ac29f614765ac8a12169cd24779c3a7e646b08365f3775d23770e429ecb22","observation_id":"68f96614-d4d6-499f-83fa-85f17e01c55c","resolution":{"observed_at":"2026-05-18T10:56:17.816575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"ORBGRAND is almost capacity-achieving","venue":null,"work_id":"408e2a6a-8e58-4e89-b2bd-1178fdfd5e69","year":2022},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:431e9a29151c4a4384d805fd9d4b1aeb650a89641ee20993d22f3f1fe8924b9e","observation_id":"bdccee5a-bcc2-4fd7-8108-468e184ba8f6","resolution":{"observed_at":"2026-05-18T10:56:17.749099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Approaching maximum likelihood decoding performance via reshuffling ORBGRAND","venue":null,"work_id":"71ad7a25-ad43-494e-abff-5999a294fae2","year":2024},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:33a60bab8040b7fde121988129607719b2006842f7e3a9baabd7f013fa499b3e","observation_id":"d3ee3d8d-3a92-402a-946e-817ca9cddaf8","resolution":{"observed_at":"2026-05-18T10:56:17.812630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Efficient decoders for short block length codes in 6G URLLC","venue":null,"work_id":"e6963627-24a8-4d21-81b8-c5d1dc49aeb7","year":2023},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:da1c2deed11470386450bdd72131dd4e1e7eb878bb667dfdbc9ee5029699b802","observation_id":"468adae3-2f9a-4c5c-aa4b-f667b5d044c2","resolution":{"observed_at":"2026-05-18T10:56:17.740338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Analysis of universal decoding techniques for 6G ultra-reliable and low-latency communication sce- nario","venue":null,"work_id":"51bb0108-70c6-4041-91c5-6ab645d4ab10","year":2025},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:e15473963b86980376563c0c1b9811c8dbe7626e4b9e10444899c0dc02a35a7e","observation_id":"c7fb5fb9-287f-4744-8378-6e8fe13fb08d","resolution":{"observed_at":"2026-05-18T10:56:17.808697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Soft-decision decoding of linear block codes based on ordered statistics","venue":null,"work_id":"d06ea0e5-440f-4e69-be39-8aa94d4ba6fc","year":2002},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:f17398e155b02d9a70eca4f19c7f8ef09589ab08f05bc7e7c25c4dd2f5a4db74","observation_id":"945253e3-04c4-47bc-a479-f1b070a237d5","resolution":{"observed_at":"2026-05-18T10:56:17.772670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Probability-based ordered-statistics decoding for short block codes","venue":null,"work_id":"d99ef4f9-a8ed-4ced-9b4a-66921caa6e11","year":2021},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:7fd84be8feb53df5740fbe95576e7d959f1a36b84ab0383dcb918de089ea393c","observation_id":"4f8f13c8-1a27-40a9-829c-f18d3d91bbc0","resolution":{"observed_at":"2026-05-18T10:56:17.855345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Classification of automorphisms for the decoding of polar codes","venue":null,"work_id":"83030896-175a-4e8b-ae4e-be8592071745","year":2022},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:255613cd4b644754df53e1e14180ce0d9b119fcd17ace9e91e5c8a419e70a267","observation_id":"47e81cbd-aa71-4f9f-94e9-6a749c955df7","resolution":{"observed_at":"2026-05-18T10:56:17.847922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Improved low-density parity-check codes using irregular graphs","venue":null,"work_id":"3a6a4abc-a0ae-4acc-b486-f0b1a72b0be7","year":2002},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:0e063c2a771d502ea3d63826a08b1109522d64cd68778f9b918f15f575406438","observation_id":"7c124306-0324-4122-98f3-4c7c40a53771","resolution":{"observed_at":"2026-05-18T10:56:17.804786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A low-complexity improved successive cancellation decoder for polar codes","venue":null,"work_id":"05229962-b4e8-41ba-afa8-2a2cad383f3c","year":2014},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:e30a68a348fb6f2c287e87b4d9dd8b581bcf9127b6f44bed47424fe891729064","observation_id":"5b5ff88f-c9c4-4d63-afe0-160954300bc9","resolution":{"observed_at":"2026-05-18T10:56:17.851262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Channel polarization: A method for constructing capacity- achieving codes for symmetric binary-input memoryless channels","venue":null,"work_id":"4ff90255-41cd-4940-b08b-22a1c5349626","year":2009},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:89828015e16a9b05f9d8829713625970d29c23868b2e0dec3e85738b213a0453","observation_id":"33847661-1e8d-46c1-8c97-79fe759128a2","resolution":{"observed_at":"2026-05-18T10:56:17.801148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"CRC-aided decoding of polar codes","venue":null,"work_id":"3d04e457-a8cc-443e-aa5c-d8f4bee8830d","year":2012},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:b692e24043a37dba0e851049467d5f8906cb52b21407d6bc7b4239306a85b077","observation_id":"7fe5da36-0a36-4bab-9d01-20a70fc6ce16","resolution":{"observed_at":"2026-05-18T10:56:17.858796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"High-throughput VLSI architecture for GRAND","venue":null,"work_id":"4004e694-b361-4820-b1a0-f1f04ef4504a","year":2020},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:0a315d4cc55e1d5cb14e34c4cb4d130b92505e7cad57c5bda5ab1aa08175ac61","observation_id":"26eb1ffe-cce6-418b-b2bf-7347b7f15883","resolution":{"observed_at":"2026-05-18T10:56:17.797296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Efficient ORBGRAND implementation with parallel noise sequence generation","venue":null,"work_id":"ccacf702-1f06-4133-adc5-40fe58cebb35","year":2024},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:f3baff167c39837e0b69bb1ac06ec3fdad60d9b3d9d06f2f0ce102490b792007","observation_id":"b39b3902-b5fc-4b06-870c-7cd064d39b0a","resolution":{"observed_at":"2026-05-18T10:56:17.873757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A low-latency and area- efficient ORBGRAND decoder for polar codes","venue":null,"work_id":"c0eec625-bebb-44bb-b27a-014d0cf3bf7a","year":2023},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:75ffb3373b10c7a71f7a6d0ae399c97179a0aad1ee7a95d7d4824cd6a1f78f88","observation_id":"f6785024-50ec-4185-b99f-801a3cbd517c","resolution":{"observed_at":"2026-05-18T10:56:17.793708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A fixed latency ORBGRAND decoder architecture with LUT-aided error-pattern scheduling","venue":null,"work_id":"edfa881d-a927-4d72-b90e-eb9d78ff7308","year":2022},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:1a585a610ef694ec44d783dc2bdd20e9493cca805315e65b17d5cc8761adfa99","observation_id":"0583fbc6-50c9-476e-83cc-f912109a0d01","resolution":{"observed_at":"2026-05-18T10:56:17.866291Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"High-throughput and energy-efficient VLSI architecture for ordered reliability bits GRAND","venue":null,"work_id":"9229a4cb-2500-4854-b8f4-e373aac91015","year":2022},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:1e26daccf8acd4ac20fbff136847f76451bc11e33827bf5d214ab06a4c04bb1b","observation_id":"d325e5eb-42b6-4c68-92d6-a040a67af808","resolution":{"observed_at":"2026-05-18T10:56:17.790107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Improved Step-GRAND: Low-latency soft-input guessing random additive noise decoding","venue":null,"work_id":"a1efe611-f518-4129-acb4-0ef4d26943d2","year":2025},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:e98a5df3dcb093d7e423a81238d22dd1541b1a6395a89f6725c138783db0c85a","observation_id":"80044b31-7006-4842-978a-13a2e8f04c9d","resolution":{"observed_at":"2026-05-18T10:56:17.870137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"ORBGRAND: Achievable rate for general bit channels and application in bicm","venue":null,"work_id":"46423037-0893-4936-b514-ea62f9aea7b0","year":2024},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:e7ca25ad6c3bc6e4e3e9391174e8468d4bd0b39a7b3e3a9db401693f549021fe","observation_id":"2ed40232-e334-4be5-bd08-2abfdba835d6","resolution":{"observed_at":"2026-05-18T10:56:17.786388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"High-performance low-complexity error pattern generation for ORBGRAND decoding","venue":null,"work_id":"9c8fddc9-cc31-4aa0-93d2-0b4bd246626a","year":2021},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:3d6660e2408df2f5a4e6bf297fbe33f933588f24b41570e2bbce62e262ca8338","observation_id":"90e52d2b-7233-4a7a-a8ae-897228376ac3","resolution":{"observed_at":"2026-05-18T10:56:17.752739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Fine-tuning ORBGRAND with very few channel soft values","venue":null,"work_id":"5370e564-42de-4bfd-8688-f2b985398052","year":2025},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:65fe8b325cfbaffb7fb5f1a58658fc4b0b169fd0d5fd51e63f8c395d2fe5d79a","observation_id":"fbfab0c8-4a21-40ef-9702-6e04618dcfc4","resolution":{"observed_at":"2026-05-18T10:56:17.782975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"List-GRAND: A practical way to achieve maximum likelihood decoding","venue":null,"work_id":"99732989-4f7a-433b-93eb-266b89539797","year":2022},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:366fbf20d1083457610c6539566aa33fc5727d7bf68f558fb9ce2feaafc737c3","observation_id":"1aa4bbd6-e566-41d1-8068-c35758f3dd2d","resolution":{"observed_at":"2026-05-18T10:56:17.768841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-09T13:16:15.995101Z","title":null,"venue":null,"work_id":"e82611fc-b0fd-4f25-8fe3-db0ca8096494","year":2022},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:1503ef7ae8714e553c474319e6ca6861afe478691ebfb3c8588044a254d67a9a","observation_id":"e8d8116a-b1a0-4d98-b947-9b791ad36136","resolution":{"observed_at":"2026-05-18T10:56:17.760962Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"An improvement to generalized- minimum-distance decoding","venue":null,"work_id":"d1e19af3-b2d9-41e1-9900-8ab5f965faea","year":1991},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:9ebd27991110533c68063037dbfa14dff731597353e148a0881952ba76163f61","observation_id":"873d57cf-9ea8-4b2d-9b24-129cc2733239","resolution":{"observed_at":"2026-05-18T10:56:17.765120Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Lin and D","venue":null,"work_id":"107d8716-ae87-4690-9ad4-5f39d93cc9ca","year":2004},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:ec51e98a3e294ab284e084c80b2780b32ecd84fa9b84a726897653499c850feb","observation_id":"c2795bff-538e-4e87-a8aa-387fff60542a","resolution":{"observed_at":"2026-05-18T10:56:17.779535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"On a class of error correcting binary group codes","venue":null,"work_id":"8dc4a4b6-89f9-450f-b49a-06450ca70dae","year":1960},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:285be01d6f3f05e37d81e20cfa925da855789a5844285ef277efd2a1575ad456","observation_id":"ca4cedca-f763-4636-87bb-0ecdea76bdb6","resolution":{"observed_at":"2026-05-18T10:56:17.776228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"aa0906be-f519-45f5-85ac-a2ae4804c06b","year":2013},"citing_paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-18T10:55:51.231012Z"},"links":{"citing_paper":"/paper/2510.01813"},"observation_digest":"sha256:91e149084bf673069b4054683d4145f9dec86b986674e29f1f9066e0b9a9559e","observation_id":"8fafa3c5-ef9a-4c3f-b202-ac827f1e4938","resolution":{"observed_at":"2026-05-18T10:56:17.744654Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2510.01813","last_updated":"2026-05-01T11:09:23Z","latest_version":4,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-03T02:04:42.978594Z","submitted_at":"2025-10-02T08:59:45Z","title":"A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":33},"total_outbound_references":36},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 1 inbound Pith citation observation for arXiv:2510.01813."}