{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:W4RYYR6FGUWS3DJSOJQERL5NGN","short_pith_number":"pith:W4RYYR6F","schema_version":"1.0","canonical_sha256":"b7238c47c5352d2d8d32726048afad33745c13f3612e167a803b0ddd4dbc3e8d","source":{"kind":"arxiv","id":"2412.20771","version":2},"attestation_state":"computed","paper":{"title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shubhransh Singhvi","submitted_at":"2024-12-30T07:42:24Z","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."},"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":"2412.20771","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-12-30T07:42:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0d3f12eef45c10a740ec0e1da36fdbbbc158ab688aa15ca9477a515de540d71e","abstract_canon_sha256":"bf29be96c0e5b4e30a239a285049a901538d303be5d92f428e26eef18f675350"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:34.302538Z","signature_b64":"8r7/VEuEobGqxhhbpyaN0J9ajttVIfC1R076MSJJjNf+rInDSIbZQ2PZ8owxHB3sYgvMmknqLtdm6aovs7c6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7238c47c5352d2d8d32726048afad33745c13f3612e167a803b0ddd4dbc3e8d","last_reissued_at":"2026-07-05T11:29:34.301969Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:34.301969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shubhransh Singhvi","submitted_at":"2024-12-30T07:42:24Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.20771","kind":"arxiv","version":2},"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/2412.20771/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":"2412.20771","created_at":"2026-07-05T11:29:34.302048+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.20771v2","created_at":"2026-07-05T11:29:34.302048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.20771","created_at":"2026-07-05T11:29:34.302048+00:00"},{"alias_kind":"pith_short_12","alias_value":"W4RYYR6FGUWS","created_at":"2026-07-05T11:29:34.302048+00:00"},{"alias_kind":"pith_short_16","alias_value":"W4RYYR6FGUWS3DJS","created_at":"2026-07-05T11:29:34.302048+00:00"},{"alias_kind":"pith_short_8","alias_value":"W4RYYR6F","created_at":"2026-07-05T11:29:34.302048+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.02452","citing_title":"Decoding Insertions/Deletions via List Recovery","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W4RYYR6FGUWS3DJSOJQERL5NGN","json":"https://pith.science/pith/W4RYYR6FGUWS3DJSOJQERL5NGN.json","graph_json":"https://pith.science/api/pith-number/W4RYYR6FGUWS3DJSOJQERL5NGN/graph.json","events_json":"https://pith.science/api/pith-number/W4RYYR6FGUWS3DJSOJQERL5NGN/events.json","paper":"https://pith.science/paper/W4RYYR6F"},"agent_actions":{"view_html":"https://pith.science/pith/W4RYYR6FGUWS3DJSOJQERL5NGN","download_json":"https://pith.science/pith/W4RYYR6FGUWS3DJSOJQERL5NGN.json","view_paper":"https://pith.science/paper/W4RYYR6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.20771&json=true","fetch_graph":"https://pith.science/api/pith-number/W4RYYR6FGUWS3DJSOJQERL5NGN/graph.json","fetch_events":"https://pith.science/api/pith-number/W4RYYR6FGUWS3DJSOJQERL5NGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W4RYYR6FGUWS3DJSOJQERL5NGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W4RYYR6FGUWS3DJSOJQERL5NGN/action/storage_attestation","attest_author":"https://pith.science/pith/W4RYYR6FGUWS3DJSOJQERL5NGN/action/author_attestation","sign_citation":"https://pith.science/pith/W4RYYR6FGUWS3DJSOJQERL5NGN/action/citation_signature","submit_replication":"https://pith.science/pith/W4RYYR6FGUWS3DJSOJQERL5NGN/action/replication_record"}},"created_at":"2026-07-05T11:29:34.302048+00:00","updated_at":"2026-07-05T11:29:34.302048+00:00"}