{"as_of":"2026-08-20T04:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ca77eb7951374e17e122e9973be6b9968e4a218a346603bb3051f23219328f15","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T12:22:30.473567Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2607.28281/citation-record","integrity":"/paper/2607.28281/integrity","json":"/paper/2607.28281/citation-record.json","paper":"/paper/2607.28281"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1049/el:19930096","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Capacity per unit cost of a discrete memoryless channel,","venue":"Electronics Letters","work_id":"7740c615-d57f-4eea-b37a-7e94db704aa5","year":1993},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.390563Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:b1f205a66a34bb45b5ad5d9ddd3311daaef3b4013f084a1ec02f48a336f80403","observation_id":"12531096-3d70-4f2e-9385-8eb78b7afcc3","resolution":{"observed_at":"2026-07-31T12:26:29.505631Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-08T21:38:13.024362+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T21:38:13.024362+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-31T12:22:30.394829Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.394829Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:1d4e0d4c83198bef77f3479f84c23f8e8c55639341de55a721c7bfab37080b53","observation_id":"fdcd65f4-fab1-4924-8709-40b8622faa15","resolution":{"observed_at":"2026-07-31T12:22:30.394829Z","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":"10.1145/3281275","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Capacity upper bounds for deletion-type channels,","venue":"Journal of the ACM","work_id":"654de61e-9c41-43a3-a94a-b13c3cc9a0b3","year":2019},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.398171Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:1c86a3ac5457da1186b1635915941312bea52952aad2ad98744b2663537304de","observation_id":"d25aaf3c-4a04-4391-94dc-27b2afc1b039","resolution":{"observed_at":"2026-07-31T12:26:29.348076Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-08T21:38:13.158855+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T21:38:13.158855+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-31T12:22:30.402115Z","title":"Sharp analytical capacity upper bounds for sticky and related channels,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.402115Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:b499b241f8443dccffdbef84e6123892ce97f362608bc29f3a3fba470bf46304","observation_id":"68aaa559-af8a-4ed0-91c6-9edb52a04fa0","resolution":{"observed_at":"2026-07-31T12:22:30.402115Z","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-07-31T12:22:30.405154Z","title":"An overview of capacity results for synchronization channels,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.405154Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:e378b61e53553a2d31bd221eb4e8d5d7a1f58db653f9b148c80d16c21bccdbf2","observation_id":"b8ee8e92-6939-40e8-b87b-bb5e0c20dc5c","resolution":{"observed_at":"2026-07-31T12:22:30.405154Z","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":"10.1007/0-8176-4477-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Birkhäuser-Verlag eBooks","work_id":"c0b99a77-8d49-425c-a520-d0deb18b88f4","year":2006},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.408094Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:c0a1b64bc4e1f9d316c9cbc7659e1597edec1746fd28deaa63f2bb497e29d5ec","observation_id":"c062ece5-d88e-4db3-af2c-df06a060fb0d","resolution":{"observed_at":"2026-07-31T12:26:29.148572Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-08T21:38:13.212661+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T21:38:13.212661+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0139020","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The generalized negative binomial distribution and its characterization by zero regression,","venue":"SIAM Journal on Applied Mathematics","work_id":"d5cc63f6-3264-43d8-b57e-d2a6d74b50a5","year":1980},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.411530Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:078d72900df3c591294ca930f1dcec90404b0f35128e5ed82646a4c14a6e8dc1","observation_id":"ac47f84d-3edf-43fa-90f8-7b8d6663115d","resolution":{"observed_at":"2026-07-31T12:26:28.967292Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-08T21:38:13.27342+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T21:38:13.27342+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0123026","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Use of Lagrange expansion for generating discrete generalized probability distributions,","venue":"SIAM Journal on Applied Mathematics","work_id":"2089c4ba-2032-41c3-9498-fa8ab674b18b","year":1972},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.414532Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:37818e6126cd7504410a4d2e0f99f8d71d2628ea05019ceb0644abe8132cd490","observation_id":"b2a82472-d0e7-4e77-bd81-ac9b575a2c15","resolution":{"observed_at":"2026-07-31T12:26:28.773422Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-08T21:38:13.333969+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T21:38:13.333969+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-31T12:22:30.417395Z","title":"Csiszár and J","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.417395Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:9fed1c8b38e59874dccab4d69b163c8b0d97d60044b9d36a65e243eb1885e4a6","observation_id":"798d1874-05d0-4d08-956d-f6c953d0d994","resolution":{"observed_at":"2026-07-31T12:22:30.417395Z","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-07-31T12:22:30.420260Z","title":"Shannon’s theorems for channels with synchronization errors,","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.420260Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:00fa328956e44e24f12e89d454ea625b0fbc4ff25f306f85ca3a615b55757b18","observation_id":"b5bb0418-85cf-43cc-bb2c-b36f8d7a3d89","resolution":{"observed_at":"2026-07-31T12:22:30.420260Z","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-07-31T12:22:30.423897Z","title":"Improved lower bounds for the capacity of i.i.d. deletion and duplication channels,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.423897Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:98049626adb9ecf7e4b64c5f419209a3874e2f3c8c2bb7bd91a0b0fb9456414f","observation_id":"dd23d17a-d9c1-48a3-b296-d7f8d6b3ecca","resolution":{"observed_at":"2026-07-31T12:22:30.423897Z","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":"10.2307/3212112","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The total progeny in a branching process and a related random walk,","venue":"Journal of Applied Probability","work_id":"d04d9cf3-96e6-430d-b132-211a50fb2497","year":1969},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.426989Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:d6ef01d24baec119b6a64c7227295315c73661802eb3bedf893bbc6985301087","observation_id":"cb4fca88-93d4-4baf-ab1b-98eca1d17a5c","resolution":{"observed_at":"2026-07-31T12:26:28.635116Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-08T21:38:13.447863+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T21:38:13.447863+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-31T12:22:30.430002Z","title":"Flajolet and R","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.430002Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:3fd89f8e16fdad798e5050a50a96845f67b4a053444500ed5a0f101963a9e4b7","observation_id":"611f772b-39e0-44ab-b01d-ad12162a5d63","resolution":{"observed_at":"2026-07-31T12:22:30.430002Z","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":"10.1137/0128022","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The Lagrange distributions and branching processes,","venue":"SIAM Journal on Applied Mathematics","work_id":"48d0c6f7-c8fb-40fa-880a-4ad3dac86d44","year":1975},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.432938Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:50ce2693e6bf54838d8cedf569785386e6c1ae623457ce55081c31dabe5589d7","observation_id":"55e308a9-3471-43ef-98e5-0058720103e4","resolution":{"observed_at":"2026-07-31T12:26:28.381931Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-08T21:38:13.564325+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T21:38:13.564325+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-31T12:22:30.435687Z","title":"On the capacity of channels with timing synchronization errors,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.435687Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:70b1a9da440a6aec6c2d07c6c1d6406d7b7bcf22a1e793b380330102c4d0f338","observation_id":"fccb0dc4-505f-4ff6-88be-5b72143a9119","resolution":{"observed_at":"2026-07-31T12:22:30.435687Z","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":"10.1137/0121056","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A generalized negative binomial distri- bution,","venue":"SIAM Journal on Applied Mathematics","work_id":"18a2c449-96f2-4d6f-aa32-6b7053a8a7f7","year":1971},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.438450Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:603ea9db3f2ab75234aff4a940a9e4939dd24e7ec46843747b924a75842c6ab0","observation_id":"40362773-4442-44e9-8f7e-95a9c7fadb14","resolution":{"observed_at":"2026-07-31T12:26:28.238121Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-08T21:38:13.621279+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T21:38:13.621279+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-31T12:22:30.441208Z","title":"Duplication-correcting codes for data storage in the DNA of living organisms,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.441208Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:fcc3db8fb5337b1e03ba81e7afa648b47ff8ecfe9132eac05e024b5012feb80b","observation_id":"f67092d5-0b25-4f14-a5d4-f5875240f3f4","resolution":{"observed_at":"2026-07-31T12:22:30.441208Z","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-07-31T12:22:30.443798Z","title":"Capacity bounds for the Poisson-repeat channel,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.443798Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:093c0068a426816ebd530f820ff7e3010ad6019a22c9a7d6d711a97ee75418ea","observation_id":"644dd935-c053-40eb-a742-be93f78be56a","resolution":{"observed_at":"2026-07-31T12:22:30.443798Z","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-07-31T12:22:30.446251Z","title":"Directly lower bounding the information capac- ity for channels with i.i.d. deletions and duplications,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.446251Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:513eab6dc59c53197696f1b7112beaf2db6cf0729c57655d04fa534f48cd76fe","observation_id":"a0ce0508-5f01-41ca-bdf2-7655e0537d7b","resolution":{"observed_at":"2026-07-31T12:22:30.446251Z","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-07-31T12:22:30.448771Z","title":"Zero-error capacity of duplication channels,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.448771Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:99d985ce7d8b295892b704524501cb7c6dc86fb6c9528c6533db65578da796d4","observation_id":"e2f0e464-8980-4adb-b5f8-ba8ab9d1fa74","resolution":{"observed_at":"2026-07-31T12:22:30.448771Z","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":"10.1134/s0032946022020028","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the maximum number of non-confusable strings evolving under short tandem duplications,","venue":"Problems of Information Transmission","work_id":"9b72a838-e106-4a7c-9202-fa5c5980c3d1","year":2022},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.451396Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:70b38f84a8bd8a43c29bdf2cf343a8c266abd89fda318021f0e0c3d96781bfad","observation_id":"ef1fecd4-195e-4e58-b03f-a36831dac262","resolution":{"observed_at":"2026-07-31T12:26:28.091881Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-08T21:38:13.67262+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T21:38:13.67262+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-31T12:22:30.454386Z","title":"Bounds on the capacity of discrete memoryless channels corrupted by synchronization and substitution errors,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.454386Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:ff42418d3d6a1bebd77022b909d2937a914adb572886b78a2a581b25995ce55c","observation_id":"1b1065e9-802e-4fd5-8732-835957cf307c","resolution":{"observed_at":"2026-07-31T12:22:30.454386Z","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-07-31T12:22:30.456989Z","title":"Capacity bounds for sticky channels,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.456989Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:d32e11ffbe3d6aaf2825585decde572fc3174bc7dcd6d1902d828a5392775946","observation_id":"e00d29ab-2363-49eb-ac9b-e27d2002357e","resolution":{"observed_at":"2026-07-31T12:22:30.456989Z","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":"10.1214/08-ps141","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A survey of results for deletion channels and related synchronization channels,","venue":"Probability Surveys","work_id":"7cc78a8f-c774-4667-a440-fb9486367d2c","year":2009},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.459666Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:60962eed15ed804aceefc8377a7700d7864eeb9f0377aa1b0b2aeafd38120d44","observation_id":"10375c2a-c312-4e2d-9962-366323257ae0","resolution":{"observed_at":"2026-07-31T12:26:27.805540Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-08T21:38:13.72967+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T21:38:13.72967+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+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-07-31T12:22:30.462310Z","title":"Efficient capacity-achieving codes for general repeat channels,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.462310Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:b9f5b2051a2ffd8d2838b42b0c609d076f445e530764e505103e19a723905dbf","observation_id":"a7d878d0-b1f6-4447-aa3b-54bec1f2109d","resolution":{"observed_at":"2026-07-31T12:22:30.462310Z","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-07-31T12:22:30.464825Z","title":"On the capacity of duplication channels,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.464825Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:0722829034cde5ac8c8dd064a096150a8892193949d6d1c81389ec375dfb7b98","observation_id":"c478818d-3f26-4a94-b49b-89983cd437bb","resolution":{"observed_at":"2026-07-31T12:22:30.464825Z","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-07-31T12:22:30.467552Z","title":"Functional composition patterns and power series reversion,","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.467552Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:3e86c3069e2f94538f644c20f14c5a0196322f433c31c7c45e996fd57ff00ec9","observation_id":"6de6d201-5ebd-43f4-b618-81f91b175c4f","resolution":{"observed_at":"2026-07-31T12:22:30.467552Z","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-07-31T12:22:30.470757Z","title":"The zero error capacity of a noisy channel,","venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.470757Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:0f75812044b2daafe705bcb97879d0b6617f9170d647e49b01899e7772ac088b","observation_id":"92558f0c-35a6-4827-8cd4-cec71d286659","resolution":{"observed_at":"2026-07-31T12:22:30.470757Z","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":"10.1109/18.57201","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On channel capacity per unit cost,","venue":"IEEE Transactions on Information Theory","work_id":"2937b8d0-002d-4349-bf89-256bde17f638","year":1990},"citing_paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-31T12:22:30.473567Z"},"links":{"citing_paper":"/paper/2607.28281"},"observation_digest":"sha256:7cb00a5f5ff2024893884e2f1e1b235650bbf018f1d93c4ae057f4b133ec500f","observation_id":"6bc5c677-fc41-4593-bb88-b92b66f1c84c","resolution":{"observed_at":"2026-07-31T12:26:27.640790Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-08T21:38:13.853688+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-08T21:38:13.853688+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.28281","last_updated":"2026-07-30T14:30:15Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-13T04:53:42.817908Z","submitted_at":"2026-07-30T14:30:15Z","title":"The Capacity of a Family of Sticky Channels"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":11,"verified_fuzzy":0},"total_outbound_references":29},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2607.28281."}