{"as_of":"2026-08-09T12:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6ba2358aa2d57b374a30434416f5ccd05ddaa4fad6b5be00b5fee71a2fe33bf5","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:53:11.687769Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2507.04806/citation-record","integrity":"/paper/2507.04806/integrity","json":"/paper/2507.04806/citation-record.json","paper":"/paper/2507.04806"},"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-06T19:53:17.960951Z","title":"A Mathematical Theory of Communication,","venue":null,"work_id":"98d9e650-4fbb-4261-9d8c-f23fde3ce1e8","year":1948},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:08.334519Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:f1e1d5536a48375746e8e65313f471284b4449f5f4b7c8bc49019b07a5bd9ca8","observation_id":"fa0eeaa6-6e29-4d0e-834e-39d1cd7fb30c","resolution":{"observed_at":"2026-08-06T19:53:18.049179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:17.701102Z","title":"Bit Loss and Gain Correction Code,","venue":null,"work_id":"3e19c1c0-70bd-48e1-ac41-de80fd26998f","year":1962},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:08.415136Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:a73661c900440a4012ab840a57da02832b48374753020d63de69127f0d852fb5","observation_id":"8ed0557d-e45e-48cf-9bc9-3db075d55b26","resolution":{"observed_at":"2026-08-06T19:53:17.851116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:08.509261Z","title":"Binary codes capable of correcting deletions, insertions and reversals,","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:08.509261Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:e87eb0494a98ce98be73c59cc97179b0c7fe0f3075d175fb198345546a8a010e","observation_id":"7137a607-056b-4174-aa0c-cca4477a2ca7","resolution":{"observed_at":"2026-08-06T19:53:08.509261Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:53:08.631214Z","title":"Nonbinary codes, correcting single deletion or insertion (corresp.),","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:08.631214Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:f607e6b9c8da2481587f46461ea0eb3efa1c1034f4535e95c92084e74466960a","observation_id":"5908e530-2b42-42d1-ac2d-3f9a9d37d223","resolution":{"observed_at":"2026-08-06T19:53:08.631214Z","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-06T19:53:17.425489Z","title":"DNA-Based Storage: Trends and Methods,","venue":null,"work_id":"6d471ca6-3539-4022-88ae-755313ba8926","year":2015},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:08.723969Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:060f465016fce916c50048c3e6e29a8b79933c5d4149e6d23ea13335567181a2","observation_id":"4df2ec98-0095-495a-a473-cfa2729bcc15","resolution":{"observed_at":"2026-08-06T19:53:17.547085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:17.059910Z","title":"A Characterization of the DNA Data Storage Channel,","venue":null,"work_id":"4a18f931-710c-437c-ad1a-4da3dd1cd81b","year":2019},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:08.828274Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:2eff878b0028c1bb70e205fcbcc00580fa8bfd07db93f274f80724125a55c40d","observation_id":"1debf8bf-320b-436e-9ef1-7dd4a9fdd8c7","resolution":{"observed_at":"2026-08-06T19:53:17.202636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:16.772807Z","title":"Coding for Racetrack Memories,","venue":null,"work_id":"cdc4ed29-59ef-4d15-97e6-eb2fa4425f58","year":2018},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:08.935627Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:213c170a5453c65cab0f51479a41bad647d9ea74c89d92980d7f7ac751409989","observation_id":"82405484-3951-405f-81ab-a130333a13c7","resolution":{"observed_at":"2026-08-06T19:53:16.902074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:09.033860Z","title":"Correcting Multiple Deletions and Insertions in Racetrack Memory,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:09.033860Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:1a21961eb58003617cae9fa88bbec39c952a7f23cf9f74673163a4b69b439d36","observation_id":"2352de8e-b320-43bc-bb16-0569d2d32556","resolution":{"observed_at":"2026-08-06T19:53:09.033860Z","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-06T19:53:16.405719Z","title":"Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors,","venue":null,"work_id":"ff10c81a-a65f-4856-84e3-f5b96ec5fb14","year":2018},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:09.104950Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:9f83a2e2dc9c601594d0daa2169ba01d21a9118d837fa8f309f836210985cc9b","observation_id":"7b3293fd-feff-42e1-84c0-8918784002c0","resolution":{"observed_at":"2026-08-06T19:53:16.564937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:16.088140Z","title":"Optimal Document Exchange and New Codes for Insertions and Deletions,","venue":null,"work_id":"6e89d356-7bb8-4321-808d-a8811c556d25","year":2019},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:09.206587Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:910495001e3f0c067e63a3a6b254c8f69d97fdd5c3a438e8fe6fc7e1d6d2d407","observation_id":"cc28dd8c-4cbd-4ff0-9cfa-556c43aa80a0","resolution":{"observed_at":"2026-08-06T19:53:16.239891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:15.806253Z","title":"Codes Correcting Two Deletions,","venue":null,"work_id":"908b8c9c-84ed-45b3-a7ae-9b611f7d1266","year":2019},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:09.288851Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:f2a1c25ec95a6425bcbf8aa64f6c43057cbae00820047bdfed13305938fdef80","observation_id":"4af880b5-78e6-4dc4-9a65-85c92b60ab74","resolution":{"observed_at":"2026-08-06T19:53:15.924899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:15.698624Z","title":"Two Deletion Correcting Codes From Indicator Vectors,","venue":null,"work_id":"b4680dd0-fd90-42a6-8fdc-9c440de89856","year":2020},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:09.366257Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:413ef70941c1e9a5c399dfb554771c40df78033cdedc1433d36b60d5a45222cb","observation_id":"3f769245-66f2-4853-adbd-6807f053fcad","resolution":{"observed_at":"2026-08-06T19:53:15.736617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:09.442236Z","title":"On Optimal k-Deletion Correcting Codes,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:09.442236Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:9c568992c02d6ab97c961f8df4281dec43a0cabe8badaf20f234daf65e213a0e","observation_id":"8491c3e0-42c5-4df5-9fce-190fc0da8da9","resolution":{"observed_at":"2026-08-06T19:53:09.442236Z","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-06T19:53:15.584529Z","title":"Explicit two-deletion codes with redundancy matching the existential bound,","venue":null,"work_id":"923cf151-2804-4924-897b-69b10e29b1c5","year":2021},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:09.493303Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:a10047f1627d33244639167e1096e8683a0a36a4a8eac3aad2af792ee19b2d2b","observation_id":"2ac7ffce-79c8-45b4-a45e-bf14a472bc1e","resolution":{"observed_at":"2026-08-06T19:53:15.633759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:09.571690Z","title":"Non-binary Two-Deletion Correcting Codes and Burst-Deletion Correcting Codes,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:09.571690Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:919d659c119fed47f3a04f6330378c3f3dca02bca83b1a9e18728276b5a78683","observation_id":"9a701ffc-2537-48db-8742-e8c665ee50ee","resolution":{"observed_at":"2026-08-06T19:53:09.571690Z","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-06T19:53:15.462094Z","title":"A New Version of q-ary Varshamov-Tenengolts Codes with more Efficient Encoders: The Differential VT Codes and The Differential Shifted VT codes,","venue":null,"work_id":"3f38f876-41fc-4eed-bd41-766bff7f5a9b","year":2024},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:09.675805Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:83d1665d4c0475796e066eb5ddde87047b52b713988ef1452b398dd5d2eddeea","observation_id":"ab211330-61ad-45c4-bab7-4b4199e6e5b5","resolution":{"observed_at":"2026-08-06T19:53:15.518226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03113","last_updated":"2025-09-07T02:25:34Z","snapshot_observed_at":"2026-08-03T09:09:44.609824Z","submitted_at":"2024-08-06T11:38:57Z","title":"Codes Correcting Two Bursts of Exactly $b$ Deletions","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03113","snapshot_observed_at":"2026-08-06T19:53:09.762243Z","title":"Codes Correcting Two Bursts of Exactly b deletions,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:09.762243Z"},"links":{"cited_paper":"/paper/2408.03113","citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:c76b692dc9bd3d86ee0ef622acef7d024fca72877f5b66d01ff9b89d77a0a796","observation_id":"508e1f09-6829-4a4c-91d0-385bcfa8e2c6","resolution":{"observed_at":"2026-08-06T19:53:09.762243Z","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-06T19:53:15.354881Z","title":"Single-Deletion Single-Substitution Correcting Codes,","venue":null,"work_id":"c300cf7f-49c2-4cae-922b-71d0bfdcb5fb","year":2023},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:09.875740Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:b9db221a7d53a9bf1c1a26217c9768e008e034c7c8466a95b74e7a3bf4f42203","observation_id":"90f151ab-f4c6-44b1-be32-525593bca28f","resolution":{"observed_at":"2026-08-06T19:53:15.408530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:09.985269Z","title":"Systematic Codes Correcting Multiple-Deletion and Multiple-Substitution Errors,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:09.985269Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:9f4e6d8b8da1f301f176e8a0fa4acbd92a56d5bcbaddaab55d7eb8b9f709929c","observation_id":"5a16e06d-673e-46a1-92f7-2cc1002d4a81","resolution":{"observed_at":"2026-08-06T19:53:09.985269Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:53:10.055901Z","title":"Binary Codes for Correcting Two Edits,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:10.055901Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:9828e843dec9271954b4177949a81cf49a75ff34ad2c90dd6de0779f345ce595","observation_id":"f1d02e4e-2ee0-481a-8830-0085cb79909a","resolution":{"observed_at":"2026-08-06T19:53:10.055901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.11231","last_updated":"2024-01-20T13:46:16Z","snapshot_observed_at":"2026-08-04T06:29:40.611109Z","submitted_at":"2024-01-20T13:46:16Z","title":"Two-Insertion/Deletion/Substitution Correcting Codes","version":1},"cited_work":{"arxiv_id":"2401.11231","doi":"10.48550/arxiv.2401.11231","metadata_source":"pith","pith_arxiv_id":"2401.11231","snapshot_observed_at":"2026-08-07T06:16:28.064256Z","title":"Two-Insertion/Deletion/Substitution Correcting Codes","venue":"cs.IT","work_id":"3efc5882-498a-453b-808a-91606afa1d3b","year":2024},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:10.130212Z"},"links":{"cited_paper":"/paper/2401.11231","citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:403235727f29b06fdca32e570bea83044196bc39771eab13d0716db972fe0199","observation_id":"4aef2493-0715-4924-8450-7a8b9fa506fc","resolution":{"observed_at":"2026-08-06T19:53:11.924719Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:15.216268Z","title":"A Technique for Computer Detection and Correction of Spelling Errors,","venue":null,"work_id":"df478b23-a19c-4558-975a-0d333a00cda7","year":1964},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:10.212557Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:71151df2f199ab1cb8a97c3011d0c9914b4d991c0f2e8b89c4bf44550b52ac32","observation_id":"4e2c1c69-d5ca-4353-b351-d8bc261d3d91","resolution":{"observed_at":"2026-08-06T19:53:15.258464Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:15.110935Z","title":"Detecting Substitutions and Transpositions of Characters,","venue":null,"work_id":"0a2087e9-d9de-4416-bfdf-3c579f6f86a2","year":1998},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:10.298267Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:a9d68d2f22a38b4ac138853655a8f82dfe2050edd592ac8870dce2ebfce9e172","observation_id":"3ec9b7b0-79d0-4ae5-8d35-fb3407de45f7","resolution":{"observed_at":"2026-08-06T19:53:15.152754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:14.990376Z","title":"Peak shift caused by gaussian noise in digital magnetic recording,","venue":null,"work_id":"331f5b5c-1444-4d06-afe0-1c3b9dfa6a71","year":1976},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:10.357586Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:ecd51a97b9782994069b04a8c50b12e7f04fa8b173fbcf45a3f05f1a82b299fa","observation_id":"9ff91906-44bf-4a59-8cbc-9d3e77f0d508","resolution":{"observed_at":"2026-08-06T19:53:15.041940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:14.891160Z","title":"Magnetic and optical storage systems: opportunities for communications technology,","venue":null,"work_id":"d06a1733-5180-44bf-af2b-0162333f6fe1","year":1989},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:10.445799Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:8bea661a23a76656e92a9061cb898ca0a4c6ad3b52fcfc8cdd45535678d3d6b1","observation_id":"ba58e059-af96-41ff-9b27-c2ffafd5f52a","resolution":{"observed_at":"2026-08-06T19:53:14.929482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:14.784925Z","title":"Shift error correcting modulation codes,","venue":null,"work_id":"f90863a0-0762-49b8-9577-b744e64022a7","year":1991},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:10.508363Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:5d7bf9c5b62c98a546f072e2a39d0b46f0958491e7ab9dc4b6c3396c5443d30e","observation_id":"b8f9b95a-4020-4c28-95f3-51eff3525dd3","resolution":{"observed_at":"2026-08-06T19:53:14.835556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:14.642680Z","title":"Bounds on the Capacity of the Bit-Shift Magnetic Recording Channel,","venue":null,"work_id":"1103c62d-11cd-4f18-a5d6-f8e60cae3e06","year":1991},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:10.593119Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:2e7027fd0837949ce5d665bb0174e9e5dc817524f437769fb6d4a44cc63650eb","observation_id":"fb988b6f-60b0-4cba-835d-70b24f80e331","resolution":{"observed_at":"2026-08-06T19:53:14.708539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:14.478142Z","title":"Error and Erasure Control (d, k) Block Codes,","venue":null,"work_id":"b6eece32-3973-4b89-ae5c-0dd7cde0eae6","year":1991},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:10.672246Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:db6ad4866d7a475e1a9f4c555b0d8bc867fadcc4de7c08732305c813429001ba","observation_id":"44f304a6-4817-4b7c-a11d-d6fa803a437e","resolution":{"observed_at":"2026-08-06T19:53:14.566677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:14.241656Z","title":"A Coding Scheme for Single Peak-Shift Correction in (d, k)-Constrained Channels,","venue":null,"work_id":"d955ca92-0bb5-4059-a54a-4d40a88fbc55","year":1993},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:10.748282Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:a93f64f687e6c7beb5dc05dc45c40ab0e7921efc3ed21ca234b8fc9303c8dc90","observation_id":"1d4d49db-bfbe-4d27-b0f1-f52adbe6316b","resolution":{"observed_at":"2026-08-06T19:53:14.365143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:14.050036Z","title":"Perfect (d, k)-Codes Capable of Correcting Single Peak-Shifts,","venue":null,"work_id":"a934b713-c556-4126-a09f-6a8c12183db7","year":1993},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:10.828429Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:76f6253991de0566e9c49594535f9e33ffef790b6c8c29bdfa1f2d981a3963e4","observation_id":"31f22a2c-30c4-43da-bddc-638022ceb1d1","resolution":{"observed_at":"2026-08-06T19:53:14.138968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:13.889783Z","title":"Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis,","venue":null,"work_id":"1b34cda4-dfd0-442d-b66a-4e983e26d5ab","year":2019},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:10.905087Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:8c180e5260ed5747de03d9ccfedd341890fc995a514becaa3bba54e5ebb8ee20","observation_id":"05cc111a-4666-4496-a51f-56687e5539f3","resolution":{"observed_at":"2026-08-06T19:53:13.940456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"publication/3824898","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:53:12.501289Z","title":"Codes Correcting Transpositions of Consecutive Characters,","venue":null,"work_id":"a86ae84e-ad7e-46f3-81f3-7f02a2c9e57d","year":2024},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:10.981614Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:e1b401a8f9b98641c214ce3f37b379a5167c70afbe7264f3a7420d5b1c1bd0a9","observation_id":"6a1f5f6d-dd9c-40c7-b744-fa4eb2438345","resolution":{"observed_at":"2026-08-06T19:53:12.588366Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:11.058587Z","title":"Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:11.058587Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:cc49f8c2ab42c772838592ee74601ad323b96b768911fdd828cf593f23111e11","observation_id":"16fd391f-ce35-4765-8ed4-4a8458fa6fd8","resolution":{"observed_at":"2026-08-06T19:53:11.058587Z","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-06T19:53:13.635814Z","title":"Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions,","venue":null,"work_id":"5dd083a8-2889-4b41-b87e-b9378dc71d11","year":1999},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:11.151429Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:08f7fa8a4354a00a8d9d4c3814baefae6f33631cd5d3b1436bc9a234b2a0ad9b","observation_id":"9ceb984e-7179-4e4a-b800-90805d2f2ede","resolution":{"observed_at":"2026-08-06T19:53:13.766690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:13.436961Z","title":"Analysis of asymmetric deterministic bitshift errors in a hard disk file,","venue":null,"work_id":"2079ea1c-c9d4-4ce7-8722-457e6bd2dc7b","year":1990},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:11.268938Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:a2a3cd973529f856d664e02ffe57735f70fff393160dcb1798852e46dedb62b4","observation_id":"d2694ddb-8a40-4772-a21f-ae46cd39e894","resolution":{"observed_at":"2026-08-06T19:53:13.520770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"document/1076948","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:53:12.129836Z","title":"Binary Codes for Correcting Asymmetric Adjacent Transpositions and Deletions,","venue":null,"work_id":"0d637452-1532-461b-9cc4-b2251e0b9a66","year":2025},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:11.373821Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:c905e9e7bd7985c335bc6717ce3ff7312ec846e3101c00ac2a402591883cdeda","observation_id":"9a70114f-42ba-4a5f-9795-8af9d21a6431","resolution":{"observed_at":"2026-08-06T19:53:12.174958Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:13.261225Z","title":"Generalized Sphere Packing Bound,","venue":null,"work_id":"61f050d9-ed7c-4faf-9c55-7d55d8f1895e","year":2015},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:11.469863Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:fd1cd9786beca41fca8e22ee0d5650cb80b173d8662ca57a10b0fe116d2b9da0","observation_id":"ea05bc46-6e9a-4a7e-a720-b5f95a4fcf2b","resolution":{"observed_at":"2026-08-06T19:53:13.330547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:13.018182Z","title":"On Levenshtein’s Reconstruction Problem Under Insertions, Deletions, and Substitutions,","venue":null,"work_id":"d28a225b-c5b5-43dd-8b49-7acaef6b0abe","year":2021},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:11.549384Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:f1f4db6c84876869a9b6e09899edd75ed0b7fac587495dabeada85a894fde4ab","observation_id":"69ef32f0-5d44-4bf0-9ba0-4b86ca217c56","resolution":{"observed_at":"2026-08-06T19:53:13.163686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:12.838873Z","title":"Efficient Reconstruction of Sequences from Their Subsequences or Supersequences,","venue":null,"work_id":"22820a84-1bee-4ec2-b3fa-888c29818fc7","year":2001},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:11.617456Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:2f5c9b9b16dd41f72bef12b4026189a397bb75bc281e6c87aa766204710550aa","observation_id":"3aa3a957-a2b2-465f-847d-22a5abd084da","resolution":{"observed_at":"2026-08-06T19:53:12.935727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06T19:53:12.681414Z","title":"Tight Bounds on the Number of String Subsequences,","venue":null,"work_id":"7f35816f-a5dd-44bd-bb14-a251e5627711","year":2000},"citing_paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T19:53:11.687769Z"},"links":{"citing_paper":"/paper/2507.04806"},"observation_digest":"sha256:9f56f4737714ed172c6eef81af54d7c8c93f5df48358ec38ab60b40cbc9c21b4","observation_id":"7c25961b-a7e2-4874-b450-d90df92065b1","resolution":{"observed_at":"2026-08-06T19:53:12.764232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.04806","last_updated":"2025-07-07T09:25:02Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-06T19:36:41.358168Z","submitted_at":"2025-07-07T09:25:02Z","title":"On the Maximum Size of Codes Under the Damerau-Levenshtein Metric"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":3,"verified_fuzzy":28},"total_outbound_references":40},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2507.04806."}