{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XZO6O2UIKLKG7RYWNTJPBXAEY4","short_pith_number":"pith:XZO6O2UI","schema_version":"1.0","canonical_sha256":"be5de76a8852d46fc7166cd2f0dc04c73b6e30bac5807a1afa5aa9bc85e7c186","source":{"kind":"arxiv","id":"2301.09778","version":1},"attestation_state":"computed","paper":{"title":"GRAND-EDGE: A Universal, Jamming-resilient Algorithm with Error-and-Erasure Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Starobinski, Furkan Ercan, Ken R. Duffy, Kevin Galligan, Muriel Medard, Rabia Tugce Yazicigil","submitted_at":"2023-01-24T01:42:58Z","abstract_excerpt":"Random jammers that overpower transmitted signals are a practical concern for many wireless communication protocols. As such, wireless receivers must be able to cope with standard channel noise and jamming (intentional or unintentional). To address this challenge, we propose a novel method to augment the resilience of the recent family of universal error-correcting GRAND algorithms. This method, called Erasure Decoding by Gaussian Elimination (EDGE), impacts the syndrome check block and is applicable to any variant of GRAND. We show that the proposed EDGE method naturally reverts to the origin"},"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":"2301.09778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-01-24T01:42:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"79b22cdac4be47742077755648ec3dca6e48d47be7b8ee4cb7e5b0e1d2e0ff1a","abstract_canon_sha256":"a6c00b6149deda091669b9c38acea19816c7d977f6c5370241b995eefd127079"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:35:05.603776Z","signature_b64":"M9ok2PrUG5zFpAf52sQn09kSMLpVqbaxveu4GTajhiuJv1G1FtSjZLCBSmYO7XYyL4bc6lOonLszaLAJegBBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be5de76a8852d46fc7166cd2f0dc04c73b6e30bac5807a1afa5aa9bc85e7c186","last_reissued_at":"2026-07-05T05:35:05.603344Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:35:05.603344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GRAND-EDGE: A Universal, Jamming-resilient Algorithm with Error-and-Erasure Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"David Starobinski, Furkan Ercan, Ken R. Duffy, Kevin Galligan, Muriel Medard, Rabia Tugce Yazicigil","submitted_at":"2023-01-24T01:42:58Z","abstract_excerpt":"Random jammers that overpower transmitted signals are a practical concern for many wireless communication protocols. As such, wireless receivers must be able to cope with standard channel noise and jamming (intentional or unintentional). To address this challenge, we propose a novel method to augment the resilience of the recent family of universal error-correcting GRAND algorithms. This method, called Erasure Decoding by Gaussian Elimination (EDGE), impacts the syndrome check block and is applicable to any variant of GRAND. We show that the proposed EDGE method naturally reverts to the origin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.09778","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/2301.09778/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":"2301.09778","created_at":"2026-07-05T05:35:05.603406+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.09778v1","created_at":"2026-07-05T05:35:05.603406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.09778","created_at":"2026-07-05T05:35:05.603406+00:00"},{"alias_kind":"pith_short_12","alias_value":"XZO6O2UIKLKG","created_at":"2026-07-05T05:35:05.603406+00:00"},{"alias_kind":"pith_short_16","alias_value":"XZO6O2UIKLKG7RYW","created_at":"2026-07-05T05:35:05.603406+00:00"},{"alias_kind":"pith_short_8","alias_value":"XZO6O2UI","created_at":"2026-07-05T05:35:05.603406+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/XZO6O2UIKLKG7RYWNTJPBXAEY4","json":"https://pith.science/pith/XZO6O2UIKLKG7RYWNTJPBXAEY4.json","graph_json":"https://pith.science/api/pith-number/XZO6O2UIKLKG7RYWNTJPBXAEY4/graph.json","events_json":"https://pith.science/api/pith-number/XZO6O2UIKLKG7RYWNTJPBXAEY4/events.json","paper":"https://pith.science/paper/XZO6O2UI"},"agent_actions":{"view_html":"https://pith.science/pith/XZO6O2UIKLKG7RYWNTJPBXAEY4","download_json":"https://pith.science/pith/XZO6O2UIKLKG7RYWNTJPBXAEY4.json","view_paper":"https://pith.science/paper/XZO6O2UI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.09778&json=true","fetch_graph":"https://pith.science/api/pith-number/XZO6O2UIKLKG7RYWNTJPBXAEY4/graph.json","fetch_events":"https://pith.science/api/pith-number/XZO6O2UIKLKG7RYWNTJPBXAEY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XZO6O2UIKLKG7RYWNTJPBXAEY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XZO6O2UIKLKG7RYWNTJPBXAEY4/action/storage_attestation","attest_author":"https://pith.science/pith/XZO6O2UIKLKG7RYWNTJPBXAEY4/action/author_attestation","sign_citation":"https://pith.science/pith/XZO6O2UIKLKG7RYWNTJPBXAEY4/action/citation_signature","submit_replication":"https://pith.science/pith/XZO6O2UIKLKG7RYWNTJPBXAEY4/action/replication_record"}},"created_at":"2026-07-05T05:35:05.603406+00:00","updated_at":"2026-07-05T05:35:05.603406+00:00"}