{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:W4RYYR6FGUWS3DJSOJQERL5NGN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bf29be96c0e5b4e30a239a285049a901538d303be5d92f428e26eef18f675350","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-12-30T07:42:24Z","title_canon_sha256":"0d3f12eef45c10a740ec0e1da36fdbbbc158ab688aa15ca9477a515de540d71e"},"schema_version":"1.0","source":{"id":"2412.20771","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.20771","created_at":"2026-07-05T11:29:34Z"},{"alias_kind":"arxiv_version","alias_value":"2412.20771v2","created_at":"2026-07-05T11:29:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.20771","created_at":"2026-07-05T11:29:34Z"},{"alias_kind":"pith_short_12","alias_value":"W4RYYR6FGUWS","created_at":"2026-07-05T11:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"W4RYYR6FGUWS3DJS","created_at":"2026-07-05T11:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"W4RYYR6F","created_at":"2026-07-05T11:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:d3d69bcbb1a4b00f295755156a44bb78c03f5c4511db9a599b624acc1b8bc3e3","target":"graph","created_at":"2026-07-05T11:29:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.20771/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Constructing Reed-Solomon (RS) codes that can correct insertion and deletion (ins-del) errors has been the focus of several recent studies. However, efficient decoding algorithms for such codes have received less attention and remain a significant open problem. In this work, we take a first step toward addressing this problem by designing a decoding algorithm for the case of $2$-dimensional RS codes that can correct deletions up to the half-Singleton bound and is optimal in terms of field operations.","authors_text":"Shubhransh Singhvi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.20771","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d78a527fdadc57b035018303cd5004b1bab2dc7652ca7ca6f3a0474be5c02e8a","target":"record","created_at":"2026-07-05T11:29:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bf29be96c0e5b4e30a239a285049a901538d303be5d92f428e26eef18f675350","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-12-30T07:42:24Z","title_canon_sha256":"0d3f12eef45c10a740ec0e1da36fdbbbc158ab688aa15ca9477a515de540d71e"},"schema_version":"1.0","source":{"id":"2412.20771","kind":"arxiv","version":2}},"canonical_sha256":"b7238c47c5352d2d8d32726048afad33745c13f3612e167a803b0ddd4dbc3e8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7238c47c5352d2d8d32726048afad33745c13f3612e167a803b0ddd4dbc3e8d","first_computed_at":"2026-07-05T11:29:34.301969Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:29:34.301969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8r7/VEuEobGqxhhbpyaN0J9ajttVIfC1R076MSJJjNf+rInDSIbZQ2PZ8owxHB3sYgvMmknqLtdm6aovs7c6DA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:29:34.302538Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.20771","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d78a527fdadc57b035018303cd5004b1bab2dc7652ca7ca6f3a0474be5c02e8a","sha256:d3d69bcbb1a4b00f295755156a44bb78c03f5c4511db9a599b624acc1b8bc3e3"],"state_sha256":"4b2318bbf648dcd3e3c68718aa986a02e523dee67c69498a8cb0157eefbd3039"}