{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IS7CPMOKINSLIZIIVRG3LSWRNQ","short_pith_number":"pith:IS7CPMOK","schema_version":"1.0","canonical_sha256":"44be27b1ca4364b46508ac4db5cad16c337ebf4839bfc32955a2fa68538aa083","source":{"kind":"arxiv","id":"2606.28030","version":1},"attestation_state":"computed","paper":{"title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Li Wan, Wenyi Zhang","submitted_at":"2026-06-26T12:36:16Z","abstract_excerpt":"Guessing Random Additive Noise Decoding (GRAND) performs decoding by sequentially guessing channel error patterns (EPs). Ordered Reliability Bits GRAND (ORBGRAND) is a notable instance suitable for efficient implementation, as it schedules EPs solely according to the ranking of soft channel outputs. In this paper, we generalize this principle to a broader class of GRAND algorithms whose testing order depends only on reliability ranking, referred to as ORB-type GRAND. We develop a unified analytical framework based on a key quantity termed the average guessing posterior (AGP), which captures th"},"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":"2606.28030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-26T12:36:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0ac98bbb844e62e03e37d6b904d298243cd532a7ac8f22921ce854e53b2500aa","abstract_canon_sha256":"18c467cbb618d3b823a74c3acef2254c78c7b0d42f70f10856ad2c77862de0b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T01:14:55.627558Z","signature_b64":"2nxRjZBQ6RM9UKEDQhigB2ljI5xerU66SXMi88YIkqgFJor8RJaWrKMcf/hjc9koNpx3xXsLkwAEeGLeeAAGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44be27b1ca4364b46508ac4db5cad16c337ebf4839bfc32955a2fa68538aa083","last_reissued_at":"2026-06-29T01:14:55.627138Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T01:14:55.627138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance Analysis and Optimal Design of ORB-Type GRAND Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Li Wan, Wenyi Zhang","submitted_at":"2026-06-26T12:36:16Z","abstract_excerpt":"Guessing Random Additive Noise Decoding (GRAND) performs decoding by sequentially guessing channel error patterns (EPs). Ordered Reliability Bits GRAND (ORBGRAND) is a notable instance suitable for efficient implementation, as it schedules EPs solely according to the ranking of soft channel outputs. In this paper, we generalize this principle to a broader class of GRAND algorithms whose testing order depends only on reliability ranking, referred to as ORB-type GRAND. We develop a unified analytical framework based on a key quantity termed the average guessing posterior (AGP), which captures th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28030","kind":"arxiv","version":1},"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/2606.28030/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":"2606.28030","created_at":"2026-06-29T01:14:55.627203+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.28030v1","created_at":"2026-06-29T01:14:55.627203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28030","created_at":"2026-06-29T01:14:55.627203+00:00"},{"alias_kind":"pith_short_12","alias_value":"IS7CPMOKINSL","created_at":"2026-06-29T01:14:55.627203+00:00"},{"alias_kind":"pith_short_16","alias_value":"IS7CPMOKINSLIZII","created_at":"2026-06-29T01:14:55.627203+00:00"},{"alias_kind":"pith_short_8","alias_value":"IS7CPMOK","created_at":"2026-06-29T01:14:55.627203+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/IS7CPMOKINSLIZIIVRG3LSWRNQ","json":"https://pith.science/pith/IS7CPMOKINSLIZIIVRG3LSWRNQ.json","graph_json":"https://pith.science/api/pith-number/IS7CPMOKINSLIZIIVRG3LSWRNQ/graph.json","events_json":"https://pith.science/api/pith-number/IS7CPMOKINSLIZIIVRG3LSWRNQ/events.json","paper":"https://pith.science/paper/IS7CPMOK"},"agent_actions":{"view_html":"https://pith.science/pith/IS7CPMOKINSLIZIIVRG3LSWRNQ","download_json":"https://pith.science/pith/IS7CPMOKINSLIZIIVRG3LSWRNQ.json","view_paper":"https://pith.science/paper/IS7CPMOK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.28030&json=true","fetch_graph":"https://pith.science/api/pith-number/IS7CPMOKINSLIZIIVRG3LSWRNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/IS7CPMOKINSLIZIIVRG3LSWRNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IS7CPMOKINSLIZIIVRG3LSWRNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IS7CPMOKINSLIZIIVRG3LSWRNQ/action/storage_attestation","attest_author":"https://pith.science/pith/IS7CPMOKINSLIZIIVRG3LSWRNQ/action/author_attestation","sign_citation":"https://pith.science/pith/IS7CPMOKINSLIZIIVRG3LSWRNQ/action/citation_signature","submit_replication":"https://pith.science/pith/IS7CPMOKINSLIZIIVRG3LSWRNQ/action/replication_record"}},"created_at":"2026-06-29T01:14:55.627203+00:00","updated_at":"2026-06-29T01:14:55.627203+00:00"}