{"as_of":"2026-08-20T08:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:005e0febe67b17a6a6b40aca9259dafaf71ce0fefe4e2e81ac315f23ea78222a","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-16T12:04:19.282761Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2504.14035/citation-record","integrity":"/paper/2504.14035/integrity","json":"/paper/2504.14035/citation-record.json","paper":"/paper/2504.14035"},"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-16T12:04:19.679276Z","title":"Coding for deletion channels with multiple traces,","venue":null,"work_id":"fb5ac2d2-581c-4682-ae4d-ad6195128c83","year":2019},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.194794Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:967c823e6ee701422e30f5b897460d7e294157ff28c9e4bfdcb352fa9d741aac","observation_id":"c191d855-4ac6-41bc-83f3-51caefa2a2d6","resolution":{"observed_at":"2026-08-16T12:04:19.682685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.669398Z","title":"On the embedding capacity of DNA strands unde r substitu- tion, insertion, and deletion mutations,","venue":null,"work_id":"a26119cc-0ea4-4857-8d63-f5ff0d2b81fa","year":2010},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.198825Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:b8212a8dcbe5e0c7564f4b19f021704c0006e1f8af5601992f7012a8daf831f6","observation_id":"9381d9a4-b47a-4b55-885d-34da04c10c83","resolution":{"observed_at":"2026-08-16T12:04:19.673126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.660022Z","title":"A characterizati on of the DNA data storage channel,","venue":null,"work_id":"7cf274d9-7569-4b7e-8067-59990131f682","year":2019},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.202413Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:ac61e349f69c935ca3f61fbcf9cec552cfa060873c261c64efb9d46eb743e545","observation_id":"a318bd66-5399-47ca-a710-81dc87abfd22","resolution":{"observed_at":"2026-08-16T12:04:19.663326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.650206Z","title":"Co ding over sets for DNA storage,","venue":null,"work_id":"c970ae8f-0c8f-43a2-b78d-8318638a15c3","year":2019},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.206145Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:dd7cdf2c97718563fd1e1be4d13f6468108129d0764c9e3c5b10ebabedc74c3c","observation_id":"cc16caa0-1f55-415a-bc3e-c1c7c07e7524","resolution":{"observed_at":"2026-08-16T12:04:19.653548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.640801Z","title":"Coding and signal processing for ultra-high density magne tic recording channels,","venue":null,"work_id":"a2987a2a-7a32-419b-a9a4-8bec10750806","year":2014},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.209897Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:556d3ca8acf5dc842db172cbdf0c2f8404e71b3ef6731b8d7799012a9a795ea8","observation_id":"381f5aee-4553-4456-bb0f-37c50ea01a05","resolution":{"observed_at":"2026-08-16T12:04:19.644271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.631333Z","title":"Efficient reconstruction of sequenc es,","venue":null,"work_id":"5320998a-2f95-4f27-a1f9-63d55b08ef00","year":2001},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.214064Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:907ec933d7e0d251e4feccd5958ca1ffd73c05c4ae43226ef9764f83aa26c486","observation_id":"c1a66f3f-556a-4d0a-8384-808c8840951d","resolution":{"observed_at":"2026-08-16T12:04:19.634508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.620572Z","title":"Shannon’s theorems for channels with s ynchronization errors,","venue":null,"work_id":"e0370d67-58e0-4f28-a5ce-835735d07d2d","year":1967},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.218506Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:08a49ac0f44c28ab960bad2b73694832b5e5b6fd8da6f51b0969ca927353a07a","observation_id":"1a06dfd9-5c6f-4e3e-8e88-db31c1104d4f","resolution":{"observed_at":"2026-08-16T12:04:19.624735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.610438Z","title":"A mathematical theory of communication,","venue":null,"work_id":"138adc2e-6ded-4865-88d9-87816f613624","year":1948},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.221817Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:1ae0ca583894d2f9e90a95d201a71c2bae9c9b25f6e7c94b410302e9c8051dbe","observation_id":"04083f79-43c6-4949-8d4d-d2a12e7237db","resolution":{"observed_at":"2026-08-16T12:04:19.613977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.600341Z","title":"On the capacity of channels wi th Markov insertions, deletions and substitutions,","venue":null,"work_id":"2a1943d2-32e1-4788-a133-d26208c0f9c9","year":2024},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.224897Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:5be7612e152316839f0d28067bfbad7a4e720655ae33ce8acae23077ea3a666c","observation_id":"aa659f72-0681-49de-a2f9-1437322de4c0","resolution":{"observed_at":"2026-08-16T12:04:19.604078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.16063","last_updated":"2026-04-11T10:27:22Z","snapshot_observed_at":"2026-08-03T00:36:25.798577Z","submitted_at":"2024-01-29T11:18:29Z","title":"Channels with Markov Synchronization Errors: Information Stability and Capacity Bounds","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.16063","snapshot_observed_at":"2026-08-16T12:04:19.228370Z","title":"Shannon capacity of channels with Markov insertio ns, deletions and substitutions,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.228370Z"},"links":{"cited_paper":"/paper/2401.16063","citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:dd0717bb34c56ec0cc26af788bce9501d8c4e24d62af08c31f02b125ae8a2fb8","observation_id":"0a535b47-3c80-4ce6-a550-4b4e215b273f","resolution":{"observed_at":"2026-08-16T12:04:19.228370Z","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-16T12:04:19.591037Z","title":null,"venue":null,"work_id":"ef50a876-b200-472d-a0e2-6181e917d22b","year":2000},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.232051Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:1c2d226559b1ee6705949fb5adeba59c80acbc9971199df0bcceea57ae0722ef","observation_id":"c2d827b2-5cc9-4ebd-9297-a8c41b0abdb4","resolution":{"observed_at":"2026-08-16T12:04:19.594189Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.580604Z","title":"Sequential decoding for a binary chann el with drop- outs and insertions,","venue":null,"work_id":"b6c43892-290a-4dff-9b55-54a582d18693","year":1969},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.235133Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:6af64f34a7fbb5ad681cb0413db90367735cd0b7f23d27428d7eeca792238349","observation_id":"439c7f41-8561-4345-8c08-d1f0388703d3","resolution":{"observed_at":"2026-08-16T12:04:19.584766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.570414Z","title":"A simple lower bound for the capacity of the deletion channel,","venue":null,"work_id":"9fa4c393-a25b-43db-affa-24b0f9f965b5","year":2006},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.238520Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:39a344044d0fc283d7bfd38bdf6002c23b414a91d52973cfc6e72df71a792887","observation_id":"b0f84401-22ab-49d2-be76-2d1d3db74076","resolution":{"observed_at":"2026-08-16T12:04:19.573912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.560975Z","title":"Directly lower bounding the in formation capacity for channels with iid deletions and duplications,","venue":null,"work_id":"50e7eada-616d-4f36-8fd7-451ce1d73af6","year":2009},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.242544Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:7252d13b5020c74e080a35ea3f6dcd5a2b2a10ad9f6f162394eff96f22c0a53e","observation_id":"601c93cb-6b7c-41b3-8383-64c03ad4ca4e","resolution":{"observed_at":"2026-08-16T12:04:19.564187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.551683Z","title":"Capacit y upper bounds for the deletion channel,","venue":null,"work_id":"ddd93fe4-f096-407a-b1d2-d5d9ed4b692c","year":2007},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.245919Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:7fa3d71e60056f3f2a9c3e61e8db599e271e22fb95b8a45c6a3ea0e19c550550","observation_id":"a6656d3b-78ad-41d9-9824-41a38f7e377e","resolution":{"observed_at":"2026-08-16T12:04:19.555050Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.540813Z","title":"Novel bounds on the capaci ty of the binary deletion channel,","venue":null,"work_id":"f4e7b088-a315-4fdd-a264-181268fa5e7d","year":2010},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.249201Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:e82abcbb78bb4f7ec712d25145ec0c04cd65f4139e5fcaf0e7e098740ee3b72a","observation_id":"cf3e87ef-f776-4cc7-aca2-2d6ac354ff00","resolution":{"observed_at":"2026-08-16T12:04:19.544362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.531140Z","title":"An upper bound on the capacit y of non-binary deletion channels,","venue":null,"work_id":"27b34af0-72d5-4bc1-9e9a-e1da706e766f","year":2013},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.252292Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:ebb1ca2cff83d80d3a8d99d1a78e719a1e8d69f85a2a4057f6d5dc6a0ab00c5d","observation_id":"f7050d8b-ab62-4cdf-9bc8-e0db08da3bd6","resolution":{"observed_at":"2026-08-16T12:04:19.534534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.521697Z","title":"Bounds on the capacity of channels with insertions, deletions and substitutions,","venue":null,"work_id":"854ca7ae-b7ce-4b89-8044-2ea19ad0d1d5","year":2010},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.256184Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:68d1c9cf53c1477dd89100dfe972e91b528236201d3788603fb48c0ed2a9e6c3","observation_id":"fed541bf-1b4e-409d-a264-41c79a08d2a6","resolution":{"observed_at":"2026-08-16T12:04:19.525219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.511400Z","title":"Capacity upper bounds for deletion-ty pe channels,","venue":null,"work_id":"61a07a6a-10d8-4ec9-a848-b216ae742d8b","year":2019},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.259385Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:c89b1488a50486e087db097d57e37708aadcbc1ff219e74509ad26035465aaa2","observation_id":"5d42ee69-92ef-4fef-b762-9689b3f802c1","resolution":{"observed_at":"2026-08-16T12:04:19.514951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.500565Z","title":"An overview of capacity r esults for synchronization channels,","venue":null,"work_id":"aec05acf-b7a5-471a-9cb1-dab056af3b05","year":2020},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.262491Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:db948dbf13da4cbbaf08c52fd2e13008a382b19d9ab31e27c5b3679f786529a3","observation_id":"2e067150-86d9-4af9-b3fa-e78cce389696","resolution":{"observed_at":"2026-08-16T12:04:19.504485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.489086Z","title":"Tight asympto tic bounds for the deletion channel with small deletion probabilities ,","venue":null,"work_id":"4e94d2d3-f222-40f2-8c12-4e655d410288","year":2010},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.266031Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:695b22221d3931ce8ec5483277d4d4a3aaa3494e7e883a685815b675afdde1e2","observation_id":"1eaa4327-f80a-40ec-940b-cbafe6254022","resolution":{"observed_at":"2026-08-16T12:04:19.492955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.478313Z","title":"On the deletion channel wi th small deletion probability,","venue":null,"work_id":"663027ac-cfb0-43d1-a348-917587f0e816","year":2010},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.269224Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:06e454713fcaa2a209c39cacf4e388370f02863cee7cfc8337fe0f3b71c82665","observation_id":"8c38c6a0-bac3-4d3a-af07-9eb19f5158bf","resolution":{"observed_at":"2026-08-16T12:04:19.482189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.466644Z","title":"Optimal coding for the binary deletion channel wit h small deletion probability,","venue":null,"work_id":"fcda7ded-10b1-4fd4-8842-3346e8c98949","year":2013},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.272497Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:8c8e8e881d374d7436d3769d0c7811d8c240db794c3a1f240ae43a4dc291f8e3","observation_id":"e2eab018-8d20-4870-9006-a658ca675db0","resolution":{"observed_at":"2026-08-16T12:04:19.470665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.454742Z","title":"On the capacity of duplica tion chan- nels,","venue":null,"work_id":"8d1d54f7-5395-46eb-a39d-ae0ed9a410b3","year":2013},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.275868Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:33be10d015db79fba48b4edf88d9123aad83a2e34649ac03ad6df82afb56bfb7","observation_id":"bef04de5-b661-4545-9213-2bfe2a1965d8","resolution":{"observed_at":"2026-08-16T12:04:19.458781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-16T12:04:19.442438Z","title":"Capacity bounds for sticky channels ,","venue":null,"work_id":"efe18aec-1d4b-4bde-9d43-06534bd76d14","year":2008},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.279680Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:537598f4a7961bdfa2a66b4fdedd62d53672851b32b7d272883a8e202984453d","observation_id":"4abea217-80e7-48a8-b084-cd9cca8b0f39","resolution":{"observed_at":"2026-08-16T12:04:19.446485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2411.14771","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:04:19.414143Z","title":"Capacity approximations for i n- sertion channels with small insertion probabilities,","venue":null,"work_id":"5a1e3953-e998-4733-b014-73b485fb07ee","year":2024},"citing_paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T12:04:19.282761Z"},"links":{"citing_paper":"/paper/2504.14035"},"observation_digest":"sha256:88fe2e352abfb2670e9db718a5bf3c6ba230b9ec90053f230c5a8d8695b167b5","observation_id":"0789bb1f-002f-4e7a-a54d-372297b17fb3","resolution":{"observed_at":"2026-08-16T12:04:19.421865Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.14035","last_updated":"2025-05-11T16:15:09Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-20T04:53:07.372338Z","submitted_at":"2025-04-18T18:54:10Z","title":"On the Capacity of Insertion Channels for Small Insertion Probabilities"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":23},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2504.14035."}