{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:V64KL75GMKVESPOLK2H3ZVLQTS","short_pith_number":"pith:V64KL75G","schema_version":"1.0","canonical_sha256":"afb8a5ffa662aa493dcb568fbcd5709cbd467bfddcb95bc664e6214062e03fb1","source":{"kind":"arxiv","id":"2202.13951","version":3},"attestation_state":"computed","paper":{"title":"Ordered Reliability Bits Guessing Random Additive Noise Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ken R. Duffy, Muriel Medard, Wei An","submitted_at":"2022-02-28T17:06:33Z","abstract_excerpt":"Error correction techniques traditionally focus on the co-design of restricted code-structures in tandem with code-specific decoders that are computationally efficient when decoding long codes in hardware. Modern applications are, however, driving demand for ultra-reliable low-latency communications (URLLC), rekindling interest in the performance of shorter, higher-rate error correcting codes, and raising the possibility of revisiting universal, code-agnostic decoders.\n  To that end, here we introduce a soft-detection variant of Guessing Random Additive Noise Decoding (GRAND) called Ordered Re"},"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":"2202.13951","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-02-28T17:06:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6c9c0b7bba6689f1f199494d47da19a145f94c7a54eb019a0999295bedffca22","abstract_canon_sha256":"37e25b9e7dbb34f2980615ed3e331b7e9990fcff8d22151ba1921eb9275a2e37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:05:31.340927Z","signature_b64":"stt0cIeOiTC2wCd1S/t5bShr6N+XC7RVbVOl3jFAG6wreGIFV5WnO6NBCWfQ386boGpbFX13O5gE02RreAqwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afb8a5ffa662aa493dcb568fbcd5709cbd467bfddcb95bc664e6214062e03fb1","last_reissued_at":"2026-07-05T05:05:31.340497Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:05:31.340497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ordered Reliability Bits Guessing Random Additive Noise Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ken R. Duffy, Muriel Medard, Wei An","submitted_at":"2022-02-28T17:06:33Z","abstract_excerpt":"Error correction techniques traditionally focus on the co-design of restricted code-structures in tandem with code-specific decoders that are computationally efficient when decoding long codes in hardware. Modern applications are, however, driving demand for ultra-reliable low-latency communications (URLLC), rekindling interest in the performance of shorter, higher-rate error correcting codes, and raising the possibility of revisiting universal, code-agnostic decoders.\n  To that end, here we introduce a soft-detection variant of Guessing Random Additive Noise Decoding (GRAND) called Ordered Re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.13951","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/2202.13951/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":"2202.13951","created_at":"2026-07-05T05:05:31.340565+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.13951v3","created_at":"2026-07-05T05:05:31.340565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.13951","created_at":"2026-07-05T05:05:31.340565+00:00"},{"alias_kind":"pith_short_12","alias_value":"V64KL75GMKVE","created_at":"2026-07-05T05:05:31.340565+00:00"},{"alias_kind":"pith_short_16","alias_value":"V64KL75GMKVESPOL","created_at":"2026-07-05T05:05:31.340565+00:00"},{"alias_kind":"pith_short_8","alias_value":"V64KL75G","created_at":"2026-07-05T05:05:31.340565+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/V64KL75GMKVESPOLK2H3ZVLQTS","json":"https://pith.science/pith/V64KL75GMKVESPOLK2H3ZVLQTS.json","graph_json":"https://pith.science/api/pith-number/V64KL75GMKVESPOLK2H3ZVLQTS/graph.json","events_json":"https://pith.science/api/pith-number/V64KL75GMKVESPOLK2H3ZVLQTS/events.json","paper":"https://pith.science/paper/V64KL75G"},"agent_actions":{"view_html":"https://pith.science/pith/V64KL75GMKVESPOLK2H3ZVLQTS","download_json":"https://pith.science/pith/V64KL75GMKVESPOLK2H3ZVLQTS.json","view_paper":"https://pith.science/paper/V64KL75G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.13951&json=true","fetch_graph":"https://pith.science/api/pith-number/V64KL75GMKVESPOLK2H3ZVLQTS/graph.json","fetch_events":"https://pith.science/api/pith-number/V64KL75GMKVESPOLK2H3ZVLQTS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V64KL75GMKVESPOLK2H3ZVLQTS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V64KL75GMKVESPOLK2H3ZVLQTS/action/storage_attestation","attest_author":"https://pith.science/pith/V64KL75GMKVESPOLK2H3ZVLQTS/action/author_attestation","sign_citation":"https://pith.science/pith/V64KL75GMKVESPOLK2H3ZVLQTS/action/citation_signature","submit_replication":"https://pith.science/pith/V64KL75GMKVESPOLK2H3ZVLQTS/action/replication_record"}},"created_at":"2026-07-05T05:05:31.340565+00:00","updated_at":"2026-07-05T05:05:31.340565+00:00"}