{"as_of":"2026-08-19T21:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ae9955a40b72ffae4a15a16faad491c97572004b23e287d4b998028e883a2b22","coverage":[{"denominator":77,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":77,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T23:24:57.881252Z","state":"measured"},{"denominator":78,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":78,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T01:07:26.051415Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-16T01:07:26.255970Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"cited_work":{"arxiv_id":"2412.20771","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.20771","snapshot_observed_at":"2026-08-16T01:07:26.255970Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","venue":"cs.IT","work_id":"e1ea6822-d7fb-4f39-9d22-c6a4c2a1eb6f","year":2024},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T18:12:44.919033Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.051415Z"},"links":{"cited_paper":"/paper/2412.20771","citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:5f085f9664ec208330d9180674b4b2fc1e43c0082f65f9fc136b73a8641124a0","observation_id":"fb6a3a22-6ec4-4ff3-9eeb-1af25259b98c","resolution":{"observed_at":"2026-08-16T01:07:26.262128Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.20771/citation-record","integrity":"/paper/2412.20771/integrity","json":"/paper/2412.20771/citation-record.json","paper":"/paper/2412.20771"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:59.182563Z","title":"On linear and cyclic codes for correcting deletions","venue":null,"work_id":"cf00b6f8-9c8b-4534-ac4d-fe05050ef04a","year":2007},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.522569Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:68e8e9744d526d5c1b617b99286003b1cb507c1ae2d819ec53a1659668f4ca89","observation_id":"3aca837b-181a-40ec-8937-f0e2e4ab807f","resolution":{"observed_at":"2026-08-10T23:24:59.188842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:59.166456Z","title":"On list decoding of insertions and deletions under the reconstruction model","venue":null,"work_id":"7be3b891-9e87-45b4-87b4-fae3e99a1aad","year":2021},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.528089Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:d6144fc2b9e183c45a5eca30de86ef473d835b5f47bfbfce335cb46e4467bcb3","observation_id":"7f13cb78-fe46-4214-a78e-2fea7dad52c0","resolution":{"observed_at":"2026-08-10T23:24:59.171498Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:59.149888Z","title":"Data storage in dna with fewer synthesis cycles using composite dna letters","venue":null,"work_id":"673057ed-1ea6-4c6f-b69a-9f128fce28fc","year":2019},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.532615Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:6b59982a416400645271dc7246b0281bb445802223b570ce61b48c84b73dbdfc","observation_id":"41f58cc3-d41e-40be-a5f5-d5252be4ec74","resolution":{"observed_at":"2026-08-10T23:24:59.155319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:59.133719Z","title":"On the size of balls and anticodes of small diameter under the fixed-length levenshtein metric","venue":null,"work_id":"323c675f-f003-4186-ad68-dfd15fe79984","year":2022},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.537245Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:2339e017b8a548e654df061cec12b090c768f778f4d3a66d58eb0ec9ee3f3ec9","observation_id":"4f5ad74f-5c9c-4f6c-8a74-98a1a869cb29","resolution":{"observed_at":"2026-08-10T23:24:59.139198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:59.116194Z","title":"On the structure of cyclotomic fourier transforms and their applications to reed-solomon codes","venue":null,"work_id":"23cccfac-8065-4f07-b593-3a02ec4378ad","year":2011},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.542102Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:bdf1dd870d20d61a31537a8c8727d9c33619a148aa6f5a2c260ecd5664e73c4c","observation_id":"11a43c28-af1b-43b2-8cf8-e8dcbe5c523f","resolution":{"observed_at":"2026-08-10T23:24:59.122399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:59.099175Z","title":null,"venue":null,"work_id":"4fb8df4b-5b0d-4b14-b12e-15af405e8839","year":1968},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.547060Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:4168c5d43c08df07f0c74eca97ffdeb89dddb6c4ddc167b1380e1cccd460a1a1","observation_id":"0758a1d7-e977-42bf-a291-73da8635c379","resolution":{"observed_at":"2026-08-10T23:24:59.104343Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:59.081950Z","title":"Efficient low-redundancy codes for correcting multiple deletions","venue":null,"work_id":"fb42cb93-1040-4162-ad7c-29b20668c60e","year":2017},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.552735Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:b7f9ebf9bfa66201c79a0189afa10c3fc6356b872531e40676b4109c61e033c8","observation_id":"c56526e1-bb15-498a-b0bd-73696b39503d","resolution":{"observed_at":"2026-08-10T23:24:59.087193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:59.064573Z","title":"Improved singleton bound on insertion-deletion codes and optimal constructions","venue":null,"work_id":"6d55a4e5-8998-4787-a099-554a1458f126","year":2022},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.556956Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:7f8ebf1344658fc85b0069398f348d94a56de9bb68b3905afe396abbd3174542","observation_id":"ccff74ef-6317-4a3f-b315-2968acaf1f52","resolution":{"observed_at":"2026-08-10T23:24:59.070258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:59.047913Z","title":"Coordinate-ordering-free upper bounds for linear insertion-deletion codes","venue":null,"work_id":"af559437-4d4c-4a8b-9ed2-11022c680aee","year":2022},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.561297Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:af23b2d39614f32702c2cd94d85159374afdfe663a00ee0c5ddc6117e7106f5d","observation_id":"ad0570f3-f306-4701-b593-64d0f0d89d54","resolution":{"observed_at":"2026-08-10T23:24:59.053243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:59.031511Z","title":"Efficient linear and affine codes for correcting insertions/deletions","venue":null,"work_id":"b07a0e32-21c4-4dfe-8a93-c3058da042a3","year":2023},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.565602Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:41b83636cd79f0874f04d5440bae0ef0d0576e32f4cdec7bd2c72dd2e3a3892c","observation_id":"67093d03-ef9f-473a-b9a0-a3f137fe0022","resolution":{"observed_at":"2026-08-10T23:24:59.036319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.17370","last_updated":"2023-03-30T13:32:34Z","snapshot_observed_at":"2026-08-19T16:43:16.970213Z","submitted_at":"2023-03-30T13:32:34Z","title":"Linear Insertion Deletion Codes in the High-Noise and High-Rate Regimes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.17370","snapshot_observed_at":"2026-08-10T23:24:57.570023Z","title":"Linear insertion deletion codes in the high-noise and high-rate regimes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.570023Z"},"links":{"cited_paper":"/paper/2303.17370","citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:bae4df5537429a4a3576930dd8e66105308a60f0e04460aea7a5abe1c9831857","observation_id":"8906ee56-4b27-403b-9769-91df0db22147","resolution":{"observed_at":"2026-08-10T23:24:57.570023Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:59.014747Z","title":"Deterministic document exchange protocols, and almost optimal binary codes for edit errors","venue":null,"work_id":"781d090a-e0f3-4769-921c-3c1ab87c3f5c","year":2018},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.575209Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:48de50799f3220440f69923d8599055d4baa0978d53e49b4fc7c39f1fc2a00a4","observation_id":"c7d3ad6a-bf94-4b71-93be-64b4be4d3f5f","resolution":{"observed_at":"2026-08-10T23:24:59.019979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.996831Z","title":"An overview of capacity results for synchronization channels","venue":null,"work_id":"624cf059-8e7c-472f-8aa3-0caaf273e097","year":2020},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.579934Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:abab066d4572386092b4474ad894f2d6aa0dd52df75aba7513eaeba2d65edb96","observation_id":"6741d59d-7926-4aba-ad64-fc0872d089f5","resolution":{"observed_at":"2026-08-10T23:24:59.002447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.07299","last_updated":"2024-07-10T01:41:15Z","snapshot_observed_at":"2026-08-16T13:35:36.208236Z","submitted_at":"2024-07-10T01:41:15Z","title":"Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.07299","snapshot_observed_at":"2026-08-10T23:24:57.584471Z","title":"Random reed-solomon codes achieve the half-singleton bound for insertions and deletions over linear-sized alphabets","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.584471Z"},"links":{"cited_paper":"/paper/2407.07299","citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:b86c6ed54ca63dea115e4f71bd1b6f25f50943004e0368c46f967c640e786be2","observation_id":"8dd17a71-e4ba-4ddb-9173-afa3ee998afe","resolution":{"observed_at":"2026-08-10T23:24:57.584471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.979634Z","title":"Explicit and efficient constructions of linear codes against adversarial insertions and deletions","venue":null,"work_id":"10f7b3da-0c9d-4bfd-b491-c4418893985f","year":2022},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.589192Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:d9a60c45f72954280faef1ae27bc74e9d045a1c5c78dcbd1c6c72f4bf08c3f0d","observation_id":"1856e00c-a404-49d0-b720-bfdb4bb7260f","resolution":{"observed_at":"2026-08-10T23:24:58.985231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.963514Z","title":"Reed solomon codes against adversarial insertions and deletions","venue":null,"work_id":"2b4f2c49-2458-4720-841a-0359ccf35f32","year":2023},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.593802Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:9ef44a086755ebc780e25c17b961ad68f2df3104328a14fe8c4f16bb749ed9fb","observation_id":"d6359821-039d-4845-a29c-7afa0897a841","resolution":{"observed_at":"2026-08-10T23:24:58.968712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.947066Z","title":"Optimal two-dimensional reed–solomon codes correcting insertions and deletions","venue":null,"work_id":"1de467cf-40dc-47fb-94bd-b0d0e15173d5","year":2024},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.598301Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:e33af7c8020642e35c5fee62c0bf0a4d79b047f440552b567913f36fc939508b","observation_id":"9075a171-466a-4647-b09f-bdb8da6ee9fa","resolution":{"observed_at":"2026-08-10T23:24:58.952733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.930459Z","title":"Explicit constructions of two-dimensional reed-solomon codes in high insertion and deletion noise regime","venue":null,"work_id":"66efc89d-7f71-466d-b77a-94e41fc851e7","year":2021},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.603029Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:4f18137005974e9d5fc7458727aa8c0cc773645fcb223cafb43102950ddec43d","observation_id":"c0512a66-fa5b-4340-a097-eb0d96bd8274","resolution":{"observed_at":"2026-08-10T23:24:58.935665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.914059Z","title":"Using reed–muller RM (1, m) codes over channels with synchronization and substitution errors","venue":null,"work_id":"3712e5c0-9d97-4755-937b-4c86a6e375f5","year":2007},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.607703Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:e0a1118d9e78f0858e86e35052089417a35734ef2ea4c00db825caf7d5daff0a","observation_id":"378c5579-f69e-4947-8427-d01819a68a5f","resolution":{"observed_at":"2026-08-10T23:24:58.919391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.897340Z","title":"Finding roots of polynomials over finite fields","venue":null,"work_id":"5c343635-5402-4169-83e8-128adcf4641e","year":2002},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.612319Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:5dd966278860a6e6d19e1e5dc502f27c0ac96f097636f28b2262f501942e650a","observation_id":"f986d013-79ab-448b-8f5e-0f147a64a022","resolution":{"observed_at":"2026-08-10T23:24:58.902841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.880556Z","title":"Efficient syndrome calculation via the inverse cyclotomic discrete fourier transform","venue":null,"work_id":"9a4bbe86-f000-4ce1-b910-cf7ba5f10dfc","year":2019},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.617585Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:65b82fe33d61d1a3b6cd0196cb3d7cb151fe880cd27b11c8652ed5a221a6002b","observation_id":"7d9a5506-4580-4a55-aecc-3a2e4d71216c","resolution":{"observed_at":"2026-08-10T23:24:58.885684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.864442Z","title":"Beyond single-deletion correcting codes: Substitutions and transpositions","venue":null,"work_id":"b36af638-8cae-4cc5-800c-0a3b03b5318f","year":2022},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.622229Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:8608122e5c942d4e61dcdbf2544044a446de8374a752bad15fbacc625b027e49","observation_id":"7e975a59-c159-4a4b-9a3b-c4141fb2c347","resolution":{"observed_at":"2026-08-10T23:24:58.869876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.848249Z","title":"Codes correcting two deletions","venue":null,"work_id":"ea6f9814-d32b-4fe2-94be-4c15c3b59d1a","year":2018},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.627067Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:46ca42ad8423ba89fd29a95e53b8caf397be425cd40f964dce3b2b9e2ab259e5","observation_id":"544caf71-ec1d-409a-88ec-34451a5ed35b","resolution":{"observed_at":"2026-08-10T23:24:58.853534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.831837Z","title":"A new algorithm for decoding reed-solomon codes","venue":null,"work_id":"8dfd4c55-b287-4696-87d3-8708e39beba8","year":2003},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.631615Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:d8f28131354924ede9df4e134f428ac5597796a87c5129e5e51fcd3f72bc2c44","observation_id":"fcee2118-f121-4330-a637-5580a57cfc79","resolution":{"observed_at":"2026-08-10T23:24:58.837112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.815000Z","title":"Additive fast fourier transforms over finite fields","venue":null,"work_id":"62345fbb-4294-4acd-a153-aa00d4c615b8","year":2010},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.635922Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:5908c420c99b3e70a69b1179e7419d49d34d20e5cc40594ce519d9b34552c2ec","observation_id":"7122c2be-ccc1-48ed-8a9f-f6ea58acffb8","resolution":{"observed_at":"2026-08-10T23:24:58.820657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.798764Z","title":"Gorenstein and N","venue":null,"work_id":"027628e1-dfca-4b6c-85d5-9a0e11a1c535","year":1961},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.640473Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:e62a464cbfab4982db68b7931010be9f896a6919c4c2b1da12d9ab9f1e3d52d1","observation_id":"374262e4-f29f-43ad-b34f-45f72f63d606","resolution":{"observed_at":"2026-08-10T23:24:58.803679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.782571Z","title":"Robust chemical preservation of digital information on dna in silica with error-correcting codes","venue":null,"work_id":"10d3c86b-fe98-44a9-ae88-edcd8688f140","year":2015},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.644842Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:939ce68f6a0bb36276156e8dba80de44aa3e50484ea77667105a7577ded72636","observation_id":"0f878b12-d099-4461-a504-65868ea8a584","resolution":{"observed_at":"2026-08-10T23:24:58.787954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.764645Z","title":"Guruswami and M","venue":null,"work_id":"615e02e0-0b83-4b6d-8346-3406c6b20e64","year":1999},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.649470Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:4b6dbe7dbbede68955256a0a5155f68aa4586bc658199efb6f6c1ebdbeea28ea","observation_id":"89302689-ce97-42e1-a81c-0988823c951d","resolution":{"observed_at":"2026-08-10T23:24:58.769877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.747753Z","title":"Optimally resilient codes for list-decoding from insertions and deletions","venue":null,"work_id":"451ef399-dbc6-483c-9538-21b7f7bdf1e1","year":2020},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.654090Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:fa6f2aaa4aea4f7751bf8d4fa54d93b6ce7e038d1afce0faddf7494ed9f87d5c","observation_id":"005d8d09-85e5-44bc-8ce8-7c34bfeec466","resolution":{"observed_at":"2026-08-10T23:24:58.753151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.731197Z","title":"Explicit two-deletion codes with redundancy matching the existential bound","venue":null,"work_id":"b82975d1-09fc-4ce0-b78e-e5982264a977","year":2021},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.659064Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:6ded5f97be444373d738594e4d00b210a947710a1b10ce50087f9ab1536f8efb","observation_id":"f445b066-2999-4a0a-84c5-1a70294c8971","resolution":{"observed_at":"2026-08-10T23:24:58.736534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.714460Z","title":"Synchronization strings and codes for insertions and deletions—a survey","venue":null,"work_id":"4dd148aa-d461-4614-8e62-2f6451e333f9","year":2021},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.663664Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:ad1449f3793272b88c382a1d80f75175b05a64d2af7b24dc95c237ef3d19d8d2","observation_id":"95e4cf44-6370-4790-9a40-37d388a383fa","resolution":{"observed_at":"2026-08-10T23:24:58.719990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.698065Z","title":"List decoding of deletions using guess & check codes","venue":null,"work_id":"8dd3b616-ecad-48ce-8cf1-a3e4e3ae9b36","year":2019},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.668246Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:558ffb18e070a5496a423ee84c69a3bd7bac69bdb72e635d14f6831e4f9e1db8","observation_id":"ff23fea6-0418-4a2a-ac80-3d2a19cb4a3b","resolution":{"observed_at":"2026-08-10T23:24:58.703308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.680614Z","title":"On the list decodability of insertions and deletions","venue":null,"work_id":"6f7c4474-1a8a-49de-b389-8e7b9d046f4a","year":2020},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.672926Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:c0e90622c6cb93449e7037a281234c527e55b6eca0355a61af9c63b62a5a69b1","observation_id":"9d525fe6-e638-4c4a-8412-c999f3bbc641","resolution":{"observed_at":"2026-08-10T23:24:58.686140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.663417Z","title":"The size of levenshtein ball with radius 2: Expectation and concentration bound","venue":null,"work_id":"995a65b9-1ac4-4017-971e-21c5ee4cd8ea","year":2023},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.677546Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:f9c05c4334dce5974e3c89c2a526c0248a5d5220371676b970dd3282efa166fa","observation_id":"b4478fe2-9ed3-41aa-8512-effb33cbbfe8","resolution":{"observed_at":"2026-08-10T23:24:58.668742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.647565Z","title":"A characterization of the dna data storage channel","venue":null,"work_id":"2d14dcc9-df53-4127-b3e2-5a57c252b90d","year":2019},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.682398Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:c73316c6344d776bf86bf77e73c832fd4dd7173f031276998e6e4caa0f68745d","observation_id":"7a2bcb33-9af6-45cb-862b-db87ed6e81cc","resolution":{"observed_at":"2026-08-10T23:24:58.652612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.632868Z","title":"Strict half-singleton bound, strict direct upper bound for linear insertion-deletion codes and optimal codes","venue":null,"work_id":"a35476a9-22d5-4ad7-859e-3c4b3552bfa1","year":2023},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.687174Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:fd6e3e25535d670a50058123c0cbe3785a1806f042bee7eaef74ff3ce73f827f","observation_id":"cb5fad4b-f306-4253-8f1e-bd02162202cc","resolution":{"observed_at":"2026-08-10T23:24:58.637621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.617028Z","title":"A new upper bound for error-correcting codes","venue":null,"work_id":"1067111b-095a-451c-bcd9-c7315687ec30","year":1962},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.692368Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:1d5d368a08e3000d97865e9e9a5bd4b50fbe13eb9560bb85c104ee397b9534c9","observation_id":"64af3884-eb3c-45ba-97be-05bce613b866","resolution":{"observed_at":"2026-08-10T23:24:58.621902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.601019Z","title":"On the complexity of decoding reed-solomon codes (corresp.)","venue":null,"work_id":"465aa9db-774d-4c6b-8466-c7c7ad97f25b","year":2006},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.697514Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:2e1e1664c02eb0ff979d1e49df3384636d8822340ec36779020e3538ea7031e2","observation_id":"78f6c3c5-076d-4a2d-bf39-0baf4a4b38a8","resolution":{"observed_at":"2026-08-10T23:24:58.606575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.584627Z","title":"Algebraic soft-decision decoding of reed-solomon codes","venue":null,"work_id":"9ff0bb38-f0f1-411e-bc67-ff11689ea636","year":2003},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.702321Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:6172570f4564b35d212d7091ff316ad1cf2135bf8a402eb0a17ab3cf98f343cd","observation_id":"c71fc76c-4f45-46b6-a730-a625681273e3","resolution":{"observed_at":"2026-08-10T23:24:58.590269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.566876Z","title":null,"venue":null,"work_id":"fda7a229-fc84-4930-8792-dab48a587136","year":1966},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.707309Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:630e5a66d2e4f3087bcd9b6178e4412dd939d308b744e0f5e675fd150e306827","observation_id":"ee3fdb7d-4aeb-4dff-9b68-571b2ea15df2","resolution":{"observed_at":"2026-08-10T23:24:58.571803Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.549998Z","title":"Efficient reconstruction of sequences","venue":null,"work_id":"f05f523f-8243-4998-848e-0090a5eaccb6","year":2001},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.711995Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:6d030434fbfd71066d5e0096c786d509962d52d8042f257a562c17f9fd5da71f","observation_id":"708fd2ec-c6fb-4c24-a207-06285e1bd90f","resolution":{"observed_at":"2026-08-10T23:24:58.555040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.532081Z","title":"Efficient reconstruction of sequences from their subsequences or supersequences","venue":null,"work_id":"ee13038f-6020-418d-bf33-5b17f13bc9a5","year":2001},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.716749Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:0b4882db729f0c15a8eac35e2ae52ea07bac29a0b640a859bda5ca22608681cf","observation_id":"c7e9c204-d7f2-4a65-a75f-c456f8d0c1c1","resolution":{"observed_at":"2026-08-10T23:24:58.538101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.514827Z","title":"Fft algorithm for binary extension finite fields and its application to reed–solomon codes","venue":null,"work_id":"4420d9a8-e065-481c-aea4-d0c9847af8a0","year":2016},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.721349Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:9eae9f713718bb41cc6ed7fcb2ec84454470a8b3ff21bf850fcc399be8539d85","observation_id":"5a853816-8904-4bb6-a28c-7382b88c80e7","resolution":{"observed_at":"2026-08-10T23:24:58.520108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.498105Z","title":"A fast algorithm for the syndrome calculation in algebraic decoding of reed– solomon codes","venue":null,"work_id":"18ecf0fc-25f4-426a-bee4-81dba5e7cf27","year":2007},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.725746Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:7048df0f9e84775bda59dc621ea4fd17755723f700283532299aca6857dd3ad4","observation_id":"141be5bb-9b39-463f-b66f-c19eb9299afc","resolution":{"observed_at":"2026-08-10T23:24:58.503554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.480682Z","title":"Optimal rs codes and grs codes against adversarial insertions and deletions and optimal constructions","venue":null,"work_id":"bbdabbad-d8e9-492c-ad90-d9f7a7995d4c","year":2024},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.730239Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:f5ecf81eaeedecfc3b900ff21a2032152dd4320b51deaf4f2a92ac3b7f97716d","observation_id":"597310ac-0cf0-4841-976e-394899a9c6e1","resolution":{"observed_at":"2026-08-10T23:24:58.486114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.463603Z","title":"On 2-dimensional insertion-deletion reed-solomon codes with optimal asymptotic error-correcting capability","venue":null,"work_id":"8d96cfb0-a4ee-40a8-b643-2d195c65c4fb","year":2021},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.734523Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:400ea635fc95dc47dbe18cd8d848b1bdf65713c835825cf33d69d85549b8beaf","observation_id":"9bd9bc0d-e249-4376-b66c-33e4b888a440","resolution":{"observed_at":"2026-08-10T23:24:58.469375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.09705","last_updated":"2020-09-29T14:09:26Z","snapshot_observed_at":"2026-08-14T16:12:12.294766Z","submitted_at":"2019-06-24T03:26:22Z","title":"On List Decoding of Insertion and Deletion Errors","version":6},"cited_work":{"arxiv_id":"1906.09705","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.09705","snapshot_observed_at":"2026-08-10T23:24:57.922249Z","title":"On List Decoding of Insertion and Deletion Errors","venue":"cs.IT","work_id":"621e3afb-8671-45cc-a124-01a7bf0ca538","year":2019},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.738949Z"},"links":{"cited_paper":"/paper/1906.09705","citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:17d88935b2f58b339b0ffdb812323b40a967e54654ba600248b62316d47bc632","observation_id":"174931a7-2048-45fc-afc0-2cb75210113b","resolution":{"observed_at":"2026-08-10T23:24:57.929572Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.447379Z","title":null,"venue":null,"work_id":"c695dc4b-8e02-4080-98f3-17eeb7d31e1e","year":1969},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.743423Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:59243831ff0c8e4367e690e0537aeaed4e9910db91b775398a93f56ad3e6fba8","observation_id":"1ff2f693-e070-47fb-a95f-d80a8c6b8c63","resolution":{"observed_at":"2026-08-10T23:24:58.452630Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.429792Z","title":"A survey of error-correcting codes for channels with symbol synchronization errors","venue":null,"work_id":"f5703ade-fc97-4ddc-8660-7a29ef99a457","year":2010},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.747607Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:a5e5dfb45477d89ab94c5dea81aee87d165173b888b19911ed90ad22b73aa0a8","observation_id":"30b9316e-9cad-45e9-a020-fe3e2b11a5b2","resolution":{"observed_at":"2026-08-10T23:24:58.436153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.413218Z","title":"A survey of results for deletion channels and related synchronization channels","venue":null,"work_id":"48a8ce8b-7488-494d-b00b-f7a724a0d71b","year":2009},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.751707Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:a01d289d1d132180d109820618a5fc573006b91f56fa03f8aa1b16acaa6dfd75","observation_id":"29703930-7a71-4bc2-a6f3-b9962f769f4e","resolution":{"observed_at":"2026-08-10T23:24:58.418881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.397268Z","title":"Random access in large-scale dna data storage","venue":null,"work_id":"982879a8-fd87-4681-a70c-59887552341c","year":2018},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.755782Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:33d5cfd45586d9754afa0ed157c8f4e78b7f6ebc9bf83d66a48fb03a952f1b0a","observation_id":"0640a9e7-2cbb-4006-8d14-f4ecf0367015","resolution":{"observed_at":"2026-08-10T23:24:58.401936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.382193Z","title":"Rewritable two-dimensional dna-based data storage with machine learning reconstruction","venue":null,"work_id":"34da1c36-25cc-4bb4-a09b-cb0942fe852f","year":2022},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.760574Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:851fb8c8e28796e0ba13e32f5e6e7674e5c30d20e1212b976ca65b8000c26992","observation_id":"e8e1d375-09c6-4310-a062-03072ae0b270","resolution":{"observed_at":"2026-08-10T23:24:58.387022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.367409Z","title":"Peterson","venue":null,"work_id":"fed55780-cbbc-4b50-a4fd-6fae8918f5f5","year":1960},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.765707Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:f7aa64f2676cc1599f91e3e30af72cc7dd39fad7cecec1a3e5b878d88ab476e0","observation_id":"a66978d7-dba5-42b2-a2a3-e7815069ddf0","resolution":{"observed_at":"2026-08-10T23:24:58.371983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.351155Z","title":"Polynomial codes over certain finite fields","venue":null,"work_id":"b0f4f55a-3153-45cc-a5c9-b8c100686221","year":1960},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.770693Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:79aa2b6f01a4581faf323b8b4c354e265ee3180eb0b8271cc365ef377e168d81","observation_id":"cb72d79f-d698-4794-895b-b53957f04386","resolution":{"observed_at":"2026-08-10T23:24:58.356068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.335222Z","title":"Solqc: Synthetic oligo library quality control tool","venue":null,"work_id":"25629ca1-a6d5-4473-80fd-d2b1d1be85d5","year":2021},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.775481Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:113aa973bd956344aa1dd2b0269d8d86cfa063181d2a9cbdc0de4b8b9fdfbfb0","observation_id":"7b68f4e3-aeb3-4ebe-9674-63f894795784","resolution":{"observed_at":"2026-08-10T23:24:58.340342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.319210Z","title":"Traitor tracing for shortened and corrupted fingerprints","venue":null,"work_id":"102cccf9-337c-495a-9a1a-838c0bd1a22a","year":2002},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.780054Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:d12e7fb022b5409ff59d1cb68f7149c47cb8960b7717c40a5e1fdbc342c3bf0a","observation_id":"aeb103dd-f0fe-4bb2-8045-b673798e8a25","resolution":{"observed_at":"2026-08-10T23:24:58.324552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.301550Z","title":"Counting sequences obtained from the synchronization channel","venue":null,"work_id":"93f66931-445c-4b85-8506-04d5c2059ff5","year":2013},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.784909Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:adbbe3601d4c2f95ce27a816b0769a85e193dab11d5a9f536bc84beeb6fa2538","observation_id":"10b3bba1-7110-489e-8530-f539e15f3b58","resolution":{"observed_at":"2026-08-10T23:24:58.307174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.285942Z","title":"Synchronizing files from a large number of insertions and deletions","venue":null,"work_id":"d6e50d8a-b345-42bb-9983-59c060565b1c","year":2016},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.789573Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:59a0ec4c9db19ab24373106014bc2bf2f0c36c334a1cf9871de68d3abf82d620","observation_id":"eebf0c50-3228-4401-af6c-32bae4280d9c","resolution":{"observed_at":"2026-08-10T23:24:58.290968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.270471Z","title":"Codes correcting a burst of deletions or insertions","venue":null,"work_id":"379f06e8-1fc8-4dfe-9473-de7fd3089f09","year":1971},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.794397Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:233514c2619d3af04a43631a4d0ae76e027c27e4120251ca8186a97fd43bd2e4","observation_id":"baaa3937-1cac-4c3a-98bb-4a0c97a18d11","resolution":{"observed_at":"2026-08-10T23:24:58.275402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.255299Z","title":"On optimal k-deletion correcting codes","venue":null,"work_id":"dabc217c-cebb-4e34-a18c-fef6a9931b5e","year":2020},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.799126Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:96a874430f6cf574a1ed1b54fd2c2b4c78dd3cdf487d82a61479d2df3f0b34c2","observation_id":"c89a2dd6-b87e-401e-b1d5-27e2c0e8a87d","resolution":{"observed_at":"2026-08-10T23:24:58.260193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.238766Z","title":"On coding over sliced information","venue":null,"work_id":"f14abf1e-e8e1-4465-85dd-d05f1e00e9df","year":2021},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.804324Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:47885dd8024a0b82a3613e46062e55417404d84e6b9f031569b45ef5cbdeb37b","observation_id":"75362218-1eba-4ff3-b42b-36812ab1f9ea","resolution":{"observed_at":"2026-08-10T23:24:58.244126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.218902Z","title":"An optimal sequence reconstruction algorithm for reed-solomon codes","venue":null,"work_id":"3f810c14-2b25-4020-a5b6-43da1a00ac5f","year":2024},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.809065Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:5081942e2f8762421a440143c8fa79e3c570641673b24340ea6830ad7c4456f3","observation_id":"cc218a51-d1d0-414e-95bc-9534474accea","resolution":{"observed_at":"2026-08-10T23:24:58.224378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.201413Z","title":"Singleton","venue":null,"work_id":"d1b0cd25-e4a9-4784-8b59-1585cdb32daa","year":1964},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.813750Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:ede20d1318f0e2e7c59ba7cdaa230028df8cdd77b1ba549bcc64637010e53251","observation_id":"5315bd29-0ae3-43ca-9f88-89303182b6f1","resolution":{"observed_at":"2026-08-10T23:24:58.206693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.185201Z","title":"Single-deletion single-substitution correcting codes","venue":null,"work_id":"64edd875-d8a4-4571-b013-d0d64df33bb0","year":2020},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.818801Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:42cdb8c23673e0bbc9ef5a2cba7b69494a00a52dd604f9edd14a0929bb48966e","observation_id":"a4a7e6bf-288e-4f98-a78a-2ec8386906fc","resolution":{"observed_at":"2026-08-10T23:24:58.190042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.171013Z","title":"Decoding of reed solomon codes beyond the error-correction bound","venue":null,"work_id":"f9a8d900-49ec-4e7a-850d-cbc3c52548d4","year":1997},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.823554Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:acada237dd04448efd2dfc0be023370d001e655f833d4202aaa7e5f8aa25c399","observation_id":"9564a54b-e7cc-443f-9e01-f39da8dccd99","resolution":{"observed_at":"2026-08-10T23:24:58.175548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.156383Z","title":"Sugiyama, M","venue":null,"work_id":"c3e04cb9-57fb-4957-9bcc-58d085426a01","year":1975},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.828140Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:9194b61236a1f7bb1723320b0ad6006b4920a0774178ece0a1c287200ff338da","observation_id":"7c6289ee-3fc4-4581-bed5-3cd20cfca0d2","resolution":{"observed_at":"2026-08-10T23:24:58.161261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.140772Z","title":"Sequence reconstruction under single-burst-insertion/deletion/edit channel","venue":null,"work_id":"87558c28-6d76-4c2c-87c0-f05d3cf825ec","year":2023},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.832673Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:9319260e5f0e287e287fa62d1beaab431b3a5c6b448cc1d977e9d72ba4b94b68","observation_id":"1e84180d-9a93-4a63-a72b-df4ea0317166","resolution":{"observed_at":"2026-08-10T23:24:58.145823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.124864Z","title":"Dna punch cards for storing data on native dna sequences via enzymatic nicking","venue":null,"work_id":"e7f68005-2d2e-44a5-ba2c-b1f67191e7bf","year":2020},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.837308Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:1c88e8f6adf235b6f2a14c7f659020da21037454a19bd96f06c62b7e62519726","observation_id":"993d3696-5133-4a5a-969c-8bbaf7da3f0b","resolution":{"observed_at":"2026-08-10T23:24:58.129904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.109078Z","title":"A new decoding method for reed–solomon codes based on fft and modular approach","venue":null,"work_id":"3c62e437-4e09-4481-829a-1199e40adc1f","year":2022},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.842278Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:6dd7b0bcf3d1721949308e45cd1c6e590d19092b6d2c0e357e14866901c19267","observation_id":"d78e84c9-adea-4cd4-9890-d8c70c22b4bd","resolution":{"observed_at":"2026-08-10T23:24:58.114334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.092108Z","title":"Construction of deletion correcting codes using generalized reed–solomon codes and their subcodes","venue":null,"work_id":"da4e4fc8-dbce-4246-91a1-56c427a277d0","year":2007},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.847078Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:f0fe7529075e79761398e8be05a13159b57b5cdf126c927b98557d7d53539c69","observation_id":"c56b758b-636a-4ab0-b0a5-266e30912b0f","resolution":{"observed_at":"2026-08-10T23:24:58.097546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.076502Z","title":"A code for correcting a single asymmetric error","venue":null,"work_id":"7f9e8177-650f-4284-9f1e-f233c04c1666","year":1965},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.851881Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:ada9f13a462da7d881c7b0314b79847209970970db0c29e10a6a5a471d0256b5","observation_id":"d809413f-440b-477b-8aa2-27ad71b40521","resolution":{"observed_at":"2026-08-10T23:24:58.081611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.058469Z","title":"List decoding of insertions and deletions","venue":null,"work_id":"2b6e9411-588f-420d-bb01-93d88c607381","year":2017},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.856490Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:f208c8cb62fcc4e4fab12585384debde9acad1979640bb30495f74523b07a439","observation_id":"ed50b9d6-755e-4579-b0c7-6a7fa19c5b78","resolution":{"observed_at":"2026-08-10T23:24:58.064789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.039524Z","title":"On the size distribution of the fixed-length levenshtein balls with radius one","venue":null,"work_id":"41a5249b-add7-4305-8aab-2551cb1e310d","year":2024},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.861149Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:e8e7af23cea0cac4753ec8efd0919c66b1e973c49a571b6013c5a134724a89a2","observation_id":"b12a6af8-d933-4ae8-8959-3fdd2d4570e6","resolution":{"observed_at":"2026-08-10T23:24:58.045187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.022118Z","title":"Deletion correcting using generalized reed-solomon codes","venue":null,"work_id":"d7ecce89-c424-46b2-b1da-7d33498b7511","year":2004},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.866265Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:8d70627a8030d8db201f3d801c0685a23bb96132b7a7848aefd951c502edc017","observation_id":"52356c02-89e4-4dbe-bb1a-44acac6c0f06","resolution":{"observed_at":"2026-08-10T23:24:58.027221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:58.006215Z","title":"Welch and E","venue":null,"work_id":"b2914790-76fa-4c21-8b92-72812a9548a4","year":1983},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.870874Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:2c17030affbbc19838116af604a69c9c9cf4472c6473a7283bd705c26af853e7","observation_id":"2288d079-814d-4ce5-a5c8-a50799aeb92a","resolution":{"observed_at":"2026-08-10T23:24:58.011163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:57.989859Z","title":"Reduced-complexity decoders of long reed-solomon codes based on composite cyclotomic fourier transforms","venue":null,"work_id":"210da3ad-55f9-46d6-82f3-040b5963f42f","year":2012},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.875612Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:08565902d077c264fc9038d2bd35d3d31c786eadaa0639139d6e1f10a48a8593","observation_id":"3dd05885-5f26-4d64-84b7-e755e3b71bab","resolution":{"observed_at":"2026-08-10T23:24:57.994970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:24:57.974514Z","title":"Portable and error-free dna-based data storage","venue":null,"work_id":"5c4cf6c7-2773-4a17-a3d7-3b68cc19bbd6","year":2017},"citing_paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-10T23:24:57.881252Z"},"links":{"citing_paper":"/paper/2412.20771"},"observation_digest":"sha256:a0565a217fe599217c8fa4406ecbc1d7cebf3f46638c9102647c20cdbdc345d2","observation_id":"cb360133-44d5-4d7c-bd75-3fd0dee10364","resolution":{"observed_at":"2026-08-10T23:24:57.979423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.20771","last_updated":"2025-06-30T18:52:40Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-19T16:43:39.422169Z","submitted_at":"2024-12-30T07:42:24Z","title":"Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors"},"reference_resolution":{"displayed":77,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":71},"total_outbound_references":77},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 77 of 77 outbound references and 1 inbound Pith citation observation for arXiv:2412.20771."}