{"as_of":"2026-08-09T20:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:466a74078a095dd2184932680ca88eb8e03ee86107105345aabd9051fbff48ea","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T18:55:19.492250Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"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/2508.14386/citation-record","integrity":"/paper/2508.14386/integrity","json":"/paper/2508.14386/citation-record.json","paper":"/paper/2508.14386"},"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-05T18:55:19.719625Z","title":"Correcting deletions with multiple reads,","venue":null,"work_id":"b8e11af0-8e87-45ee-94a5-0ff5dc4a559c","year":2022},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.440041Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:dad54fb188c175195cb069679389a6d8a069ce7196c19be509621587fab58de5","observation_id":"b7bf005b-c786-4a5e-9c20-3382b9c10d3c","resolution":{"observed_at":"2026-08-05T18:55:19.722592Z","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-05T18:55:19.712685Z","title":"Reconstruction of sequences distorted by two insertions,","venue":null,"work_id":"545aeb3b-195f-453e-b4dd-9ae39a82fd83","year":2023},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.443492Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:b11c0c9a88856127a1fa5e73fc07231d562ce5900c4ff0a8b9c4851509ba6f01","observation_id":"7c4abb0b-b23d-45ae-8079-89784d7af47f","resolution":{"observed_at":"2026-08-05T18:55:19.715218Z","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-05T18:55:19.706040Z","title":"Correcting two-deletion with a constant number of reads,","venue":null,"work_id":"7bc9920f-d285-4972-978d-409cdaa04c85","year":2023},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.446607Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:2e7caa9b01ca4b2e5db8d1a7ee65a0db67926a5ffc4561147273d8b5cc2d4d9a","observation_id":"f46b9800-7df3-4fe5-b65b-e3dbf967b682","resolution":{"observed_at":"2026-08-05T18:55:19.708328Z","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-05T18:55:19.699918Z","title":"Next-generation digital information storage in dna,","venue":null,"work_id":"5cc6563d-ce18-4ee3-8a70-ee40cc1b9b8f","year":2012},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.449007Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:7557ef6f0538a6c94be9b99b37f281391c8ad1fe587009b2349327c732012c7e","observation_id":"f0e996de-67a7-412d-80f5-a0b9ba6f6e06","resolution":{"observed_at":"2026-08-05T18:55:19.702153Z","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-05T18:55:19.692258Z","title":"Towards practical, high-capacity, low-maintenance information storage in synthesized dna,","venue":null,"work_id":"b6ce09eb-4ab2-4dfc-8bc6-8d6b2b5ae926","year":2013},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.451555Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:81b79017444d3fb1ba49b56b7df44c01d7a089d725a4b2091874e1da1f8e5b96","observation_id":"82261865-efa0-462f-9f15-705151bf71dc","resolution":{"observed_at":"2026-08-05T18:55:19.694754Z","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-05T18:55:19.686599Z","title":"Coding for racetrack memories,","venue":null,"work_id":"db230b87-2133-4300-a835-67295c4c554e","year":2018},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.454524Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:2c51e468b10a3e4ce95bfc2dd5269f98c959e8bf589799a491ae7ddd35465fb0","observation_id":"d31a127c-93c5-4404-8c25-a472369368a2","resolution":{"observed_at":"2026-08-05T18:55:19.688500Z","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-05T18:55:19.680303Z","title":"Coding for sequence reconstruction for single edits,","venue":null,"work_id":"f0e3b24a-9969-4bd5-adf6-04cad7421e3f","year":2022},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.456911Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:3f9cb0ced5c2a0193573cb6ed65f2bb0bf91c6cb6771041fd256e6bef07a1bb4","observation_id":"08efb484-c873-4188-8c0f-41ddb04a7f09","resolution":{"observed_at":"2026-08-05T18:55:19.682611Z","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-05T18:55:19.674029Z","title":"Sequence reconstruction under single-burst-insertion/deletion/edit channel,","venue":null,"work_id":"2c36853f-c24c-452e-8f47-ae0223ccb87b","year":2023},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.459406Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:759a3bef56f30ef647b4e08dce4744473b22395c008b4d3c7513921df3182265","observation_id":"83a3d48e-bdc9-4f85-9c55-a9fd25011885","resolution":{"observed_at":"2026-08-05T18:55:19.676191Z","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-05T18:55:19.667571Z","title":"Error-correcting codes for nanopore sequencing,","venue":null,"work_id":"a1e1921e-c2f0-420a-8bb2-87a2a92c0833","year":2024},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.461463Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:3903aa1cc06c9e42e1fc7b7d46fe4ab38dcc66142ff9f338dfe76a9c038ba679","observation_id":"ec3440f7-d1e0-4b98-b14d-6406e3c22973","resolution":{"observed_at":"2026-08-05T18:55:19.669939Z","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-05T18:55:19.660604Z","title":"Bounds and constructions of ℓ-read codes under the hamming metric,","venue":null,"work_id":"2058132c-99f2-446f-b4b2-a2b17eb3c699","year":2025},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.463435Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:2324639080efa0d7d0609fe1918a6807ac516f456f34237de3b788b0f271309e","observation_id":"a25be8e5-1b16-4eb8-95ea-9104988658ee","resolution":{"observed_at":"2026-08-05T18:55:19.663071Z","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-05T18:55:19.654163Z","title":"Coding for synthesis defects,","venue":null,"work_id":"8f585b8e-08cb-4e4e-a613-6ea194711914","year":2024},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.465774Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:d10857432dc6d70ba31823b0dd4c7114d4c4ef4bb3d545c022c3ad88d62d4ef0","observation_id":"ff2c3fe3-75c5-48ab-971c-6aa2f8c3b9a2","resolution":{"observed_at":"2026-08-05T18:55:19.656390Z","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":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-08T21:28:36.670572Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"cited_work":{"arxiv_id":"2506.07609","doi":"10.48550/arxiv:2506.07609","metadata_source":"pith","pith_arxiv_id":"2506.07609","snapshot_observed_at":"2026-08-06T00:16:16.768632Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","venue":"cs.IT","work_id":"40879fa4-1124-4e24-a32a-7c4f9228dfe8","year":2025},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.467668Z"},"links":{"cited_paper":"/paper/2506.07609","citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:42da18600d7c0fc67ef259c7ea4d3a281212ec2902f0e378a0e8a3e2007af577","observation_id":"f970dcf6-ebf5-4789-b484-4ac48ad8db1a","resolution":{"observed_at":"2026-08-05T18:55:19.516934Z","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-05T18:55:19.648216Z","title":"Efficient reconstruction of sequences,","venue":null,"work_id":"7aa68e03-72ea-4656-b8bd-43bc5e6bdae5","year":2001},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.470357Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:a0eb2c6fdbacef6826677663f69b9bebfd012b6c6b4b5decbdf6b886ad93158e","observation_id":"c3bf58af-0b7c-498e-a9c3-51ecd125a238","resolution":{"observed_at":"2026-08-05T18:55:19.650554Z","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-05T18:55:19.641149Z","title":"Efficient reconstruction of sequences from their subsequences or supersequences,","venue":null,"work_id":"52ed580a-a356-413e-82bb-6643fd879de2","year":2001},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.473423Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:ec2a6f8c24cb434a3a92b32529d2fe9fe0d3c02e77de89df0e975c5eb9da1a71","observation_id":"e61840d6-7dd7-43f9-b446-643e06eccf56","resolution":{"observed_at":"2026-08-05T18:55:19.643823Z","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-05T18:55:19.634238Z","title":"Exact reconstruction from insertions in synchronization codes,","venue":null,"work_id":"e28d276b-9fb7-492b-8a71-0b5ab44b7bf3","year":2017},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.475889Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:05138f0ede93ff3f0ab8f1d259ed289b8f2ab912768b4fda5be47cdb37ce17a4","observation_id":"10ca4378-dc91-4b6c-a9cc-f06fd7dc8655","resolution":{"observed_at":"2026-08-05T18:55:19.636824Z","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-05T18:55:19.627879Z","title":"Sequence reconstruction over the deletion channel,","venue":null,"work_id":"fec8c7ba-f054-4402-ad75-6024fbdfeff9","year":2018},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.478400Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:55980b32a5a85bdddf90b153fb5f4899875d9e0fe9a60a514a13a8302b43aa00","observation_id":"1b3985f2-f231-4777-831d-63538e72dc47","resolution":{"observed_at":"2026-08-05T18:55:19.630266Z","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-05T18:55:19.622382Z","title":"Sequence reconstruction problem for deletion channels: A complete asymptotic solution,","venue":null,"work_id":"229bdb81-2de8-437c-8672-001c0b36a90c","year":2025},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.480262Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:f8c441e3e890ebcb7264b03a4130ca548425b21d476add01f78534933992a5a8","observation_id":"19149bb6-8484-479b-9749-778e11f7c19b","resolution":{"observed_at":"2026-08-05T18:55:19.624419Z","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":"2025.35900","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:55:19.575880Z","title":"On the size of error ball in single-deletion double-insertion channels,","venue":null,"work_id":"979766c0-5387-470e-911e-bc35fcc71611","year":2025},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.482105Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:019510815c1486ff51903c6d445a3abb2139fdb90c64e1529cb5416d35ffb367","observation_id":"8541b1c7-5952-4468-8a04-4add237344df","resolution":{"observed_at":"2026-08-05T18:55:19.579387Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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-05T18:55:19.616394Z","title":"Binary codes capable of correcting deletions, insertions and reversals,","venue":null,"work_id":"d7297e09-1576-4f29-8e71-7321f96cc7b2","year":1966},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.484052Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:24287b5b2a3a972adee38f41b846a7783012f47bc2d16923923c01c61f461423","observation_id":"b7671f6d-bece-429d-a2d7-caf0847de568","resolution":{"observed_at":"2026-08-05T18:55:19.618504Z","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-05T18:55:19.608195Z","title":"Logarithmically larger deletion codes of all distances,","venue":null,"work_id":"b0f7948d-5347-4b85-b6ab-de4214cebcba","year":2024},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.486592Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:ecd1f8cf753ed8e2830cce345c2330a9c32474dd78681689cf4d906e5dfb6f0f","observation_id":"f86ec57b-06e0-48e4-b6d6-6e787900cf6d","resolution":{"observed_at":"2026-08-05T18:55:19.610460Z","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-05T18:55:19.600524Z","title":"Jukna, Extremal Combinatorics with Applications in Computer Science , 2nd ed","venue":null,"work_id":"52aa8708-cdba-4ff7-93c6-956f0688f234","year":2011},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.488593Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:69df85ab2097543c889d20156ef574ea6ea0fe9e4ea39b3cb62c21e21501c573","observation_id":"5a5bc078-92a5-436c-96c6-84156e1b887d","resolution":{"observed_at":"2026-08-05T18:55:19.603481Z","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-05T18:55:19.592697Z","title":"Bounds for deletion/insertion correcting codes,","venue":null,"work_id":"ada1685f-84cd-4497-b959-767b6607ef09","year":2002},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.490360Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:669dd8435c3d98ee77e84fefa3717c2e496759b1809b77be39c8dd116d0eabf1","observation_id":"0a360167-6e8e-49e2-bf45-d9686f954d39","resolution":{"observed_at":"2026-08-05T18:55:19.595608Z","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-05T18:55:19.583868Z","title":"Covering codes using insertions or deletions,","venue":null,"work_id":"67502c30-a893-432b-bc0b-10fae2ce79b3","year":2021},"citing_paper":{"arxiv_id":"2508.14386","last_updated":"2025-08-20T03:26:55Z","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T18:55:19.492250Z"},"links":{"citing_paper":"/paper/2508.14386"},"observation_digest":"sha256:4ca47ea581d8ec6c2b095032c30eff509e1b1a7e7f50135f2641128072d6a48e","observation_id":"f35d8b28-fe7c-4ef1-acb7-e3c5e6936bc5","resolution":{"observed_at":"2026-08-05T18:55:19.587008Z","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":"2508.14386","last_updated":"2025-08-20T03:26:55Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-05T18:55:18.664019Z","submitted_at":"2025-08-20T03:26:55Z","title":"Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":21},"total_outbound_references":23},"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 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2508.14386."}