{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YKZ5KJTIKBETPL3ND6Y3ONTMYQ","short_pith_number":"pith:YKZ5KJTI","schema_version":"1.0","canonical_sha256":"c2b3d52668504937af6d1fb1b7366cc41c9ce2d389bf383de6f88d398cd5a4d0","source":{"kind":"arxiv","id":"2401.15946","version":3},"attestation_state":"computed","paper":{"title":"Approaching Maximum Likelihood Decoding Performance via Reshuffling ORBGRAND","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Li Wan, Wenyi Zhang","submitted_at":"2024-01-29T08:13:14Z","abstract_excerpt":"Guessing random additive noise decoding (GRAND) is a recently proposed decoding paradigm particularly suitable for codes with short length and high rate. Among its variants, ordered reliability bits GRAND (ORBGRAND) exploits soft information in a simple and effective fashion to schedule its queries, thereby allowing efficient hardware implementation. Compared with maximum likelihood (ML) decoding, however, ORBGRAND still exhibits noticeable performance loss in terms of block error rate (BLER). In order to improve the performance of ORBGRAND while still retaining its amenability to hardware imp"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2401.15946","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2024-01-29T08:13:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"61dd32159b07612c34324b5509409068250f78327b151778ea8eaedbc90e42dc","abstract_canon_sha256":"d043405e3ed315174843dc89fc8c9106653708f8773dbee6b30bfac7584934d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:12:47.743738Z","signature_b64":"7JtAFhduYGN/+Psq4x9ZDNZMrN9G8z1kBxTBudBz6oVVyzmVKRw1UECso3NjRkgyrzEvHcB2NJyBK0oI0Kg6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2b3d52668504937af6d1fb1b7366cc41c9ce2d389bf383de6f88d398cd5a4d0","last_reissued_at":"2026-07-05T08:12:47.743268Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:12:47.743268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approaching Maximum Likelihood Decoding Performance via Reshuffling ORBGRAND","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Li Wan, Wenyi Zhang","submitted_at":"2024-01-29T08:13:14Z","abstract_excerpt":"Guessing random additive noise decoding (GRAND) is a recently proposed decoding paradigm particularly suitable for codes with short length and high rate. Among its variants, ordered reliability bits GRAND (ORBGRAND) exploits soft information in a simple and effective fashion to schedule its queries, thereby allowing efficient hardware implementation. Compared with maximum likelihood (ML) decoding, however, ORBGRAND still exhibits noticeable performance loss in terms of block error rate (BLER). In order to improve the performance of ORBGRAND while still retaining its amenability to hardware imp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.15946","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.15946/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2401.15946","created_at":"2026-07-05T08:12:47.743326+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.15946v3","created_at":"2026-07-05T08:12:47.743326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.15946","created_at":"2026-07-05T08:12:47.743326+00:00"},{"alias_kind":"pith_short_12","alias_value":"YKZ5KJTIKBET","created_at":"2026-07-05T08:12:47.743326+00:00"},{"alias_kind":"pith_short_16","alias_value":"YKZ5KJTIKBETPL3N","created_at":"2026-07-05T08:12:47.743326+00:00"},{"alias_kind":"pith_short_8","alias_value":"YKZ5KJTI","created_at":"2026-07-05T08:12:47.743326+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YKZ5KJTIKBETPL3ND6Y3ONTMYQ","json":"https://pith.science/pith/YKZ5KJTIKBETPL3ND6Y3ONTMYQ.json","graph_json":"https://pith.science/api/pith-number/YKZ5KJTIKBETPL3ND6Y3ONTMYQ/graph.json","events_json":"https://pith.science/api/pith-number/YKZ5KJTIKBETPL3ND6Y3ONTMYQ/events.json","paper":"https://pith.science/paper/YKZ5KJTI"},"agent_actions":{"view_html":"https://pith.science/pith/YKZ5KJTIKBETPL3ND6Y3ONTMYQ","download_json":"https://pith.science/pith/YKZ5KJTIKBETPL3ND6Y3ONTMYQ.json","view_paper":"https://pith.science/paper/YKZ5KJTI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.15946&json=true","fetch_graph":"https://pith.science/api/pith-number/YKZ5KJTIKBETPL3ND6Y3ONTMYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/YKZ5KJTIKBETPL3ND6Y3ONTMYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YKZ5KJTIKBETPL3ND6Y3ONTMYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YKZ5KJTIKBETPL3ND6Y3ONTMYQ/action/storage_attestation","attest_author":"https://pith.science/pith/YKZ5KJTIKBETPL3ND6Y3ONTMYQ/action/author_attestation","sign_citation":"https://pith.science/pith/YKZ5KJTIKBETPL3ND6Y3ONTMYQ/action/citation_signature","submit_replication":"https://pith.science/pith/YKZ5KJTIKBETPL3ND6Y3ONTMYQ/action/replication_record"}},"created_at":"2026-07-05T08:12:47.743326+00:00","updated_at":"2026-07-05T08:12:47.743326+00:00"}