{"as_of":"2026-08-08T13:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3048cec45ac7e5daf2a1e9d81d7449c8d75c5a964f7d2fef2dba2b8e1182823b","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:40:17.571918Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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-08-05T18:55:19.467668Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T00:16:16.768632Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","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:d7d0710235fc57c175cd7596ddcf1f8aa9eb2c01929776b67bed0ff951662c1b","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.07609/citation-record","integrity":"/paper/2506.07609/integrity","json":"/paper/2506.07609/citation-record.json","paper":"/paper/2506.07609"},"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-07T05:40:17.939264Z","title":"Efficient low-redundancy codes for correcting multiple deletions,","venue":null,"work_id":"823786df-5afc-4de7-a8fe-8277a18574a6","year":2018},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.470968Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:1c0142ac9a7c97ceae30f364dca1cbb53456d0e66ad5f9b0bf6a1a4a6b5cddad","observation_id":"bc5c45f2-fba4-4baf-a968-2fa1c31e0352","resolution":{"observed_at":"2026-08-07T05:40:17.943847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T05:40:17.924881Z","title":"Correcting a single indel/edit for DNA-based data storage: linear-time encoders and order-optimality,","venue":null,"work_id":"b4ee5c9c-b04e-47fb-ba2c-16319a839d6b","year":2021},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.475560Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:83fec0cf7a273012437327aa214df863074ec272bfb4daa5f45285a1a358deda","observation_id":"e5787b88-7a22-4b5b-9d84-abd4d92a06c1","resolution":{"observed_at":"2026-08-07T05:40:17.928898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T05:40:17.911108Z","title":"Beyond single-deletion correcting codes: substitutions and transpositions,","venue":null,"work_id":"6e0d1dad-3f69-4c65-b9da-e4055bd5309f","year":2023},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.479633Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:3fe4053cc58c3749a4190590464dc26e08933cc7ec12dcbefa32a33cb6cf48c6","observation_id":"debd0399-a303-4aa5-a231-ed22afc59f17","resolution":{"observed_at":"2026-08-07T05:40:17.915546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T05:40:17.897506Z","title":"Explicit two-deletion codes with redundancy matching the existential bound,","venue":null,"work_id":"7a48525e-6bca-4f7a-a977-d98ebce82c63","year":2021},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.483922Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:6d591ea4d31e77e429cc3242a073d85260711559285706d39ca2f0b0c7a49f99","observation_id":"f0cce9c1-af2f-435d-af02-9b71cd59f96c","resolution":{"observed_at":"2026-08-07T05:40:17.901623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T05:40:17.884412Z","title":"Codes correcting two deletions,","venue":null,"work_id":"4f7d5c85-bd7a-4e16-9047-9616616cdef4","year":2019},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.488450Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:5f2195264e0d395edc7cb68f095807972d0bcdd79ab13ba96e9149898a7dc0fd","observation_id":"eb9a7006-888d-4318-9d77-1cd55f692a0f","resolution":{"observed_at":"2026-08-07T05:40:17.888497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T05:40:17.870719Z","title":"Codes in the Damerau distance for deletion and adjacent transposition correction,","venue":null,"work_id":"5f36a5fc-5a48-4a57-837b-f6dba9ddbb7c","year":2018},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.492459Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:77f9595f5b96a9804de091da82d865cd24b30cf892a430b748b7add94d30ca71","observation_id":"cdd717b5-66c9-43c2-9291-95b7964b66b7","resolution":{"observed_at":"2026-08-07T05:40:17.874780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T05:40:17.497145Z","title":"Binary codes capable of correcting deletions, insertions, and reversals,","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.497145Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:d645b89fb19721155a90d2209ec093197394b138d6d76157562f06bb1386dcf6","observation_id":"b18909d9-3770-44de-92b4-dfc95f277553","resolution":{"observed_at":"2026-08-07T05:40:17.497145Z","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-07T05:40:17.848433Z","title":"Asymptotically optimum binary code with correction for losses of one or two adjacent bits,","venue":null,"work_id":"d54558e2-8228-42f8-9502-033b54b713f6","year":1970},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.500779Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:e110c55635a6d0c0d3e1ba467ccd2080491adb99e34acc1a3a6f38a5c21a3136","observation_id":"8c2560b5-5f4c-4ee9-a592-81d9f0accdf5","resolution":{"observed_at":"2026-08-07T05:40:17.852639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T05:40:17.833470Z","title":"Linial’s algorithm and systematic deletion-correcting codes,","venue":null,"work_id":"5bce08ed-77ae-46c2-900d-456b916de881","year":2023},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.504409Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:d5074ad35d83e5cd92ab4abd86e4f0699c4e23d7adddd062036a9dc1dd70f0fd","observation_id":"78ce8a03-e47b-4332-b7bf-993770a85a1f","resolution":{"observed_at":"2026-08-07T05:40:17.838203Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T05:40:17.818249Z","title":"Explicit construction ofq-ary2-deletion correcting codes with low redundancy,","venue":null,"work_id":"47bbaada-ad43-4c54-af54-fa2115f6b430","year":2024},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.507823Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:b8c049e9e3b7bdded7f567e04333f3d1ac96d118626940caa9def8ae30d044cd","observation_id":"7727eed8-14ab-4192-b77a-fdc6b3d20715","resolution":{"observed_at":"2026-08-07T05:40:17.822562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T05:40:17.804259Z","title":"A new version ofq-ary Varshamov-Tenengolts codes with more efficient encoders: the differential VT codes and the differential shifted VT codes,","venue":null,"work_id":"bfb10fb8-a295-4e1b-98b4-7a10e511f399","year":2024},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.512011Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:ed9cd44fb8a7cc148e418b37f6be223f4faac3c08d936ed12dcb60308129dcdc","observation_id":"0dc97af4-f228-4577-8cdf-fb1bd2ef8335","resolution":{"observed_at":"2026-08-07T05:40:17.808700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T05:40:17.790863Z","title":"Random access in large-scale DNA data storage,","venue":null,"work_id":"6fb79915-bdfb-473d-af58-e706438d4bb9","year":2018},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.515905Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:369588df810e6003109d13397ba0b816655e923502fc647729c23b54cb0b4f04","observation_id":"812ce042-4d8d-4eaf-9f02-c457ceab8e51","resolution":{"observed_at":"2026-08-07T05:40:17.794842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-04T06:29:40.611109Z","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-07T05:40:17.520288Z","title":"Two-insertion/deletion/substitution correcting codes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.520288Z"},"links":{"cited_paper":"/paper/2401.11231","citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:8a2bd31b8bb16f6f5272fb0b75c5e0bb26cf93e677acc1e38afd381eb261dfb4","observation_id":"d464a71e-ee0a-4572-af26-76eebab9e39d","resolution":{"observed_at":"2026-08-07T05:40:17.520288Z","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-07T05:40:17.777673Z","title":"Non-binary two-deletion correcting codes and burst-deletion correcting codes,","venue":null,"work_id":"d0096c00-91be-4f36-b3c7-1335df2a91f8","year":2023},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.524473Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:02ee25b07d33a1a621f44e9227d5e1388f0d742c90adb3fcfaf33c6759341e5e","observation_id":"d10ec62e-3f09-4c26-b79a-cd5bab412a75","resolution":{"observed_at":"2026-08-07T05:40:17.781687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T05:40:17.763135Z","title":"On optimalk-deletion correcting codes,","venue":null,"work_id":"04f30e81-be9e-4feb-a2c4-f6795289c247","year":2021},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.528404Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:05b6394853a88adb896bc03001fecb9cfcbfe02896ec82d99b2e869453eaa670","observation_id":"962aa529-8846-4332-b313-de688536e9ca","resolution":{"observed_at":"2026-08-07T05:40:17.767654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T05:40:17.532302Z","title":"Binary codes for correcting two edits,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.532302Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:a987e38dec16cd939114a7122ce247d1c986d6e3163ece0caa7350ba8ffb2f2c","observation_id":"7a8f710f-cb39-4ef6-92e7-48f2071e2d27","resolution":{"observed_at":"2026-08-07T05:40:17.532302Z","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-07T05:40:17.738273Z","title":"Codes for correcting a burst of edits using weighted-summation VT sketch,","venue":null,"work_id":"5602a756-0332-4753-9c4c-c3250697661c","year":2025},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.536111Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:a8bb960f6fc016efa10e5db073bd656e8c36327246a05e697f3b0258707ea2ce","observation_id":"19df4a03-fc0e-4bec-a9df-8d7de425636d","resolution":{"observed_at":"2026-08-07T05:40:17.743304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T05:40:17.723560Z","title":"Optimal codes for theq-ary deletion channel,","venue":null,"work_id":"4be7b700-8f77-4126-a07f-1f0f90374e40","year":2020},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.539820Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:c0121e37f508e774c72b9a64152bb232b3fb6ece9b056199353c4410686afeaf","observation_id":"89b74d18-48a8-4d93-b934-802e48ab6f78","resolution":{"observed_at":"2026-08-07T05:40:17.727681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T05:40:17.709938Z","title":"Syndrome compression for optimal redundancy codes,","venue":null,"work_id":"4679f17a-cdfa-4cf9-a17a-07561cd2543c","year":2020},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.543520Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:a1203aaff97d67b31e7000a14f946b699298106a5ad8807faeb591c5e23406a9","observation_id":"0898dcec-1d06-40e8-9dc2-680303b59e8f","resolution":{"observed_at":"2026-08-07T05:40:17.714098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T05:40:17.695666Z","title":"Optimal systematict-deletion correcting codes,","venue":null,"work_id":"f85709de-74a8-4d42-8d12-8eb5b07b05e5","year":2020},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.547363Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:ecee51b85a0e32281f7f3c65b9f78f01d0be398e2d7eef08ea0d402ca2228995","observation_id":"dc7d619d-2d07-471e-9dff-fd32e02740fd","resolution":{"observed_at":"2026-08-07T05:40:17.700567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T05:40:17.681927Z","title":"Systematic codes correcting multiple-deletion and multiple-substitution errors,","venue":null,"work_id":"0f0b8ab4-3e31-4708-a99a-2c4d20561c40","year":2022},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.551594Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:fc5847291a955deef1e0331e54886f85e65117c22afcf5cc857e8aa882b97700","observation_id":"f126ead6-3a98-4466-aa8f-b81afbc05f79","resolution":{"observed_at":"2026-08-07T05:40:17.686200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T05:40:17.667904Z","title":"Two deletion correcting codes from indicator vectors,","venue":null,"work_id":"4c5a2520-809b-4424-8e99-4a2da58783ed","year":2020},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.555106Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:030cd2108506e265058541f840b2d8b21373e836aef55b9f7bd77cbf0f7f7d21","observation_id":"b5adf155-bb5a-43d3-b271-f4a1911ce6fc","resolution":{"observed_at":"2026-08-07T05:40:17.672067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T05:40:17.558824Z","title":"Single-deletion single-substitution correcting codes,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.558824Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:f7567e2cc1775cd8e0b762feabc332d79e1a869c938af8ecf2e9e8f5f000c794","observation_id":"92dce8c2-30e1-4448-b02a-6d9c330d1733","resolution":{"observed_at":"2026-08-07T05:40:17.558824Z","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-07T05:40:17.641931Z","title":"Nonbinary codes, correcting single deletion or insertion,","venue":null,"work_id":"8370f207-41b5-4968-bd5d-543ebe405695","year":1984},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.562427Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:22356b3bf831c1f28164a7c4031a7e7dc6d7f8fa962209960eef74c1d64994f6","observation_id":"558c7b62-f987-47eb-9a9d-2a8bbe905d3f","resolution":{"observed_at":"2026-08-07T05:40:17.648037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T05:40:17.567744Z","title":"DNA-based storage: trends and methods,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.567744Z"},"links":{"citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:ab0bd81d0854d49a527d0f6e4834c2d4d2127189e745c791bdf635a144532ccb","observation_id":"3d97bf55-bf56-46f8-8deb-97851a8ffb61","resolution":{"observed_at":"2026-08-07T05:40:17.567744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03113","last_updated":"2025-09-07T02:25:34Z","snapshot_observed_at":"2026-08-03T09:09:44.609824Z","submitted_at":"2024-08-06T11:38:57Z","title":"Codes Correcting Two Bursts of Exactly $b$ Deletions","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03113","snapshot_observed_at":"2026-08-07T05:40:17.571918Z","title":"Codes correcting two bursts of exactlybdeletions,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T05:40:17.571918Z"},"links":{"cited_paper":"/paper/2408.03113","citing_paper":"/paper/2506.07609"},"observation_digest":"sha256:b91007624f582462c298e55c9dd42995f7780bd2fdf1b278c1fde669c25683a0","observation_id":"380e479e-35f0-4032-b067-fe0f378d50df","resolution":{"observed_at":"2026-08-07T05:40:17.571918Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.07609","last_updated":"2025-06-09T10:14:36Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-07T05:27:24.339843Z","submitted_at":"2025-06-09T10:14:36Z","title":"Correcting Errors Through Partitioning and Burst-Deletion Correction"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":20},"total_outbound_references":26},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 1 inbound Pith citation observation for arXiv:2506.07609."}