{"as_of":"2026-08-19T17:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c7c7174f1e6b52d20d9b722be344e2e7fc000093e8f96f0838f875b012bff232","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T01:07:26.157684Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.02452/citation-record","integrity":"/paper/2505.02452/integrity","json":"/paper/2505.02452/citation-record.json","paper":"/paper/2505.02452"},"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-16T01:07:27.193741Z","title":"Asymptotically good codes correcting insertions, deletions, and transpositions,","venue":null,"work_id":"58f44451-c90e-401e-98f2-597b963fb877","year":1999},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.895766Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:02d34e243fc552120fac96e3b89c099cbc29454f3eff4e88b5e241c57aa50bc1","observation_id":"94d20e7f-b57f-47c4-adfb-41bd1e5485de","resolution":{"observed_at":"2026-08-16T01:07:27.200990Z","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-16T01:07:27.172566Z","title":"Bounds for deletion/insertion correcting codes,","venue":null,"work_id":"8223eb78-a11a-4054-a3c4-020e2242a221","year":2002},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.901762Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:7eb5f5ef1b0bcb8efed205d3b1f9e97661e72e5ff69751f85b3f5fb67770b8e8","observation_id":"4ae42a6b-f647-4ba7-b0eb-d1179779fd76","resolution":{"observed_at":"2026-08-16T01:07:27.179088Z","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-16T01:07:27.150004Z","title":"Synchronization strings: Codes for insertions and deletions approaching the Singleton bound,","venue":null,"work_id":"e49c10b2-4a84-4f4b-ba45-e18da107f44f","year":2021},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.907185Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:b37fe835e9f218a15b05e1172fb113635efc532fd9388cec5ff4e67b31fad3e8","observation_id":"46414734-6bf5-45f6-9fba-c09e1e6f7f3c","resolution":{"observed_at":"2026-08-16T01:07:27.156797Z","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-16T01:07:27.130885Z","title":"Efficient low- redundancy codes for correcting multiple deletions,","venue":null,"work_id":"a79472b6-ee24-4618-835e-dac02d816d56","year":2017},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.912749Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:6c61a40e011ca9284b2aa4c20ffa02ef43dc8226b934b1b924224582753895e8","observation_id":"82d8faaa-1d36-4b9d-8f7a-0f9427219c5e","resolution":{"observed_at":"2026-08-16T01:07:27.137088Z","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-16T01:07:27.112439Z","title":"Deletion codes in the high-noise and high-rate regimes,","venue":null,"work_id":"0d179e2a-0a18-436b-a338-1fb4d8a4d952","year":1961},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.918232Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:664e22cedfdae6e704d33b547dee382d579b5ead84c47ac4db6dd793cf38fb83","observation_id":"925c6739-1387-477e-bb3a-868223684a55","resolution":{"observed_at":"2026-08-16T01:07:27.118117Z","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-16T01:07:25.923648Z","title":"Codes correcting a burst of deletions or insertions,","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.923648Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:bb4d28c5e3c88cff7a739e7012f6bc46121f78a4ca63b93f958e10b9771e0e47","observation_id":"775c68be-b37b-449b-900f-10df02e4b43f","resolution":{"observed_at":"2026-08-16T01:07:25.923648Z","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-16T01:07:27.068940Z","title":"Codes correcting two deletions,","venue":null,"work_id":"c72b477b-31e3-46a1-9c2e-c9ba3dc76f26","year":2018},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.929712Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:f65f77fca908c7beb25f633f07c614ddbcdaa43db8db4e413d009b2b41419de3","observation_id":"7bf1b249-a6c5-4412-9a2c-ba5ce4df92b3","resolution":{"observed_at":"2026-08-16T01:07:27.074865Z","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-16T01:07:27.049953Z","title":"Deterministic document exchange protocols and almost optimal binary codes for edit errors,","venue":null,"work_id":"706e5dcf-8820-4159-86f9-c79573481e97","year":2022},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.934847Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:d336ccac2600973a4ef795944afb9b88d89e2e013fe0ff10ec2ce40802dc1691","observation_id":"10725338-d393-4314-859c-b0007b103e33","resolution":{"observed_at":"2026-08-16T01:07:27.055945Z","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-16T01:07:27.029405Z","title":"Optimal codes for the q-ary deletion channel,","venue":null,"work_id":"2a06d83e-54cd-48f8-9488-181348df93f6","year":2020},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.940319Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:bc914c106dcb1bab7edea52b444989a7d5c7bedd0654721591660c2db78f23f3","observation_id":"9ae1d8f3-d58f-4dec-aa18-9f342b6111d1","resolution":{"observed_at":"2026-08-16T01:07:27.035871Z","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-16T01:07:27.009727Z","title":"Optimal systematic t-deletion cor- recting codes,","venue":null,"work_id":"abc9f1a2-e617-446b-ae9d-e309cbc8a6a9","year":2020},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.945291Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:f632385dc9cf5993fdd712c2b54b04703a81d04372f2f27571e9936e9675b60f","observation_id":"a8ea87ac-a255-458b-b0af-a1bcb17657c5","resolution":{"observed_at":"2026-08-16T01:07:27.015371Z","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-16T01:07:26.987403Z","title":"Optimal document exchange and new codes for in- sertions and deletions,","venue":null,"work_id":"b32cebcb-1611-4d99-994b-eaebd63f12f3","year":2019},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.950512Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:9ca33edfe8109c0c440ca186afb547f80d825389e02828ed27887a30bb9a0f4e","observation_id":"c918e346-f27e-4f38-b01c-4a5f14cc96ad","resolution":{"observed_at":"2026-08-16T01:07:26.994343Z","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-16T01:07:26.967251Z","title":"Efficient linear and affine codes for correcting insertions/deletions,","venue":null,"work_id":"b3ff019b-927e-481f-9858-6e9df95de5ae","year":2021},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.955953Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:bd1732c584f9b4c466dcca444e741721a2168f717ed44245435cdb1f781a8f6e","observation_id":"b7263f36-e19a-42c3-80b8-0e2c6cee591c","resolution":{"observed_at":"2026-08-16T01:07:26.973374Z","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-16T01:07:26.946790Z","title":"Synchronization strings and codes for insertions and deletions–a survey,","venue":null,"work_id":"d6409da6-ac66-49b2-8ac8-f8067f33c767","year":2021},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.961284Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:601690553f20ee406f4c602d98a3fffa4e46998b87f17fcf37d0ea8b308d9403","observation_id":"d4e44263-b6e3-4439-82e8-4b3682d6b1fd","resolution":{"observed_at":"2026-08-16T01:07:26.953336Z","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-16T01:07:26.924447Z","title":"Optimally resilient codes for list-decoding from insertions and deletions,","venue":null,"work_id":"66049418-c6c4-4e02-ab3b-67a00e643e11","year":2020},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.966636Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:9e043f86d780228fd4b0c4eefa611811bac64bcdd93b577a777ecb309eccc980","observation_id":"3e1ac595-7b59-4a62-ba06-585c888cc879","resolution":{"observed_at":"2026-08-16T01:07:26.931379Z","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-16T01:07:26.902932Z","title":"Explicit two-deletion codes with re- dundancy matching the existential bound,","venue":null,"work_id":"235b3e42-c36d-4573-b743-1bac2e4c51ae","year":2021},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.971588Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:3e3b8309177caf03d6f1919c8967757e4681ef0ce028f3061c7d7b2a490c19bc","observation_id":"9644ec71-8e5a-4c22-9c13-a3fa9fe976c2","resolution":{"observed_at":"2026-08-16T01:07:26.909764Z","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-16T01:07:26.881201Z","title":"The zero-rate threshold for adver- sarial bit-deletions is less than 1/2,","venue":null,"work_id":"66f02971-9be7-4611-9e75-47e8df260e56","year":2022},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.976670Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:806e50ecee1ddf703adb5214e5d984df4123df485b20e23370592f0c2c0409ee","observation_id":"328d6fba-90e2-40ce-a9d2-d73c3012ed4c","resolution":{"observed_at":"2026-08-16T01:07:26.887628Z","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-16T01:07:26.862588Z","title":"A survey of results for deletion channels and re- lated synchronization channels,","venue":null,"work_id":"a192781d-c9d9-4124-a876-bd9a77d215ae","year":2009},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.982502Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:a52a277ee4d324f18597ff511314ec4ca2f7fd802925b1aa7054d592e7299acf","observation_id":"d1f9169c-b5f6-4ea8-83e1-0c88a291e3c0","resolution":{"observed_at":"2026-08-16T01:07:26.868503Z","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-16T01:07:26.843523Z","title":"An overview of capacity results for synchronization channels,","venue":null,"work_id":"d8706a4c-b08e-49cc-8a58-ed6d09ed4a31","year":2020},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.988013Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:482c53b3aa713d0c6773feaee003046edb0c7bb677d07b86aaf860d94ab36637","observation_id":"55166ca0-53a5-4b4e-9258-8415c8e15106","resolution":{"observed_at":"2026-08-16T01:07:26.849369Z","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-16T01:07:26.823888Z","title":"Synchronization strings: List decoding for insertions and deletions,","venue":null,"work_id":"7bc31b99-5b28-481d-8822-0d5a9e74ab07","year":2018},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.993265Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:20ae6fcaa91ab5010033d38e3fe7b54d3bd80ea9a04a1eaa2b5a4e7a115bcaad","observation_id":"9a11236a-7bb6-499c-bcd1-50050dfe9c96","resolution":{"observed_at":"2026-08-16T01:07:26.830028Z","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-16T01:07:26.805124Z","title":"Improved decoding of Reed-Solomon and algebraic-geometric codes,","venue":null,"work_id":"ea4ec96a-12bc-48a3-926d-2d7f36c7a34d","year":1998},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:25.998342Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:8a4ba0dc0e9998a8819de3224170f6d37f8dfd6081ed4f81ade893398cb0fe8b","observation_id":"26d1a190-2fdc-49d5-b4b9-2527da2814f4","resolution":{"observed_at":"2026-08-16T01:07:26.811390Z","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-16T01:07:26.786676Z","title":"Traitor tracing for shortened and cor- rupted fingerprints,","venue":null,"work_id":"8314f3ef-2154-4e95-9550-90ce73aab1d7","year":2002},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.003628Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:35720f038f65c8017ad9c2cd162cc9a12b560c1c1e1d3fbc752d4515eab3030f","observation_id":"15a6e1a9-d2e4-4400-8191-0bd8a36f581d","resolution":{"observed_at":"2026-08-16T01:07:26.792321Z","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-16T01:07:26.764209Z","title":"Deletion correcting using generalized Reed-Solomon codes,","venue":null,"work_id":"a8dc8674-2898-4305-a79c-88f111b83b66","year":2004},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.008737Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:46c092baef65f1c810bb0a402f70d4763aa6b49393bdc6f8f2a3825d0b79d8ac","observation_id":"83c6a197-68a6-4978-a4d1-c0373d2538da","resolution":{"observed_at":"2026-08-16T01:07:26.771412Z","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-16T01:07:26.746328Z","title":"Construction of deletion correcting codes using generalized Reed–Solomon codes and their subcodes,","venue":null,"work_id":"b15611f3-7658-41a0-8fe3-298879615019","year":2007},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.014196Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:3c6a932b27ae09ad1c3ea3884aa896ef2e87cdb3fdd8eafacf3b9da4e209b929","observation_id":"e408805e-305f-4a18-bfe8-b2193c808b3f","resolution":{"observed_at":"2026-08-16T01:07:26.751669Z","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-16T01:07:26.728475Z","title":"Explicit constructions of two-dimensional Reed-Solomon codes in high insertion and deletion noise regime,","venue":null,"work_id":"657a6a54-fed1-487e-ab24-517c5a2db4ee","year":2021},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.019433Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:fc037d6145288557353be87a8a06d72db81a5350dfeadfa0b804a87188d35716","observation_id":"492873fa-f361-4866-a403-bfab77c85ba5","resolution":{"observed_at":"2026-08-16T01:07:26.733918Z","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-16T01:07:26.710085Z","title":"On 2-dimensional insertion-deletion Reed- Solomon codes with optimal asymptotic error-correcting capability,","venue":null,"work_id":"555ef555-d745-48e6-a7f7-13c9a8f22249","year":2021},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.024772Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:742ee3e2f2b749da1890154309ecad31436c8a5a2049f43f3feccddc66ec4417","observation_id":"0d9392eb-90d8-46e2-a6ca-9a2176a17d47","resolution":{"observed_at":"2026-08-16T01:07:26.716018Z","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-16T01:07:26.688403Z","title":"Reed–Solomon codes against ad- versarial insertions and deletions,","venue":null,"work_id":"df5dac0c-ec52-454e-9d3f-e690d8861eb9","year":2023},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.030175Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:14bf680420527e8e26c62674116757123e4001d8bf0c427b6b8d1f2a80563fa8","observation_id":"36fb55a6-8173-4014-ae06-c58415fe21b9","resolution":{"observed_at":"2026-08-16T01:07:26.695025Z","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-16T01:07:26.667006Z","title":"Optimal two-dimensional reed– solomon codes correcting insertions and deletions,","venue":null,"work_id":"89cf723f-c4af-453d-94fd-261edb698095","year":2024},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.035243Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:83b16773144888ea8981b533c9f3afcae6590cfd0cb6127fe87dc74f26618dfa","observation_id":"d2eca4c5-8fea-41fa-96ad-9d38463c5d20","resolution":{"observed_at":"2026-08-16T01:07:26.673733Z","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-16T01:07:26.646393Z","title":"Optimal RS codes and GRS codes against adversarial inser- tions and deletions and optimal constructions,","venue":null,"work_id":"e1886509-24a6-4e90-a357-391620939a9d","year":2024},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.040756Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:1a20962c4f1d7836fcb9186acc93f7a8673fef6ce967dd1122c781de3009a0c1","observation_id":"968668d4-61df-4cec-a636-2e2cb98be31c","resolution":{"observed_at":"2026-08-16T01:07:26.652036Z","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-16T01:07:26.045970Z","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":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.045970Z"},"links":{"cited_paper":"/paper/2407.07299","citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:f1a7c3af6cf50cfcf5eb30bad01bd538c0f1f078d211fe986fbc1b000c060008","observation_id":"f3952945-4281-439a-b34c-2a39a7c0c031","resolution":{"observed_at":"2026-08-16T01:07:26.045970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-19T16:43:37.364724Z","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:9e34d59ddb46c3da2bf64f664c4c5304d49a169e0ab0b45138efc25d16bcdbac","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T01:07:26.626251Z","title":"Reliable communication over channels with insertions, deletions, and substitutions,","venue":null,"work_id":"9d0cd576-a9e4-4e74-a29b-bbdf418f352b","year":2001},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.057137Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:e423452660f86740241d7f16030027242f57b096bf958d3042f1c70a7b595a52","observation_id":"66d1de50-a606-409e-85d3-f585af643613","resolution":{"observed_at":"2026-08-16T01:07:26.632470Z","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-16T01:07:26.608024Z","title":"Algebraic soft-decision decoding of reed- solomon codes,","venue":null,"work_id":"d4de6858-fe29-46f5-ae34-3cacea53dea6","year":2003},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.062271Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:8db5290f9a0c80b43304d52cee8ea5411bcd1f26fa7883be609d5d4ec1ec93ac","observation_id":"e6677774-70cf-44a7-8336-fa78f294ec9d","resolution":{"observed_at":"2026-08-16T01:07:26.614085Z","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-16T01:07:26.590379Z","title":"Unbalanced expanders and randomness extractors from parvaresh–vardy codes,","venue":null,"work_id":"b727c0c9-716c-49d3-9d58-fb567e693576","year":2009},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.067546Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:22f96d68f926c80ad5ba5c561348ea3f7044ba4030f721f12bef5181aaa043ba","observation_id":"2f387afc-b6da-4202-9973-016fb4b0d901","resolution":{"observed_at":"2026-08-16T01:07:26.595948Z","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-16T01:07:26.570679Z","title":"High-probability list-recovery, and appli- cations to heavy hitters,","venue":null,"work_id":"cb689c90-2f9f-4074-bb93-324ef7cd1754","year":2022},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.072561Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:69d108b4a5ae4dc3ced1dfc1d605b079540da138a687d59457012cdc808075a7","observation_id":"afbd54d2-06ba-497f-9e45-d67292faf390","resolution":{"observed_at":"2026-08-16T01:07:26.577311Z","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-16T01:07:26.550121Z","title":"Efficiently decodable non-adaptive group testing,","venue":null,"work_id":"06317062-8437-4643-be48-d6c2a896d2ba","year":2010},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.077890Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:7fc853e9d714898fbc5f571a59ff813499025b9d777ba49e5f623858006f774c","observation_id":"8ff22ac8-c748-4316-9ab0-544b8bace6c3","resolution":{"observed_at":"2026-08-16T01:07:26.556381Z","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-16T01:07:26.531993Z","title":"Average-radius list-recoverability of ran- dom linear codes,","venue":null,"work_id":"73d3a1fb-cfb9-4039-93b7-bb17d728aa6d","year":2018},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.083477Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:b78237e95c8897ece56b36ef7129f623f18bb01a98a9e84b5286c573e4a52e95","observation_id":"a09c6d40-8a0c-41c2-afa9-47082e2b755a","resolution":{"observed_at":"2026-08-16T01:07:26.537751Z","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":"2005.02478","last_updated":"2020-07-03T23:01:10Z","snapshot_observed_at":"2026-07-06T09:17:56.015933Z","submitted_at":"2020-05-04T17:42:56Z","title":"On the list recoverability of randomly punctured codes","version":3},"cited_work":{"arxiv_id":"2005.02478","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.02478","snapshot_observed_at":"2026-08-16T01:07:26.226640Z","title":"On the list recoverability of randomly punctured codes","venue":"math.CO","work_id":"533fd728-95d1-4f47-ae4f-71f339236c78","year":2020},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.088365Z"},"links":{"cited_paper":"/paper/2005.02478","citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:d8c44c00022502e258f0249ca7dad0c8938ab50db1aa19fb8d7cf2ac4bcb92d2","observation_id":"940c6fc6-e894-4ea1-9cba-ef59c4ac62cf","resolution":{"observed_at":"2026-08-16T01:07:26.234801Z","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-16T01:07:26.514024Z","title":"Tighter list-size bounds for list-decoding and recovery of folded reed-solomon and multiplicity codes,","venue":null,"work_id":"2f3c99e1-0051-49bc-9ff9-227327b590ab","year":2024},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.094124Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:c237633633cdbaa0f317c9e82293131674c5d6e4b3f6c66a3adc88c931e09a57","observation_id":"db2799de-8794-4635-93c0-6bf49430cb5e","resolution":{"observed_at":"2026-08-16T01:07:26.519524Z","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-16T01:07:26.492218Z","title":"Improved list-decodability and list-recoverability of reed–solomon codes via tree packings,","venue":null,"work_id":"55a7388f-bc8b-4d66-85d1-1b70ba874041","year":2024},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.099219Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:a5a79bff0faa6ff6a660d0364fe32fc8f4a2bf742283139f6cc3549a1b0deb8e","observation_id":"6a7bbcf5-d7d4-4a46-8972-738b9ba28be2","resolution":{"observed_at":"2026-08-16T01:07:26.499660Z","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-16T01:07:26.472974Z","title":"On list recovery of high-rate tensor codes,","venue":null,"work_id":"4b63375e-edb9-487e-a2e4-a293461c92ec","year":2020},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.104532Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:10074a824e07899955e0324c063501aa6ee1529bdae1bc190c76eb01210eeb98","observation_id":"941a482d-82e7-4e70-994f-97923fe7c0b6","resolution":{"observed_at":"2026-08-16T01:07:26.478930Z","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-16T01:07:26.452735Z","title":"Next-generation digital infor- mation storage in dna,","venue":null,"work_id":"794da6c0-089c-4fd5-b9c1-c65661561d9b","year":2012},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.109861Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:8f093b1d4a2b1c843e074e4963274a6439689651d696830524dc938211962c31","observation_id":"20903a20-b898-4a20-a5c3-ed36e47a363e","resolution":{"observed_at":"2026-08-16T01:07:26.459189Z","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-16T01:07:26.432412Z","title":"Towards practical, high-capacity, low-maintenance information storage in synthesized dna,","venue":null,"work_id":"651c667f-69cd-468e-b53b-2bebff56d013","year":2013},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.115188Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:5da11bc50ac61f37a99b3ea0a4154cb77747cc872bbab9a9423b8e8ee877ef5a","observation_id":"941b50a5-7f29-45b4-b8dd-a3252f85bae8","resolution":{"observed_at":"2026-08-16T01:07:26.438049Z","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-16T01:07:26.413756Z","title":"Concatenated codes for multiple reads of a DNA sequence,","venue":null,"work_id":"402da52b-21ce-4a06-b302-784b2f764878","year":2023},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.120411Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:9399225947cc3ca1b36ce911354457c7fd3b9b31a40460f70bc59523bc0c6c1d","observation_id":"5e80af49-e69f-4ac6-8673-bab9c8e52ed7","resolution":{"observed_at":"2026-08-16T01:07:26.419761Z","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-16T01:07:26.394181Z","title":"Index-based concatenated codes for the multi-draw dna storage channel,","venue":null,"work_id":"1c78e702-0a6d-4c4b-add7-8bcdb103c5e9","year":2023},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.125900Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:fdd453204d5baa36d01a47ba3fd57ed0b353f7ad6fb1212798fdadd3f7208dc1","observation_id":"b31db5f6-d1dc-400e-9113-293539932eec","resolution":{"observed_at":"2026-08-16T01:07:26.400419Z","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-16T01:07:26.373883Z","title":"Symbolwise map estimation for multiple-trace insertion/deletion/substitution channels,","venue":null,"work_id":"1297d4fb-1018-4fe7-af77-0bac820680b4","year":2020},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.131178Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:d47e3332c8d3b96f980058936a5b1191f370ff5eeb3663e11e1ac8a386779892","observation_id":"bbeb54ee-d6d7-49cd-94f6-c8a3e57e0fb7","resolution":{"observed_at":"2026-08-16T01:07:26.379914Z","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-16T01:07:26.354465Z","title":"Trel- lis bma: Coded trace reconstruction on ids channels for dna storage,","venue":null,"work_id":"b2835c2a-51bb-4a84-9f72-5411802f8a38","year":2021},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.136367Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:98f43b5dd13b541f82cfaa4a08365a64ce2f40600caa5d090558a34c67e25535","observation_id":"5a2c881e-7e80-4f10-9d34-9695080e30ea","resolution":{"observed_at":"2026-08-16T01:07:26.360630Z","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-16T01:07:26.335080Z","title":"Improved decoding of reed-solomon and algebraic-geometric codes,","venue":null,"work_id":"3833753f-8132-4388-aac3-d99a9cfa6164","year":1998},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.141790Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:5af9d3841f2ee697c243f4073745ad56270c0e78efa1f46323d286e27c1df61f","observation_id":"ff6e20f4-b50b-43f4-ae11-301a92692796","resolution":{"observed_at":"2026-08-16T01:07:26.340842Z","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-16T01:07:26.315736Z","title":"Mitzenmacher and E","venue":null,"work_id":"7dc26bd8-4de8-4485-86cb-3284c0263f17","year":2005},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.147283Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:7aa1e28200a751a6791a2d833baf11c0e2b88d1e098dfa031391de20f180cff7","observation_id":"76858967-dcbd-4dd8-8d12-195142d1449a","resolution":{"observed_at":"2026-08-16T01:07:26.321380Z","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-16T01:07:26.294971Z","title":"Sequential decoding of multiple sequences for synchronization errors,","venue":null,"work_id":"7ddc36e9-5431-4d32-9ed7-bc8790a8b039","year":2024},"citing_paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-16T01:07:26.152378Z"},"links":{"citing_paper":"/paper/2505.02452"},"observation_digest":"sha256:b1ea91e22584bbf98dca988fd79d133555db2fca9ca8807d7797148f32585aca","observation_id":"cf97f916-cfae-4ceb-b88f-633b923d6b04","resolution":{"observed_at":"2026-08-16T01:07:26.301045Z","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":"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-19T16:43:37.364724Z","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:5989c9927aadfcc8ced478b8785e25509d48ba47768405f2f76d31628c39fe69","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"}}],"paper":{"arxiv_id":"2505.02452","last_updated":"2025-05-05T08:31:25Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-19T16:43:37.364724Z","submitted_at":"2025-05-05T08:31:25Z","title":"Decoding Insertions/Deletions via List Recovery"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":2,"verified_fuzzy":45},"total_outbound_references":50},"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 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:2505.02452."}