{"as_of":"2026-08-19T21:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a9a63aa011258ee6d238328c3149aba36dfa66082962339f593ae11f60d271e1","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T18:34:59.238552Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T01:07:26.157684Z","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-07T01:27:05.657574Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.11371","snapshot_observed_at":"2026-08-16T01:07:26.157684Z","title":"Beelen, R","venue":null,"work_id":null,"year":2025},"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":50,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.157684Z"},"links":{"cited_paper":"/paper/2501.11371","citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:46b5817d68a50f08d734b830178ae1949692781be2aa5b6e0fcb476ad038cd8c","observation_id":"9056219b-adfb-4b14-918f-096a0f381ea2","resolution":{"observed_at":"2026-08-16T01:07:26.157684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"cited_work":{"arxiv_id":"2501.11371","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.11371","snapshot_observed_at":"2026-08-07T01:27:05.657574Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","venue":"cs.IT","work_id":"7e1a87b4-9172-4fcc-8669-939075cc7c89","year":2025},"citing_paper":{"arxiv_id":"2506.12193","last_updated":"2025-07-18T10:53:57Z","snapshot_observed_at":"2026-08-07T00:53:57.591115Z","submitted_at":"2025-06-13T19:42:38Z","title":"Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T01:27:05.606371Z"},"links":{"cited_paper":"/paper/2501.11371","citing_paper":"/paper/2506.12193"},"observation_digest":"sha256:db4cf936532f87dc7f50e2f16687692e5a832c6a8ab67b27e614968c915ccda7","observation_id":"52ac86c1-fac4-406a-83f2-06f411fd027b","resolution":{"observed_at":"2026-08-07T01:27:05.664943Z","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/2501.11371/citation-record","integrity":"/paper/2501.11371/integrity","json":"/paper/2501.11371/citation-record.json","paper":"/paper/2501.11371"},"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-10T18:34:59.745379Z","title":"Reed Solomon codes against adversarial insertions and deletions,","venue":null,"work_id":"af39307e-b700-4637-a332-1df3dda9c304","year":2023},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.131548Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:b9674c613c9a70ce1feae000504899f5bd85072cf83e5d55b2d5e83865cce3a4","observation_id":"8a0c770f-ffef-49f8-8835-0422ae502058","resolution":{"observed_at":"2026-08-10T18:34:59.749109Z","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-10T18:34:59.735844Z","title":"An overview of capacity results for synchronization channels,","venue":null,"work_id":"9d9da83b-e710-4377-a53f-2865cf031588","year":2020},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.136148Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:124d71b292f34133542a50e69e86d9e501ba48c37ab731efef092df3cc39f223","observation_id":"46665fb4-601c-4ecf-a493-cda2bd82252e","resolution":{"observed_at":"2026-08-10T18:34:59.739281Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:34:59.139862Z","title":"Synchronization strings and codes for insertions and deletions - A survey,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.139862Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:411d7f7b3c4ba562e52cd91f161e2322f0622209dd8a0db52edd594ad3d4419c","observation_id":"c8c97c83-e49b-4e1f-b64b-f431b811551b","resolution":{"observed_at":"2026-08-10T18:34:59.139862Z","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-10T18:34:59.725711Z","title":"Traitor tracing for shortened and corrupted fingerprints,","venue":null,"work_id":"2acc7382-b659-4cb4-b276-9651a73ba683","year":2002},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.143246Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:f4c74cffba56fa3c4f109a3a4ccb5c6384c22e98fef4e844acc5b8b5461e1e3b","observation_id":"cdfc0a85-0420-414d-8acd-997c43f32837","resolution":{"observed_at":"2026-08-10T18:34:59.729374Z","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-10T18:34:59.715038Z","title":"Deletion correcting using generalized Reed-Solomon codes,","venue":null,"work_id":"cf745b49-47fb-494a-99e8-a8ca3f68577e","year":2004},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.146647Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:c11f6ae3098662f3ccbe53d15802e0f928d03b7585b8e6ac48c22644eb221ba9","observation_id":"e9d62c0e-348f-4399-8b19-7165414b1ecd","resolution":{"observed_at":"2026-08-10T18:34:59.719561Z","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-10T18:34:59.704927Z","title":"Construction of deletion correcting codes using generalized Reed– Solomon codes and their subcodes,","venue":null,"work_id":"93e0eed2-2f86-4bd1-bbc6-f4b031ff32c8","year":2007},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.150136Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:da7318ba1cec03d041c3c9430c3116ef410c9afce18b5e336a9256795034c93d","observation_id":"d8552733-4138-4fd6-a4d3-339f65aaa237","resolution":{"observed_at":"2026-08-10T18:34:59.708557Z","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-10T18:34:59.694435Z","title":"Explicit constructions of two-dimensional Reed-Solomon codes in high insertion and deletion noise regime,","venue":null,"work_id":"1615b122-ff80-4bcd-9357-3d41b492dad1","year":2021},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.153634Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:1c64cb999847a963fda2d66174c4fd5354cff64dc8e6dc5112316d00df376d1a","observation_id":"965c8f01-9948-4202-b362-5a1c901a1baa","resolution":{"observed_at":"2026-08-10T18:34:59.698288Z","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-10T18:34:59.683541Z","title":"On 2-dimensional insertion-deletion Reed-Solomon codes with optimal as- ymptotic error-correcting capability,","venue":null,"work_id":"e4178953-87da-401f-b84d-f61388ce6d4b","year":2021},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.156843Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:9d7391b2d8320950bc38ac90d1e241cf43085a3e42eb201903ed27f4d20117d1","observation_id":"3b65b8a0-5390-48e7-af51-1aacf46612b3","resolution":{"observed_at":"2026-08-10T18:34:59.687453Z","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-10T18:34:59.674697Z","title":"Optimal two-dimensional Reed–Solomon codes correcting insertions and deletions,","venue":null,"work_id":"d2467a8e-56a9-4fec-83c8-648f8c51c22f","year":2024},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.159738Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:81cbfde75f7cc58a2a2d0e0a49775a1617d86beec2d19c318dc6021ae39ec312","observation_id":"caec6bc6-0836-4644-991c-c48b8bc32428","resolution":{"observed_at":"2026-08-10T18:34:59.677809Z","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-10T18:34:59.665324Z","title":"Optimal RS codes and GRS codes against adversarial insertions and deletions and optimal constructions,","venue":null,"work_id":"3e9b42a6-dc8b-40c1-a1f1-8dd612d0dd9f","year":2024},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.162726Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:7f3659a8529eb2692f3c7cca093f1933c2ad9df7aa35959d0867bbdf4fada424","observation_id":"88dc4e3a-4fc1-4d79-8c79-889f9bc8dfcf","resolution":{"observed_at":"2026-08-10T18:34:59.668718Z","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-10T18:34:59.165724Z","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":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.165724Z"},"links":{"cited_paper":"/paper/2407.07299","citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:ca093bacf3e5dcbaa7ee6673e8056da44c3eb1c256102c3fb527ba0471719dd0","observation_id":"a4eea1d2-2560-4fe7-8d60-57a0b411a1a8","resolution":{"observed_at":"2026-08-10T18:34:59.165724Z","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-10T18:34:59.655236Z","title":"Binary codes capable of correcting deletions, insertions, and reversals,","venue":null,"work_id":"b2cb9038-38f8-413b-9de7-57ae9969b43b","year":1966},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.169367Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:2d5b39d5522d452b9ffb790793da047eebaeb03485b93d6780ec165edc315645","observation_id":"9e2b9f79-dffb-460a-bdc0-3b63202394a8","resolution":{"observed_at":"2026-08-10T18:34:59.658801Z","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-10T18:34:59.646090Z","title":"Codes which correct single asymmetric errors (in Russian),","venue":null,"work_id":"54804c34-4d3e-47a4-9d4f-29200cb211c3","year":1965},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.173040Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:ee10a62847d9c23db9c37222965c7d97a6ae93e89693bb0e3e3ddbfd169c0ab6","observation_id":"6304ad05-962f-42c5-8c2c-9164e7a5dfc7","resolution":{"observed_at":"2026-08-10T18:34:59.649318Z","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-10T18:34:59.635780Z","title":"Codes correcting two deletions,","venue":null,"work_id":"8cb870c9-e8fb-4a12-b9a2-efd9bdc479ec","year":2018},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.176445Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:f260176582e4e75583e01e8e20b7195592cedfc4d03e6665b15c8e3c0d05ad7b","observation_id":"da018c8c-ad2e-4bb3-b486-be2897fb481f","resolution":{"observed_at":"2026-08-10T18:34:59.639517Z","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-10T18:34:59.625946Z","title":"Two deletion correcting codes from indicator vectors,","venue":null,"work_id":"95d0a99d-512b-408b-baca-4310abea1eb8","year":2019},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.179709Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:c22d48ab224d9bfbf137117e62c02575fb1c102fe9f6a327134e773ac63eeeb2","observation_id":"b125192f-8305-4bb5-8d8e-dd6c540b8405","resolution":{"observed_at":"2026-08-10T18:34:59.629457Z","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-10T18:34:59.615848Z","title":"Efficient low-redundancy codes for correcting multiple deletions,","venue":null,"work_id":"ae1461a5-ac28-4547-87cf-afd1b536a9f5","year":2017},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.183687Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:8338c24165a240786d82bbd2ada2df9e578e298c1783886ec2b81ed6e0a770b4","observation_id":"01ee28c7-62c8-4ea5-9f9b-c15dd704ae1f","resolution":{"observed_at":"2026-08-10T18:34:59.619409Z","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-10T18:34:59.605390Z","title":"On optimal k-deletion correcting codes,","venue":null,"work_id":"d925ec04-1d20-4c96-8b41-dada56d17fb8","year":2020},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.187167Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:a206c333c7e94f1849770a42cad61e16015deeed29da3c89059ef7f7f01752c5","observation_id":"012cb742-34c2-4a81-aca6-0cfb5355cdc1","resolution":{"observed_at":"2026-08-10T18:34:59.609224Z","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-10T18:34:59.595024Z","title":"Optimal codes for the q-ary deletion channel,","venue":null,"work_id":"f40016c7-5fce-4193-8def-bd3edbef0dfb","year":2020},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.190591Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:6e3dba8fdd682bd96fc2b70c24965631ba369dfce99f26cba0a4fa581e55e996","observation_id":"7e02a927-6a31-446a-b05e-f9e8d55cc847","resolution":{"observed_at":"2026-08-10T18:34:59.598713Z","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-10T18:34:59.585176Z","title":"Explicit two-deletion codes with redundancy matching the existential bound,","venue":null,"work_id":"d2a2fa7b-2057-4f7c-82c0-1621265f589a","year":2021},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.193947Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:9bfe3cff95e6d0fa55f0d98a751c44f861ea5d791997f6e611ca38400f255894","observation_id":"b60ac8ea-9bf6-40ef-94b0-3c513fb20726","resolution":{"observed_at":"2026-08-10T18:34:59.588427Z","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-10T18:34:59.575686Z","title":"Explicit construction of q-ary 2-deletion correcting codes with low redundancy,","venue":null,"work_id":"134aceef-7184-4db4-9f0d-3c0a7fa45e20","year":2024},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.197293Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:c882770232fe9ab118b938f4059aadbcd99742669d2708f4db0fa62ebc8f0ff2","observation_id":"cd533aca-b3dc-4be5-aa45-235c123f0066","resolution":{"observed_at":"2026-08-10T18:34:59.579039Z","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-10T18:34:59.566592Z","title":"Synchronization strings: Codes for insertions and deletions approaching the Singleton bound,","venue":null,"work_id":"dfbefcf3-3002-4fdc-a0d7-96314a25b219","year":2021},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.200634Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:b6e2fd747fe2640474ae84d046e86f7326c6ef9ba43e29ffc9c0a92bc3b18b5a","observation_id":"346afaaa-737c-4576-8866-0611b51e4356","resolution":{"observed_at":"2026-08-10T18:34:59.569700Z","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-10T18:34:59.556326Z","title":"Improved bounds for codes correcting insertions and deletions,","venue":null,"work_id":"af9e9bb7-fade-4aa8-ad39-823d243fad2e","year":2024},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.204147Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:8be61c5015bbfdb162a6422852633ad12616d4edf8083ecc932647a2bb506934","observation_id":"f4f53c00-e026-4b02-902f-920409ce2ac3","resolution":{"observed_at":"2026-08-10T18:34:59.560069Z","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-10T18:34:59.546453Z","title":"Bounds for deletion/insertion correcting codes,","venue":null,"work_id":"8353a09d-7c82-4283-9d1f-6e8c52876409","year":2002},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.207702Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:5ee1ddbfd5860adf5f8ab4fcfaafc737d8a00bbc6ffba59146691aff9f55a17b","observation_id":"474ed037-d251-4014-b052-336c028c0907","resolution":{"observed_at":"2026-08-10T18:34:59.550016Z","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-10T18:34:59.534703Z","title":"On linear and cyclic codes for correcting deletions,","venue":null,"work_id":"756aeab6-0743-4c66-a66e-4be381562b79","year":2007},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.211131Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:4c2fdc275758f2e2b71a2b8ca97dbcea21abc140d829a8c556c8dd6d22bcf90b","observation_id":"2baddba0-c0a8-45e4-971b-8edc4761d449","resolution":{"observed_at":"2026-08-10T18:34:59.538520Z","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-10T18:34:59.511776Z","title":"Coordinate-ordering-free upper bounds for linear insertion-deletion codes,","venue":null,"work_id":"a706a072-5d4a-4413-8c9d-3c9a39c43b8b","year":2022},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.217496Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:2bf8ab4ff3dd0de374b00b60b015d8e5ff239a1380bd60c2d32cc4cd746a4005","observation_id":"f2195f6d-a14e-41dd-b425-f445ab69bf19","resolution":{"observed_at":"2026-08-10T18:34:59.515889Z","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-10T18:34:59.500043Z","title":"Strict half-singleton bound, strict direct upper bound for linear insertion-deletion codes and optimal codes,","venue":null,"work_id":"88a9e0d0-c112-4e81-a48b-b3148319ea85","year":2023},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.220526Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:135dc89728ff8008c464617834649939c0ce6dd18acea0800fc38f2986692acc","observation_id":"f603db86-3418-4df5-b947-953aa0c84dd1","resolution":{"observed_at":"2026-08-10T18:34:59.503888Z","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-10T18:34:59.490272Z","title":"New dimension-independent upper bounds on linear insdel codes,","venue":null,"work_id":"2fe25c82-6e78-4be5-ab41-4faff4da8c16","year":2024},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.223796Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:b728fba9de8db63ff58219aa3f8dec5c42c173009da6c1e9ebd8a17d6f67e4cf","observation_id":"5baf6df2-bf79-46e7-8fca-b1fc0568ea9f","resolution":{"observed_at":"2026-08-10T18:34:59.493480Z","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-10T18:34:59.523404Z","title":"Efficient linear and affine codes for correcting insertions/deletions,","venue":null,"work_id":"ba1a65e1-d57f-43dc-8d73-53c88bf7b28d","year":2023},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.226787Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:0ef9d8a856c9c68935e3477d936a44b37b399097224f9e36c2484146d91d79e0","observation_id":"5f7c6fb7-c466-4e7f-9986-0cb0ed693768","resolution":{"observed_at":"2026-08-10T18:34:59.527584Z","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-10T18:34:59.480538Z","title":"Bounds and constructions for insertion and deletion codes,","venue":null,"work_id":"29f757ab-8e6c-43a3-9ec0-f2bff1419aed","year":2023},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.229819Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:a8ac3363158953f859be86f27029b3bcaa6fb5e34b3e8c1e04772b51e0567790","observation_id":"b9e29637-2948-4413-ba6f-fff2896da1c5","resolution":{"observed_at":"2026-08-10T18:34:59.483751Z","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-10T18:34:59.470077Z","title":"Mitzenmacher and E","venue":null,"work_id":"d66dc87e-7ac2-40f4-9eb4-f5b6bdbb77d6","year":2005},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.232672Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:0cf432b6d826c62cd99a568b790f74043962d860969e3a49e3cc8c297bc3ad2c","observation_id":"5cfbd49c-46f2-43d5-8470-b27a601f9480","resolution":{"observed_at":"2026-08-10T18:34:59.473497Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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-10T18:34:59.457326Z","title":"Probabilistic algorithms for sparse polynomials,","venue":null,"work_id":"0188031b-09ff-41f8-a2ac-a3a1db899077","year":1979},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.235716Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:2cfc335703d7197a5089b898a349be4c93622014f7d58a40d238909dc059cb55","observation_id":"73eb4300-15b4-4a96-aa9d-136e643bc29e","resolution":{"observed_at":"2026-08-10T18:34:59.462787Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:34:59.238552Z","title":"Fast probabilistic algorithms for verification of polynomial identities,","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T18:34:59.238552Z"},"links":{"citing_paper":"/paper/2501.11371"},"observation_digest":"sha256:3d551b93ac8c8713d10bb25d8e0c42a8c759106955d2192e6998dfcd391d3449","observation_id":"b1597ab0-11d2-4018-a792-1e55d5871709","resolution":{"observed_at":"2026-08-10T18:34:59.238552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.11371","last_updated":"2025-09-08T07:47:51Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-19T17:36:56.268583Z","submitted_at":"2025-01-20T10:02:22Z","title":"Reed-Solomon Codes Against Insertions and Deletions: Full-Length and Rate-$1/2$ Codes"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":28},"total_outbound_references":32},"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 32 of 32 outbound references and 2 inbound Pith citation observations for arXiv:2501.11371."}