{"as_of":"2026-08-18T19:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dfe8af17a7db59153699631753bd6db8979a30aa235b5ab78bcc3a7efa7c3737","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:42:14.014999Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-07T15:15:29.710738Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T00:26:19.389709Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"cited_work":{"arxiv_id":"2505.04232","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04232","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Binary reconstruction codes for correcting one deletion and one substitution","venue":null,"work_id":"f633c0da-265c-484c-821c-11b0eccdad54","year":2025},"citing_paper":{"arxiv_id":"2604.25294","last_updated":"2026-04-28T07:02:02Z","snapshot_observed_at":"2026-07-06T23:11:11.827339Z","submitted_at":"2026-04-28T07:02:02Z","title":"Correcting One Deletion and One Substitution with a Constant Number of Reads","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-07T15:15:29.710738Z"},"links":{"cited_paper":"/paper/2505.04232","citing_paper":"/paper/2604.25294"},"observation_digest":"sha256:15a4a4510c53d365451aa03582a735ebdeb7e538471b3a7e1e82ed786e8e94f3","observation_id":"ddd39bc6-02c4-4df0-a528-8dc23446c3b3","resolution":{"observed_at":"2026-05-12T00:26:19.392896Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.04232/citation-record","integrity":"/paper/2505.04232/integrity","json":"/paper/2505.04232/citation-record.json","paper":"/paper/2505.04232"},"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-15T23:42:14.738052Z","title":"On Levenshtein’s reconstru ction problem under insertions, deletions, and substituti ons,","venue":null,"work_id":"2cb1455c-6b61-4219-a938-b1e80db8b4b2","year":2021},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.825918Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:bdce2389e41223533966c27005033c667615be39d144dc6f199a30fb2cdc2de5","observation_id":"de013d0f-5ac3-463d-a602-c538d09073c7","resolution":{"observed_at":"2026-08-15T23:42:14.742282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.725298Z","title":"Efficient l ow-redundancy codes for correcting multiple deletions,","venue":null,"work_id":"d8b4fd01-07b3-4fd3-9021-086e4fb37cdb","year":2018},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.831078Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:71a9c16dcf333155fa4f5787a8f0b6286bc2983b9faf6d9b245a25cb02f95585","observation_id":"a9608c6e-3659-4dd7-87d5-a1b7326da14e","resolution":{"observed_at":"2026-08-15T23:42:14.729533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.712223Z","title":"Correcting a single indel/edit for DNA-based data storage: linear-time encoders and order-optimality,","venue":null,"work_id":"b1d20d62-0d88-4083-8568-c04ee38a5aaf","year":2021},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.835708Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:1e0d8b346f3a6446f6bdfb164696adf48ac2042d6661b2ae730677e2cb0e6a4d","observation_id":"4d083e84-60b8-4a19-b96c-fd2af68b1b4f","resolution":{"observed_at":"2026-08-15T23:42:14.716431Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.699759Z","title":"Coding fo r sequence reconstruction for single edits,","venue":null,"work_id":"576fae43-ee4c-4291-87d6-0f5a4d14651e","year":2022},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.840641Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:a070dac94d190d5725e44fd9aec678519dfe54d2c8f8efe76771813bf85f87d1","observation_id":"d8e99b82-1181-4009-b626-146c4d4fdc46","resolution":{"observed_at":"2026-08-15T23:42:14.703792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.686727Z","title":"C oding for racetrack memories,","venue":null,"work_id":"79a39e2e-edf5-4778-be87-569cca831c87","year":2018},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.844896Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:493d72bfd5e5473b600db97bc5df6dd111b97d97a4b03498bdb1fd9151788853","observation_id":"87461280-35cd-4c52-bce9-90f8aa46ad5c","resolution":{"observed_at":"2026-08-15T23:42:14.691113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.673638Z","title":"Correcting del etions with multiple reads,","venue":null,"work_id":"bfa1842e-dcd4-4e35-b40f-169b1390ac62","year":2022},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.849306Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:748fcd0bf1071056193af09170c7442df21a30b38b0771acbef4d2cdad7e994f","observation_id":"363aa658-b255-4077-9022-bec7b3d0ffcc","resolution":{"observed_at":"2026-08-15T23:42:14.677900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.659892Z","title":"Next-generation dig ital information storage in DNA,","venue":null,"work_id":"4d6bfe03-f992-4008-8663-28dab9afd0ee","year":2012},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.854402Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:9ddf597c6b39e381565d34cb7553a810a69630fdf88eafb7ef4a0c5efc9de15d","observation_id":"371930ed-2684-4f6a-a2c4-0094ea9c1753","resolution":{"observed_at":"2026-08-15T23:42:14.664514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.645418Z","title":"Beyond si ngle-deletion correcting codes: substitutions and transp ositions,","venue":null,"work_id":"21593dcb-2035-4855-a620-ffaad118389b","year":2023},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.859239Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:37ba30f620b32481e81d59fcda31315e4b749b83163ba8fac757f1d4e104ef60","observation_id":"d282bb2b-1f41-463a-9bae-85ada66d630b","resolution":{"observed_at":"2026-08-15T23:42:14.649691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.632179Z","title":"Codes correcting two deletions,","venue":null,"work_id":"d0b3c908-2b3a-4a94-93ea-7bad673bf9d9","year":2019},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.863391Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:2236bc84ad3386afdef296655a7e15ecf6f2b008f244722cb65df07fa8cd286e","observation_id":"ae4fe391-84f1-49a3-bb33-1144a3b8273f","resolution":{"observed_at":"2026-08-15T23:42:14.636298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.618610Z","title":"Sequence reconstruction ove r the deletion channel,","venue":null,"work_id":"e08dd817-8a64-4675-8880-2b518be48cfc","year":2018},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.867654Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:40972e22ddde1ab8e16915cda5bfe6038cd32bd742faadc6e217edd7b0f453e6","observation_id":"fce19f7e-4576-4b18-9d68-9d6240c49f5d","resolution":{"observed_at":"2026-08-15T23:42:14.623064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.605198Z","title":"Towards practical, high-capa city, low-maintenance information storage in synthesized DNA,","venue":null,"work_id":"b269a2ab-411b-49a9-b089-18bbcecd3985","year":2013},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.871853Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:88a932d4fb219c6029e077d48b446460b5ab48720b23f4aa76f03b27789ea8cf","observation_id":"6098bcb3-8f1f-4247-bac3-986a7af50d6c","resolution":{"observed_at":"2026-08-15T23:42:14.609720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.592034Z","title":"Explicit two-deletion co des with redundancy matching the existential bound,","venue":null,"work_id":"1c4d0ea1-1054-4850-9c9b-06e54e1efcb8","year":2021},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.876134Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:2681cc1876cfa706f3eae59a5754917c4c35a4d6cec235b5c842ab47259d1e19","observation_id":"48431f9e-e34e-464f-a20f-8df92da8f1dd","resolution":{"observed_at":"2026-08-15T23:42:14.596356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.20460","last_updated":"2025-04-29T06:47:12Z","snapshot_observed_at":"2026-08-16T05:25:54.926364Z","submitted_at":"2025-04-29T06:47:12Z","title":"Sequence Reconstruction under Channels with Multiple Bursts of Insertions or Deletions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.20460","snapshot_observed_at":"2026-08-15T23:42:13.880142Z","title":"Sequence reconstructio n under channels with multiple bursts of insertions or delet ions,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.880142Z"},"links":{"cited_paper":"/paper/2504.20460","citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:94368978bc94f0303a74951c0650e031dd22a2a7bb9d3212776697a9fcb32004","observation_id":"0206e8e1-bcc2-43b5-8b23-e8eed94664c7","resolution":{"observed_at":"2026-08-15T23:42:13.880142Z","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-15T23:42:13.884396Z","title":"Binary codes capable of correcting deletions, insertions, and reversals,","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.884396Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:838f4afbeaba0b6c831c1ab58362c83c179de9c7e7cf8238c86a1011ef2181b6","observation_id":"74ff596b-fcbb-48b2-9d09-a9920977a793","resolution":{"observed_at":"2026-08-15T23:42:13.884396Z","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-15T23:42:14.570718Z","title":"Efficient reconstruction of sequen ces,","venue":null,"work_id":"aabbb442-4c36-4c53-b2c9-e1763365bef5","year":2001},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.888417Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:12156a99e8cb960e92de640946d7eca337e62d3c2f9dbf33997684720eb2e653","observation_id":"75dfc4ef-f60e-4fa1-993d-5f0eaf4cc565","resolution":{"observed_at":"2026-08-15T23:42:14.574689Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.557873Z","title":"Efficient reconstruction of sequen ces from their subsequences or supersequences,","venue":null,"work_id":"e90b7dff-7ad4-4a1a-9b0d-5cd0dd909a47","year":2001},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.892683Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:dfea8d7c61bf1455536550ad9d5002e3e22250c16bfea87c3107fd6609ba2254","observation_id":"e68287d1-7e53-487d-a952-ca0693cc249b","resolution":{"observed_at":"2026-08-15T23:42:14.562206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.544836Z","title":"Bounds for deletion/insertion cor recting codes,","venue":null,"work_id":"3b73a784-8665-4244-bf6f-58175b4e6f06","year":2002},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.896630Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:0a17e73a8888a5569eae41f40c7f23459f0d65701e6494ae58c8b8a749f7a627","observation_id":"59a7849d-2d02-4011-b6ba-2f66b72d4097","resolution":{"observed_at":"2026-08-15T23:42:14.549082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.532371Z","title":"Linial’s algorithm and systemati c deletion-correcting codes,","venue":null,"work_id":"86fd117c-c51a-4f15-bbd4-570cc412eb4c","year":2023},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.900665Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:20a099381dadea7ca24dfe097d4fb94f29d8e47b1b0797de47968a566554c9e1","observation_id":"bd750b5b-242a-4511-8aef-724a359a6aec","resolution":{"observed_at":"2026-08-15T23:42:14.536441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.519515Z","title":"Explicit construct ion of q-ary 2-deletion correcting codes with low redundancy,","venue":null,"work_id":"92299aed-647f-4631-b28c-54bc56c9f7db","year":2024},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.904552Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:78e775c6ce13c1b653236855bc9f5ff2af744017f4d71121a7eabae6050593b2","observation_id":"8195732e-2695-48b7-b52b-cd4ffb43bc42","resolution":{"observed_at":"2026-08-15T23:42:14.524095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.506745Z","title":"A new version of q-ary V arshamov-Tenengolts codes with more efficient encode rs: the differential VT codes and the differential shifted VT codes,","venue":null,"work_id":"94a4b78f-013d-49d8-a6d4-be008a34e3f3","year":2024},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.908919Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:ca567c45457c9d3cbba256ea36af90416908c120cfd94eb6477621bdf8c5533c","observation_id":"87bd1d1f-184f-452a-8e1e-88a27c1bd26e","resolution":{"observed_at":"2026-08-15T23:42:14.511032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.493729Z","title":"Random access in large-scale DNA data storage,","venue":null,"work_id":"5b0391b1-7237-496b-9cee-8913fe80e007","year":2018},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.913091Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:95c573c0cf3fa157f146fb62c94fa384724d1894579b2c56bee12f726d68ae18","observation_id":"6b81dd18-dc19-4ca9-b772-42b8868de7dd","resolution":{"observed_at":"2026-08-15T23:42:14.497967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.480612Z","title":"Sequence reconst ruction problem for deletion channels: a complete asymptot ic solution,","venue":null,"work_id":"6a611350-79ef-4b3d-97d8-4c90c0a255d4","year":2025},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.917133Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:4fde6af3fd1335f2c0c43dae668f6238bab4ac59a818583c234142ab1fc5609b","observation_id":"9a114cb6-e3c5-4ecf-ba9d-2724a05d9591","resolution":{"observed_at":"2026-08-15T23:42:14.485134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.11231","last_updated":"2024-01-20T13:46:16Z","snapshot_observed_at":"2026-08-16T14:25:55.935428Z","submitted_at":"2024-01-20T13:46:16Z","title":"Two-Insertion/Deletion/Substitution Correcting Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.11231","snapshot_observed_at":"2026-08-15T23:42:13.921038Z","title":"Two-insertion/deletion/substitu tion correcting codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.921038Z"},"links":{"cited_paper":"/paper/2401.11231","citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:82fac5c8676001a99001b7fe63eabc67b4e7b1083ef4c038e5a57b0911115c82","observation_id":"eb6402d9-e3e7-4535-9e3f-0b7b5ea58489","resolution":{"observed_at":"2026-08-15T23:42:13.921038Z","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-15T23:42:14.468040Z","title":"Exact re construction from insertions in synchronization codes,","venue":null,"work_id":"83c312cf-5bf7-47ef-a08b-bb45fb0afcfe","year":2017},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.925410Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:afc2489e51cb28c51a5524b34ecaa26f69ddfe38b9783cacd5ac8311732ac6ee","observation_id":"fb87dc34-f42f-4e0b-b01c-64fc3f783056","resolution":{"observed_at":"2026-08-15T23:42:14.472097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.455387Z","title":"Codes correcting a burst of deletions or insertions,","venue":null,"work_id":"50558ec7-f5a7-4d7c-8b77-c08768ac95a5","year":1971},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.929478Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:8c78bc6788c3a7656d5cdb9cc3ff2f8423ebb3f69f92ab54f2e3b5b41048191e","observation_id":"ac7a3e27-17ad-4da5-92a0-7d2f0d77a257","resolution":{"observed_at":"2026-08-15T23:42:14.459754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.442347Z","title":"On optimal k-deletion correcting codes,","venue":null,"work_id":"bee70923-255b-427e-8edd-819dc59bfff9","year":2021},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.933230Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:5adf6b999b256be50aaa6071c67ffe839a76122d1184cfb9aa50f99b15ac2f56","observation_id":"b9eead27-e759-4e5b-92a5-37b21966c6ac","resolution":{"observed_at":"2026-08-15T23:42:14.446436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.429172Z","title":"Optimal codes for the q-ary deletion channel,","venue":null,"work_id":"739a462c-7248-4491-9245-ffdb533b5c8f","year":2020},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.937174Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:031778ef7c5b1abe2c7b264c42dab7e500d5572548a449594541e4472d8a6a9d","observation_id":"77f7f0be-2693-439b-90f0-de64f6d24d86","resolution":{"observed_at":"2026-08-15T23:42:14.433659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.416676Z","title":"Syndrome compression for optimal redundancy codes,","venue":null,"work_id":"a279de92-9dcf-45f3-828c-56c39950820a","year":2020},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.941238Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:7286db2f83dc8747dd54bffa2d95a5cbbcdc863d51b2753be7585de93aed66a1","observation_id":"55a74e52-a8fc-4628-864c-cffcef930142","resolution":{"observed_at":"2026-08-15T23:42:14.420835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.403945Z","title":"Optimal systematic t-deletion correcting codes,","venue":null,"work_id":"09a77a5d-a9e1-4c73-b839-f260f7b8bd10","year":2020},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.945282Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:aedeb7379b17673dd3b219806b1d8e84062800883c48e85475f64aa3c84c4490","observation_id":"b0832b3c-2536-4cd6-8e67-72ec247737ec","resolution":{"observed_at":"2026-08-15T23:42:14.407951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.391232Z","title":"Two deletion correctin g codes from indicator vectors,","venue":null,"work_id":"fe103be9-cd87-4bfc-8b1d-dab400a620df","year":2020},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.949325Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:c363f7ef8b00f6d302760cc5919b06b41b6d5680e897d907ffd2838ac830f33c","observation_id":"5f7f1ae8-b690-4d70-b603-f64918957e4a","resolution":{"observed_at":"2026-08-15T23:42:14.395391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.378567Z","title":"Single-deletion single-substitution correcting codes,","venue":null,"work_id":"2fefeaeb-6a6b-47b4-a6d7-532c1c018f6e","year":2023},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.953427Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:1ad36aa94e0ac835daadc5e3fb76bcbaea10f111290ad3e62389e1433d442347","observation_id":"18ccc0db-4b5e-4a91-8e48-4007db203046","resolution":{"observed_at":"2026-08-15T23:42:14.382834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.364799Z","title":"Non-binary two-deletion correctin g codes and burst-deletion correcting codes,","venue":null,"work_id":"5a4a7f89-a14f-4a20-93f1-dc5a7083dc69","year":2023},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.957576Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:0f33cadca512bd264f96539a5d30772526f582067d038f127bb9300d075c508b","observation_id":"ea9039d0-34a7-42ce-9ef4-584ebfcaef2e","resolution":{"observed_at":"2026-08-15T23:42:14.369587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.351271Z","title":"List-decodable codes for single-deletion single-substitution with list-size t wo,","venue":null,"work_id":"a3a214d2-350a-4445-9afb-2bdca1130b46","year":2022},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.961474Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:30c7d11302c57954b9ace9689d5e63cef76eb59a78998cf7fc703f83cf916f52","observation_id":"512c741f-35c9-4839-ad88-88b3ba318cdc","resolution":{"observed_at":"2026-08-15T23:42:14.355555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.03833","last_updated":"2025-02-13T04:10:47Z","snapshot_observed_at":"2026-08-16T12:59:29.401060Z","submitted_at":"2025-01-07T14:43:15Z","title":"Sequence Reconstruction for the Single-Deletion Single-Substitution Channel","version":4},"cited_work":{"arxiv_id":"2501.03833","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.03833","snapshot_observed_at":"2026-08-15T23:42:14.081340Z","title":"Sequence Reconstruction for the Single-Deletion Single-Substitution Channel","venue":"cs.IT","work_id":"7af0af59-07da-42b8-a828-0b3a2beb079f","year":2025},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.965397Z"},"links":{"cited_paper":"/paper/2501.03833","citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:001eb4ff4007d72f1ddfc19c45fc865bea4b6f45934f8e2bef15b49ebb8ad87a","observation_id":"d6447a56-41ef-4900-bd49-14b9d4765e31","resolution":{"observed_at":"2026-08-15T23:42:14.086055Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.338116Z","title":"Systematic co des correcting multiple-deletion and multiple-substitut ion errors,","venue":null,"work_id":"1be4c037-ca9a-4a6b-b01c-e0f46de7da5a","year":2022},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.969809Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:081f49bbb2492e9a6e719c6b6fd6fed08dcdc269027febe9f9a347e39fa6803f","observation_id":"7f406f57-a9b7-4a73-9691-83c2abcc1a81","resolution":{"observed_at":"2026-08-15T23:42:14.342304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.324695Z","title":"Correcting Two-Deletion With a Consta nt Number of Reads,","venue":null,"work_id":"f2ad91b1-abc8-4964-8f6d-92a40e2b35d4","year":2023},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.974058Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:8468de706d519cc5669398a4dcb72b15171875aa14e60100fb926e8364f3cf4d","observation_id":"a6be511b-2108-4092-b8b2-2342dff1065a","resolution":{"observed_at":"2026-08-15T23:42:14.329174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.311665Z","title":"Binary codes for correcting two edits,","venue":null,"work_id":"ccb5629b-d098-4ee7-80b1-ff216bfbc351","year":2024},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.977992Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:57650b442b53795d7bee41c432ecaf31f73a796403ebf54113f80f31b55dd5c3","observation_id":"62d3cbb3-f0a9-499c-8b9b-d04d09719263","resolution":{"observed_at":"2026-08-15T23:42:14.315928Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.11754","last_updated":"2024-03-18T13:02:52Z","snapshot_observed_at":"2026-08-16T14:08:49.321646Z","submitted_at":"2024-03-18T13:02:52Z","title":"Bounds and Constructions of $\\ell$-Read Codes under the Hamming Metric","version":1},"cited_work":{"arxiv_id":"2403.11754","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.11754","snapshot_observed_at":"2026-08-15T23:42:14.061269Z","title":"Bounds and Constructions of $\\ell$-Read Codes under the Hamming Metric","venue":"cs.IT","work_id":"9ade8785-2fc5-44b3-a2c6-e80ca16b7ac1","year":2024},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.982582Z"},"links":{"cited_paper":"/paper/2403.11754","citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:b396e740b0181e9d3db671947bdf2fb34cbfd9d1bcede87dd3840bb0723d9091","observation_id":"9c1dfa4a-1d8c-4e54-9f0b-b9b2d4718baa","resolution":{"observed_at":"2026-08-15T23:42:14.067387Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.298334Z","title":"Codes for correcting a burst of edits us ing weighted-summation VT sketch,","venue":null,"work_id":"061f8ac0-d52c-469b-9ea0-3339b0c96d2e","year":2025},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.986780Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:34e5f0de6bf4e149b307970d824e5c585aa4824744fb0063f79dc7af92ec6838","observation_id":"39bb81e8-4a9f-4977-a110-551eacae9048","resolution":{"observed_at":"2026-08-15T23:42:14.302491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:13.990660Z","title":"Sequence reconstruction under single-burst-insertion/deletion/edit channel,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.990660Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:8c90a59ba87368211eafc73c59d9076d64533cc0a71e97a6d104e648abd4c36d","observation_id":"3a24383c-6b4a-4522-a90a-b3dfa64f2ca5","resolution":{"observed_at":"2026-08-15T23:42:13.990660Z","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-15T23:42:14.274976Z","title":"Nonbinary codes, correcting single deletion or insertion,","venue":null,"work_id":"abcbe99b-e290-41a8-a4b2-f81e876ceb1e","year":1984},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.994625Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:c9afa330d0ed041d07bdb937b064245bf58b00ba6c92bbe836d41106aba5b293","observation_id":"1cf2e51c-67e8-4ebd-bb75-954054d560a9","resolution":{"observed_at":"2026-08-15T23:42:14.279358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.261662Z","title":"Balanced reconstruction codes for s ingle edits,","venue":null,"work_id":"7d2eb4c5-7700-4fe3-9ca1-93735cff7c21","year":2011},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:13.998610Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:416e6ffc5556678fbc5d0399586e65f028cd88e795a1dabacf9423fb138784af","observation_id":"c9551129-7071-4296-bf69-3c3faea1b7ae","resolution":{"observed_at":"2026-08-15T23:42:14.265884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.147133Z","title":"DNA-based storage: trends and methods,","venue":null,"work_id":"298bdab2-3a06-4269-b8fb-5e7086d0a78e","year":2015},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:14.002425Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:39a8aef95c0e19bbda2d1203072fd9bb8a65f57f9c5ae4713256ff768cc6b90a","observation_id":"be6dbae7-a875-457e-8418-1fac231f7cc2","resolution":{"observed_at":"2026-08-15T23:42:14.252299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T23:42:14.134449Z","title":"Reconstruction of Seq uences Distorted by Two Insertions,","venue":null,"work_id":"b87df8bd-ab30-44fe-954f-f281a9270df6","year":2023},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:14.007166Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:c84d46c4007a1be5998837219e64731d7fa1930bd214214d88974162e23f3354","observation_id":"e332b547-7719-42a2-97e0-b6d50d8b46f5","resolution":{"observed_at":"2026-08-15T23:42:14.138537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-16T13:28:13.692508Z","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-15T23:42:14.010801Z","title":"Codes correct ing two bursts of exactly b deletions,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:14.010801Z"},"links":{"cited_paper":"/paper/2408.03113","citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:487637b3f77346c2f4a61aab2dfd843b28479e84d73ff75b00bb4e4f70d79687","observation_id":"43fa62a5-fc84-4e5a-8822-5efa638f0366","resolution":{"observed_at":"2026-08-15T23:42:14.010801Z","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-15T23:42:14.121655Z","title":"Sequence Reconstruction over 3-Deletion Channels,","venue":null,"work_id":"82f0e8f2-4f3a-4e89-9f40-ad2dc2db4326","year":2024},"citing_paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T23:42:14.014999Z"},"links":{"citing_paper":"/paper/2505.04232"},"observation_digest":"sha256:aea551344e270362a3b487049b13bbe172605c08bd9cfd0561cd5d88c21a7e69","observation_id":"fc796d55-f09c-44e7-b3c1-48bedafdeaae","resolution":{"observed_at":"2026-08-15T23:42:14.125700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.04232","last_updated":"2025-05-07T08:34:06Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-18T08:19:35.633446Z","submitted_at":"2025-05-07T08:34:06Z","title":"Binary Reconstruction Codes for Correcting One Deletion and One Substitution"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":2,"verified_fuzzy":39},"total_outbound_references":46},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 1 inbound Pith citation observation for arXiv:2505.04232."}