{"as_of":"2026-08-07T19:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9a161372956baf6d0f07cb0a23dc28985f115c14fcc96c6555797ad2de0c89ce","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T02:33:46.082904Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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:20.344753Z","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":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.28030","snapshot_observed_at":"2026-07-31T09:41:20.344753Z","title":"Performance analysis and optimal design of ORB-type GRAND algorithms,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28363","last_updated":"2026-07-30T15:29:03Z","snapshot_observed_at":"2026-08-07T11:50:06.731614Z","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":49,"source":"pdf_text","source_observed_at":"2026-07-31T09:41:20.344753Z"},"links":{"cited_paper":"/paper/2606.28030","citing_paper":"/paper/2607.28363"},"observation_digest":"sha256:b9ae924e83c9a5d65b77fb2e5d710bc1bb334a7752da6b5279c9678b096d14b9","observation_id":"65e7d600-4619-4696-aedf-f8e491dd0042","resolution":{"observed_at":"2026-07-31T09:41:20.344753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2606.28030/citation-record","integrity":"/paper/2606.28030/integrity","json":"/paper/2606.28030/citation-record.json","paper":"/paper/2606.28030"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"A mathematical theory of communication,","venue":null,"work_id":null,"year":1948},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:78288333b9f7918d510b20baa005497c70360218f4e07bc20d4ffee272c3f399","observation_id":"126fc2d0-a142-4e09-b235-1582c84c22f3","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"On the inherent intractability of certain coding problems,","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:aa4090f11d03bd146a0fcc96aa6018f9fc0148af61136ed2023cfdf59cc61022","observation_id":"7ade3900-b748-4152-8047-b8d724e4c154","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Towards 6G wireless communication networks: Vision, enabling technologies, and new paradigm shifts,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:07209ccde9f0be9f6d1867e7bc7387c12767200661b57d15d1a52d13d1b112e5","observation_id":"8d5230c6-2e61-4650-972e-8b1dabbe6031","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Fiber-optic transmission and networking: The previous 20 and the next 20 years,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:e972b952ceb6069156b6bb143155c92592e2e889afbbee47c05889386ea40190","observation_id":"8c0c9cc6-04cd-4a06-abbc-7644207654c9","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"A survey of high-speed serializer/deserializer architectures,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:7b9e1d6da10702dd6c72927e4826e715b83139d4b554b35cab600d2cde17de9a","observation_id":"7b14f672-0b37-4a41-aff8-efd30f3db807","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Short block-length codes for ultra-reliable low latency communications,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:664deac4ad9485f03181ec0e208c50a85a02a94e367eec7983f58e102a336061","observation_id":"129c173e-d1f1-44ae-9680-ace9d5c658b7","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Efficient decoders for short block length codes in 6G URLLC,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:9c229319d6385be9aaf72ac6918bdc5af4cb78417dd3ddd7c1aa904a2d75eef4","observation_id":"6f14fe9f-7c8b-49cb-8a39-15ecf2daa801","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Capacity-achieving guessing random additive noise decoding,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:b00c6ed4ed84ba2b59c6de8b652202457fd033a6c39e4e09e3227d6c6cf62ede","observation_id":"53b5d117-7216-4307-9fe9-b66915f69646","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Guessing noise, not code-words,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:e2677aa913e73db70f92b54554b92fa6bf5ce6b5f09bbc7eb4ad54b5d622b988","observation_id":"57ea7c82-842f-48bc-bc22-f3cd5effa601","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Soft maximum likelihood decoding using GRAND,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:c9978493665e8dd7c4949d2b3f8257a5bb95b0c0fa726799f4fb88f9d0246f46","observation_id":"4e6f65dd-7233-4822-8bb0-5f8f4bfc80e6","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Guessing random additive noise decoding with symbol reliability information (SRGRAND),","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:cb0145826367276396f2cda772542d5b5a09b360b58cb23ae99411ae71f652d4","observation_id":"51c5ac99-38c6-4d92-9df1-a8229c0b82d3","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"GRAND for Rayleigh fading channels,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:44812b2c5bc0579bb3f2e850246eec0ecc716fca407c081541deb1ecbfe1967c","observation_id":"a8320fee-c194-467d-99a9-3d70b079d914","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Using channel correlation to improve decoding-ORBGRAND-AI,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:0523f2581dd74d32783bd81428438910af17ddff39edbe58e9f3bcc4cdb46bf9","observation_id":"7b844018-6174-4593-a161-7e8c46842350","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"GRAND for fading channels using pseudo-soft information,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:64a4eade317d102aeaf254c57b0490bd21d10d137b62db9d6e3a3121bc675ca8","observation_id":"9522129e-b2a3-4688-9a8c-7ade5df096a1","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Laplacian-ORBGRAND: Decoding for impulsive noise,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:039a30116278d5ba7b0a1b04892d7ad9c8822ffd7cb4895873c8c7e856608826","observation_id":"13bd5be0-d558-4cb9-8422-b1466d3c38c4","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"High-performance low-complexity error pattern generation for ORBGRAND decoding,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:95f49910457bbc141fae5e2ab656d0b55b689f4765e3b2eff81e44fff60911a5","observation_id":"538c6d2f-15e8-4170-aa54-7da0e5e80efd","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Guessing random additive noise decoding with quantized soft information,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:aea2390dd1554aa142025794b1723e229437615fb5f2e25ed680feb789590113","observation_id":"2dedf7f9-69d0-44fa-b760-4de21ba87f2f","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Lin and D","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:6a89fdd85ad31b732bb419abd9386611ae41be9d2ba84df77456d61ddbbc950c","observation_id":"a3972817-d1e2-43c4-94e5-98ca80f2e954","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"A parallelization strategy for GRAND with optimality guarantee by exploiting error pattern tree representation,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:b3e046028c944adad687eb43939df3fd3fd33ef7665abc82e44b8b53b246d1ab","observation_id":"7eb10dfd-3ad0-4ff0-a1c4-34a8150180a9","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Ordered reliability bits guessing random additive noise decoding,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:fd9967507f375c523338519c7eba82a1b30dcdbe2cd1cce3e8d9ee5eff99ec9f","observation_id":"d7552823-922f-4067-a090-0c85b8c966cf","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Soft decoding without soft demapping with ORBGRAND,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:0392c9e568255a42bb0919441a22b3a1d8470cbbf66e9dfc4452d9ae392720f7","observation_id":"8e4f7ce8-579a-48c0-a070-8dc167a2a3a2","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Block turbo decoding with ORBGRAND,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:efdee84b4f899920659e2284a70eb78d8d44215165aacba3548707734bd5c580","observation_id":"b61bfacd-95d3-426a-a2b5-779fd22f3d6b","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"High-throughput and energy-efficient VLSI architecture for ordered reliability bits GRAND,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:555723db186628704b036cf4e34fac2f1d7ec2d374788ec41d233548abaae0c0","observation_id":"2aefa263-ea8a-4153-adeb-9758c7199427","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:ae7a94826bb9d96118647e2d39a9289354f602529a19ad3bc013000d12c0081e","observation_id":"fa5f0fed-9fa9-4dae-88c9-6319df90469e","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Efficient ORBGRAND implementation with parallel noise sequence generation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:8b48736fc935b8c7f58750721961f94ec6c8cd2f341af486629190f910894778","observation_id":"7b5189c0-81fc-4103-872c-ec01c4dca191","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Improved ORB-GRAND for PAC codes,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:cb63ddc74c213cbaf3344327c43696fc5c1e4f0ef841288db51ec4b8cf9c2dc3","observation_id":"66f21009-1446-4b3d-8bd4-cc3b326f9ffe","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"A fixed latency ORBGRAND decoder architecture with LUT-aided error-pattern scheduling,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:8a45e7a30b3abf961b7eedffa01f63f9b1f65e19806dffeb0dcc9198faed4167","observation_id":"4d9d3b48-fbd8-4c52-bfea-fa3e5346c4cb","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Approaching maximum likelihood decoding performance via reshuffling ORBGRAND,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:b120c1e37986188b36ad64f930da5c652cd9f469255a7922fe22792ae31068be","observation_id":"07f5d234-1f73-4dff-acae-0004448feca0","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"ORBGRAND is almost capacity-achieving,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:0988242e69a5ba80b7faf9db81551db9ce8cdc2a64e8cb7ff21d0c10acddd1f0","observation_id":"b9c4b385-3f7a-4794-9a82-e887c08c17f9","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"ORBGRAND: Achievable rate for general bit channels and application in BICM,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:fa9591ce1d36520cafa2f34929d7eebd4a9dab551245a607fb5b6f646006510a","observation_id":"c76a871a-d6d5-4bdc-9cd2-07f37a5938b9","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.00347","last_updated":"2026-06-22T05:48:57Z","snapshot_observed_at":"2026-08-03T19:39:54.330033Z","submitted_at":"2025-11-29T06:36:33Z","title":"ORBGRAND Is Exactly Capacity-achieving via Rank Companding","version":5},"cited_work":{"arxiv_id":"2512.00347","doi":null,"metadata_source":"pith","pith_arxiv_id":"2512.00347","snapshot_observed_at":"2026-07-01T18:05:58.951917Z","title":"ORBGRAND Is Exactly Capacity-achieving via Rank Companding","venue":"cs.IT","work_id":"b0e4a3c7-a27e-4561-abf2-77bf1c0214aa","year":2025},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"cited_paper":"/paper/2512.00347","citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:5643351384f6eb7d55b37e97209ca07ac983c3b41faf61cd84beb7a78bf6883b","observation_id":"649c5eb9-cb2c-457a-b15b-6713ad00b0a0","resolution":{"observed_at":"2026-07-01T18:05:58.953395Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2603.07526","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-01T18:05:58.954525Z","title":"A finite-blocklength analysis for ORBGRAND,","venue":null,"work_id":"98438e27-d728-4560-9752-bc53a05e6866","year":2026},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:48266b8c8ba0dbb7bbede2488fef6c3ea58a64349b36e4e1652af648b10186b0","observation_id":"e4ae49cb-567b-4d6a-bd3b-03db68c54f5e","resolution":{"observed_at":"2026-07-01T18:05:58.956024Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-29T02:33:46.082904Z","title":"List-GRAND: A practical way to achieve maximum likelihood decoding,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:595544ee2772bfee735a6e1af4bda27f703efe5e5f6c7dcb71c3dbb9d3290378","observation_id":"070d7b30-e0f7-4847-8144-186aeeafcd67","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Upgrade error detection to prediction with GRAND,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:906dae1fb5a6ba6731dac62b476b84034af8c5a2b28634e46f8f58c7797a1c74","observation_id":"8c8b1e97-a082-47b1-b706-dbc8da9c5fe8","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Soft-output (SO) GRAND and iterative decoding to outperform LDPC codes,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:c97099a0e10dc92f58527744159c0d6bc997f4f70f7c2b0f57707e8e43105c72","observation_id":"6fd5aa5f-1fac-4bfd-b889-95294e947f44","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Soft-output guessing codeword decoding,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:3bec27a587f185bcd21d87ab2bbd19d3b405fe46353db3f10e1c7c8455c3a723","observation_id":"f692d85d-5c26-409f-b17a-c7377897be6d","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"Feller,An Introduction to Probability Theory and Its Applications, Volume I, 3rd ed","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:49791acdb3d6e7223d802bf8f05c8b6c10799b13dcbf09bbfdeffe1c6cd0f16a","observation_id":"3a055868-c33a-46da-bdf5-d9c9e18a95b4","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T02:33:46.082904Z","title":"A theorem on the distribution of weights in a systematic code,","venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-29T02:33:46.082904Z"},"links":{"citing_paper":"/paper/2606.28030"},"observation_digest":"sha256:797ea54343ac2648bbd4dde720804b13f1a396e2a4f15c338f0985e21aebf83a","observation_id":"3c9e221a-ee83-442d-86ce-f86cb87e809c","resolution":{"observed_at":"2026-06-29T02:33:46.082904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.28030","last_updated":"2026-06-26T12:36:16Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-07-07T00:02:09.217954Z","submitted_at":"2026-06-26T12:36:16Z","title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":36,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":38},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 1 inbound Pith citation observation for arXiv:2606.28030."}