{"as_of":"2026-08-18T19:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e7202f6955fdf9d810748bc01eea6fc8f108745b7af2b1ad8cf565eabfa1e446","coverage":[{"denominator":54,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":54,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:12:58.461523Z","state":"measured"},{"denominator":55,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":55,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-21T13:51:51.916622Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-21T13:54:11.506506Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"cited_work":{"arxiv_id":"2501.02917","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.02917","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On achievable rates over noisy nanopore channels","venue":null,"work_id":"64a5acf8-ee05-4654-bf13-1d097e471eeb","year":2025},"citing_paper":{"arxiv_id":"2602.12800","last_updated":"2026-05-17T19:34:48Z","snapshot_observed_at":"2026-08-14T06:32:27.450604Z","submitted_at":"2026-02-13T10:33:19Z","title":"Concatenated Codes for Short-Molecule DNA Storage with Sequencing Channels of Positive Zero-Undetected-Error Capacity","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-21T13:51:51.916622Z"},"links":{"cited_paper":"/paper/2501.02917","citing_paper":"/paper/2602.12800"},"observation_digest":"sha256:8e55d11e960ebe32363d4f9c6dbad4e6e6f97281e7d6db4278fe652a805ac068","observation_id":"f83bec6e-97e5-4498-848b-018b5b69d7b9","resolution":{"observed_at":"2026-05-21T13:54:11.508513Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.02917/citation-record","integrity":"/paper/2501.02917/integrity","json":"/paper/2501.02917/citation-record.json","paper":"/paper/2501.02917"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1126/science.1226355","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:59.686014Z","title":"Next-generation digital information storage in DNA,","venue":null,"work_id":"c2c668b8-f636-4191-89bb-f5264b61a750","year":2012},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.012503Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:ed429d70b17c16b485824cb10a67a0b982077ef94d7cf57fb2df547afb678a57","observation_id":"2ebc1d10-3936-48a4-a12c-91102149a260","resolution":{"observed_at":"2026-08-10T22:12:59.708183Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:03.506155Z","title":"Towards practical, high-capacity, low-maintenance information storage in synthesized DNA,","venue":null,"work_id":"d2c73108-7e08-4fae-8dcb-ffff3eccb09c","year":2013},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.044754Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:60d0a81fcc1fd34232979a67cef0a145f79d052d214ac4e64fee12e449e8926a","observation_id":"e8febbff-216c-45eb-ba68-5c3510a9ad77","resolution":{"observed_at":"2026-08-10T22:13:03.533763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:03.409603Z","title":"Robust chemical preservation of digital information on DNA in silica with error-correcting codes,","venue":null,"work_id":"c54db919-65ba-46a8-8131-c0ba0eec1212","year":null},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.084754Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:460f3df6384c0e37398d833afa975698ef2d176d83c6697a703ea2ff15c7cae7","observation_id":"e8b30199-89f1-4a3e-bdc6-e7f7a7b9d095","resolution":{"observed_at":"2026-08-10T22:13:03.423726Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:56.174748Z","title":"DNA Fountain enables a robust and efficient storage architecture,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.174748Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:c09f83d64f3786980b06c6a726979218322306ab2cc4e1da9481861d21033145","observation_id":"66d49517-54ed-4287-a1e4-e73325815eae","resolution":{"observed_at":"2026-08-10T22:12:56.174748Z","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-10T22:13:03.342042Z","title":"Portable and error-free DNA-based data storage,","venue":null,"work_id":"9cf069ba-39af-47c4-802a-5b641c4526bf","year":2017},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.224755Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:2703e5df2440879ae80c5e3e0995e1af73d6fb1158336cdb9574fca9906ef9e9","observation_id":"6782693c-2e4a-4105-ad20-4bc5f295448e","resolution":{"observed_at":"2026-08-10T22:13:03.361214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:56.277595Z","title":"Random access in large-scale DNA data storage,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.277595Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:7e0c597b1e9b9d668c81a819e3b4f8d89fc3ec6ffb4e97fbf7929a919c9f040c","observation_id":"7dac12b6-9023-4281-a977-03c5be33253f","resolution":{"observed_at":"2026-08-10T22:12:56.277595Z","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.1561/0100000117","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:59.485037Z","title":"Information-theoretic foundations of DNA data storage,","venue":null,"work_id":"8a40b617-4e40-443c-b1f0-2c21e13b46d5","year":2022},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.324764Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:d47a41d82af2a74205cf17f670973e153b7802fd1f36c16ea95a0a23329557be","observation_id":"306f6a57-d3db-40ea-8fa8-0caaa8fa3f3c","resolution":{"observed_at":"2026-08-10T22:12:59.493938Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:03.304914Z","title":"The DNA storage channel: Capacity and error probability bounds,","venue":null,"work_id":"08de441b-091e-408c-866d-d68ef20fd4bb","year":2022},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.384759Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:7133132565bfc0ed051f3a680ec7715614c2aac7747eacfe85e2651bdfe24196","observation_id":"c1f48885-305d-4dda-ade9-9ec59372c9b0","resolution":{"observed_at":"2026-08-10T22:13:03.320043Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:03.174027Z","title":"The noisy drawing channel: Reliable data storage in DNA sequences,","venue":null,"work_id":"38a56d1d-ac24-4d63-bad4-c3776871d497","year":2023},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.439413Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:b19ec298e47e806cc58e9f1bb24488f20dca94727d64fb34aed4e5ec033afc0e","observation_id":"c762f2f2-c2ae-4a7a-b5fa-4040f684cfe9","resolution":{"observed_at":"2026-08-10T22:13:03.204755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/nbt.3423","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:59.429710Z","title":"Three decades of nanopore sequencing,","venue":null,"work_id":"e18c6cfc-168d-4651-a25c-cf39174de264","year":2016},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.494756Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:cc8d5bdea537c511e98bc7deac32041f4dbfdf979a1326ad2c1225ff3f81e9fa","observation_id":"31c7d753-f138-4dee-82be-7d7ac844becd","resolution":{"observed_at":"2026-08-10T22:12:59.449486Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:03.109577Z","title":"[Online]","venue":null,"work_id":"0c580912-6691-4b2c-9c33-f49b69d06d22","year":null},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.544754Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:74322bbb8467351609c58fc138c80e5156a85a4d5bc94e78d450f16fbc6f87f3","observation_id":"24f666e3-838d-4115-88b1-444ca4a2d914","resolution":{"observed_at":"2026-08-10T22:13:03.124751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:03.062460Z","title":"Expanding the molecular alphabet of DNA-based data storage systems with neural network nanopore readout processing,","venue":null,"work_id":"f566c84f-adf7-4115-8008-e07f7233c6f7","year":1905},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.594754Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:38daccb8f115179d19e4a9538982055e3db99dc04b56432f9c28eab434193ef9","observation_id":"3d17fced-2ba9-45cc-a6eb-22e212cbad95","resolution":{"observed_at":"2026-08-10T22:13:03.088237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:03.014188Z","title":"Solid-state MoS 2 nanopore membranes for discriminating among the lengths of RNA tails on a double-stranded DNA: A new simulation-based differentiating algorithm,","venue":null,"work_id":"21d73af8-2780-4dd6-a644-d437345a48ff","year":2023},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.660853Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:5b1a7aed14d8d2ae02dabbac9a7738096705fca359b5033039ec698d864cabe3","observation_id":"46e454c6-7aa1-4afc-91bc-168c46b2511c","resolution":{"observed_at":"2026-08-10T22:13:03.027824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:02.960552Z","title":"Models and information-theoretic bounds for nanopore sequencing,","venue":null,"work_id":"653717c9-a1f7-4bd7-a9bd-6ab1b81ab767","year":2018},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.710501Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:c2b18613db1dacec63314a3ace9f7a528dc39b93691b987d834c718d1896726e","observation_id":"6e910736-1053-41b0-b943-ca835b5d39b9","resolution":{"observed_at":"2026-08-10T22:13:02.973930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:02.897897Z","title":"On coding for an abstracted nanopore channel for DNA storage,","venue":null,"work_id":"bde48c0f-6d1f-4e23-927c-5a6bc3f51e4c","year":2021},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.737653Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:57c43a40abc5d8faa1eaf4647b098e02278f964bf601e82337580b79846a3d9f","observation_id":"5aeafc6f-d2b6-47a1-b708-d6f4ab2ea29a","resolution":{"observed_at":"2026-08-10T22:13:02.925789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:02.784648Z","title":"Channel model with memory for DNA data storage with nanopore sequencing,","venue":null,"work_id":"9b02adb0-1cf7-4ca3-bdb7-0739c94abe17","year":2021},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.794371Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:6ecb30591d01ce30f7ea992b5ff83623f7e16815aa48a9d60e0c4c6a1981f449","observation_id":"0abf40a8-718f-4c75-8e4e-69ec1c10e58a","resolution":{"observed_at":"2026-08-10T22:13:02.824761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:02.705914Z","title":"Information rates of the noisy nanopore channel,","venue":null,"work_id":"9e6e1343-edea-41df-9938-a884bde46114","year":2024},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.834759Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:1eb67f0e076f1e3973045541729d97b10338ada4c8cba0a875859652e1fbadc2","observation_id":"6359a0f7-cefa-411b-95be-1ef6bdea07b9","resolution":{"observed_at":"2026-08-10T22:13:02.739306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:02.584868Z","title":"An information-theoretic approach to nanopore sequencing for DNA storage,","venue":null,"work_id":"27e4ea65-a567-4397-b7b5-8634c85210f6","year":2023},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.870469Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:648dfc30af1bcb4125dd11ff091e8ad5903de069ddf4cf0ac35992a2d83e519d","observation_id":"14371715-0c01-42eb-977a-ce9a59e8514e","resolution":{"observed_at":"2026-08-10T22:13:02.602511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:02.502114Z","title":"[Online]","venue":null,"work_id":"a3783661-bf85-43d5-91ca-21296dcb3720","year":null},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.914841Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:ab49dd641d4fe5d7af50e97eab89b0d311f82d9eadf6b0b421b086d8b5f9039c","observation_id":"595b5634-aee8-41ac-ba8a-f443b6507376","resolution":{"observed_at":"2026-08-10T22:13:02.519348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:02.345503Z","title":"Finite-state semi-Markov channels for nanopore sequencing,","venue":null,"work_id":"87fd4740-32ba-408f-b927-7fbd9c2e51eb","year":2022},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.954752Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:5b390691ef035f3fec06bc6b97e0e341e374e7731686892c3be193b77d96f1d0","observation_id":"b9cfa4ac-37f2-4bec-b6df-911ef790ffb9","resolution":{"observed_at":"2026-08-10T22:13:02.394883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:02.219778Z","title":"On noisy duplication channels with Markov sources,","venue":null,"work_id":"d543a7e2-cd29-4784-8ff5-dc3fa1ad1902","year":2024},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.994743Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:08e93cd500e1d7a9efeb35ff269b6aaade800298f21987556b3e10dd8088130d","observation_id":"ff2b84a0-14ce-460b-acd1-fc128651bc31","resolution":{"observed_at":"2026-08-10T22:13:02.264844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:02.115301Z","title":"Shannon’s theorems for channels with synchronization errors,","venue":null,"work_id":"c95e6ceb-2d45-4fe1-9ece-fee7597df486","year":1967},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:57.034753Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:ba850d17e7669458947c8b252c40538e0eee09ba76588a465d291b97797ff5a7","observation_id":"a2facdd4-7f2d-402e-a30a-3f88ac25cd99","resolution":{"observed_at":"2026-08-10T22:13:02.154926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:02.047727Z","title":"On information transmission over a finite buffer channel,","venue":null,"work_id":"830125dc-19e4-4aca-a4ce-e22a526a3610","year":2006},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:57.104754Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:dabb456701fe99bb0cd80b79221a899e8b944e9639db5660b34a504d8eaf86f6","observation_id":"5b7a531d-b298-4d7a-a15d-a6149bf056f2","resolution":{"observed_at":"2026-08-10T22:13:02.054637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:01.953413Z","title":"Capacity upper bounds for the deletion channel,","venue":null,"work_id":"e17f0baf-6912-4b61-94a7-54ba95043a90","year":2007},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:57.164754Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:d0751890bca2f17c6bd8b7dbbcdfc022f2c942329b243207edea0d0fbce3114e","observation_id":"a9c31ef4-978b-4704-a86b-2614304bf3f4","resolution":{"observed_at":"2026-08-10T22:13:01.984749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:01.824758Z","title":"On lower bounds for the capacity of deletion channels,","venue":null,"work_id":"10142602-3134-418e-a5bf-451e6df35d6b","year":2006},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:57.201098Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:0f7771a45e1741779aa4b784ccd03081ffbbd0ac45343a57d1361b391e79db16","observation_id":"7edb353e-d1ea-473e-a955-5e20feee3b35","resolution":{"observed_at":"2026-08-10T22:13:01.863735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:01.683264Z","title":"A simple lower bound for the capacity of the deletion channel,","venue":null,"work_id":"9e6fc304-e122-4ff1-a9bd-19e94d78b4da","year":2006},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:57.234750Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:8735309cef006f8a9cbf8d887c946278e6701eb96347b4ef3d458ce22f4772ac","observation_id":"2df3b021-f67a-4210-8ad3-9b0f17c1ac85","resolution":{"observed_at":"2026-08-10T22:13:01.734749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:01.604748Z","title":"Improved lower bounds for the capacity of i.i.d. deletion and duplication channels,","venue":null,"work_id":"b2f2edf9-f5c1-4480-abcb-0c69e3464795","year":2007},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:57.285050Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:39bfbdaad070da224edf89139c42254d0b054104267de23dc35a7fc2554df01d","observation_id":"0d42c35c-eb6d-4b60-ad12-a5d59bbab30a","resolution":{"observed_at":"2026-08-10T22:13:01.629266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:01.521498Z","title":"Directly lower bounding the information capacity for channels with i.i.d. deletions and duplications,","venue":null,"work_id":"0d07b637-9dfc-440f-9f88-714f4fcaa4b1","year":2010},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:57.334838Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:1aba795d3666efa4d75bf5df29d147f07cf09f1e07ef1a703e73a2118381702a","observation_id":"c5f4b3c0-9235-4aa6-bbc0-3fd71f93aa97","resolution":{"observed_at":"2026-08-10T22:13:01.550741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:01.450754Z","title":"Novel bounds on the capacity of the binary deletion channel,","venue":null,"work_id":"3d7b20be-d4a3-46e5-93cc-877bf034021c","year":2010},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:57.384864Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:b401916507bbe2b74fa340b8e65717649baed0bc1a015a3d6e4ee1dc1b1d8488","observation_id":"4fc42fa4-65e9-42fc-a1dd-5a2983f22ba0","resolution":{"observed_at":"2026-08-10T22:13:01.474834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:01.388760Z","title":"On the capacity of channels with timing synchronization errors,","venue":null,"work_id":"41fd4bc5-2589-4df2-b645-8dfa3bbde232","year":2016},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:57.424752Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:b166cfb69b4b03fc11aced9467a91e62176705cfc126d2c33731bedc39896700","observation_id":"404b2b64-c5e1-4c4c-8c26-357266e8cfd5","resolution":{"observed_at":"2026-08-10T22:13:01.416333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:01.333273Z","title":"Bounds on the capacity of discrete memoryless channels corrupted by synchronization and substitution errors,","venue":null,"work_id":"54cc91a3-3b4a-412b-8791-967662269442","year":2012},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:57.474752Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:144d63581251b91f5afcea37998a3e4d9b361cd29d9d01f1c4aa00cecf9c2f40","observation_id":"f325bdda-7378-4c14-953d-0c0a7cacc76d","resolution":{"observed_at":"2026-08-10T22:13:01.360959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:01.265841Z","title":"Achievable rates for noisy channels with synchronization errors,","venue":null,"work_id":"2288d5f7-2b94-49d7-baeb-6c4faa242483","year":2014},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:57.524754Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:c08359324434d0ffaaf607beec6258d3955c1d26734e633cb434df15ef1b4a6c","observation_id":"9824060f-f831-49ce-b725-8496a665d2ce","resolution":{"observed_at":"2026-08-10T22:13:01.282289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:57.574750Z","title":"Synchronization strings: Codes for insertions and deletions approaching the singleton bound,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:57.574750Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:4d20f4e03ed3ef16695ef09e69d04d4f3ced46867bcdf00b193d8dfcaf4be51a","observation_id":"ee56ada9-bd5c-449d-9859-fda97d455043","resolution":{"observed_at":"2026-08-10T22:12:57.574750Z","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-10T22:13:01.134747Z","title":"Polynomial time decodable codes for the binary deletion channel,","venue":null,"work_id":"bd924e04-8e26-405d-96e0-a788fe8b4e7b","year":2019},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:57.644753Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:0e4df89ae747d64b3f53a29934a8965da6ad6adb9fd6c8b133eb8bd83187b34e","observation_id":"4402798f-e6a0-4b80-a0ea-d83f1925951a","resolution":{"observed_at":"2026-08-10T22:13:01.184751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:57.694763Z","title":"Efficient capacity-achieving codes for general repeat channels,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:57.694763Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:805977d2bcce6f7829892ce411d8b1f15fd4dc5ef124acb91beb6f1d4af37cd7","observation_id":"b36d3cce-a3d1-42ae-b45e-1b7454e1423e","resolution":{"observed_at":"2026-08-10T22:12:57.694763Z","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-10T22:13:01.082533Z","title":"Improved constructions of coding schemes for the binary deletion channel and the Poisson repeat channel,","venue":null,"work_id":"0a932d27-3415-4022-9ac4-1b3499389913","year":2022},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:57.744753Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:23a4fcf52e42b1d79a23f6f3e34b253bf60e94b6bbe398bc6be3664e99b265a7","observation_id":"8be5b746-3c85-4cfd-a7c3-c828f1538250","resolution":{"observed_at":"2026-08-10T22:13:01.089319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1515/9783110198119.273","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:59.211348Z","title":null,"venue":null,"work_id":"151b9eba-cfd7-461c-a2af-1197d5caa3f2","year":2002},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:57.814755Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:c868f4a70c6799c92f0caf7c4780e0f60240f9deedefe59d6c91c462af299a73","observation_id":"94482b72-a510-41ba-9a73-d8e5c1a37462","resolution":{"observed_at":"2026-08-10T22:12:59.264170Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/nbt.2950","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:59.044757Z","title":"Decoding long nanopore sequencing reads of natural DNA,","venue":null,"work_id":"00ea9957-4a7f-4d3a-bb7e-fdc9391830b9","year":2014},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:57.864762Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:6dbeefdfe27ee9d6d2d4d30d9802d3468cff09273b20ec81b40fc3aea1256efc","observation_id":"89cc9edd-4086-47d5-9b7c-283fcbeae855","resolution":{"observed_at":"2026-08-10T22:12:59.088168Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:01.015231Z","title":"A general formula for channel capacity,","venue":null,"work_id":"45692ebe-d67a-4a4f-a560-258f61697680","year":1994},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:57.914775Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:5047b8dd4d3c37c7c8b02d762464613b84feda3b7d2a4a5c5eb4627f208fc980","observation_id":"b337c96a-8fe5-418e-9236-65bf36835755","resolution":{"observed_at":"2026-08-10T22:13:01.062364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:00.847411Z","title":"Thinning and the law of small numbers,","venue":null,"work_id":"e1dbd4a7-3d7a-4c76-8f9e-9f70164908da","year":2007},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:57.974761Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:0776cfc01b3b123a8b7d3b061c9d2b3480244b9988f4bc7ceb620bbf8776442b","observation_id":"1a7f9724-b2d5-43e9-a310-f398dc48313f","resolution":{"observed_at":"2026-08-10T22:13:00.895264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:00.709769Z","title":"Sumset and inverse sumset theory for Shannon entropy,","venue":null,"work_id":"1c013ae3-f431-4d45-b2b1-ceeec9e20503","year":2010},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:58.014752Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:c33b555161aeee1a7a6d5ee3bbd49b5c126b3299426deb4e2b8c0fe3154ae85b","observation_id":"9737f8d9-e971-401d-b3c7-f53d14fedd10","resolution":{"observed_at":"2026-08-10T22:13:00.754266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:00.544755Z","title":"On the entropy of sums,","venue":null,"work_id":"a3ff77f5-0326-49d5-ae0b-d3e432f12f52","year":2008},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:58.052696Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:8e6098f9775cadd2434284aaef8bcc3e80b5fa5ce48c9ec710a32e45fbe5a078","observation_id":"e3c26cc5-b9fb-4f58-807f-20811161dc2a","resolution":{"observed_at":"2026-08-10T22:13:00.584758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:00.434908Z","title":"Expressions for the entropy of binomial-type distributions,","venue":null,"work_id":"1a943240-a349-4648-9508-4c58192c2a9c","year":2018},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:58.104813Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:672f0e4ea054946439e6ed8a297053270c3264c4c4fc0f4d812ff7634a044b34","observation_id":"0a444a5a-b69c-412e-91e8-0bfbd13c1c3a","resolution":{"observed_at":"2026-08-10T22:13:00.463258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:00.255778Z","title":"On the theory and practice of data recovery with multiple versions,","venue":null,"work_id":"bab26ab3-3290-4e1c-9505-d5a7d2f94029","year":2006},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:58.174754Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:5d972d8bf181bc30add2e73ac016fafa255057245a5f88788e86c4f25e5d6ab0","observation_id":"141f2d63-9a37-484e-bd1c-341aee36f34b","resolution":{"observed_at":"2026-08-10T22:13:00.304814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1561/0100000013","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:58.925656Z","title":"Information combining,","venue":null,"work_id":"77c107f8-cb1d-4d8a-9422-980e444ec470","year":2006},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:58.225002Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:faa5c54d0f245eb3303164fb0cfe17b01044f77ec52079b36679379a77ff382b","observation_id":"57daa968-4107-41f0-bc04-46a1acf4eefe","resolution":{"observed_at":"2026-08-10T22:12:58.964748Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:00.134823Z","title":"Information rates over multi-view channels,","venue":null,"work_id":"c4f0e4e3-ffcd-4c06-80aa-408a2871de2f","year":2025},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:58.267665Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:2b556e2a874e7fefb5f647d00b51ede1714e05ccb4034265b87712a423efe795","observation_id":"590e1341-cd2b-48f2-a7ff-a0ddbca70265","resolution":{"observed_at":"2026-08-10T22:13:00.184753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1561/0100000041","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:58.747114Z","title":"Polarization and polar codes,","venue":null,"work_id":"b0df5d8f-4054-4e2c-8572-4fa05331f0ef","year":2012},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:58.296772Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:989bd889f34c4830dbcd038b80b7cfdfc00861dc1ddeaf315b2bb00b9074cb81","observation_id":"c655e77c-c43f-4778-8662-9a1e4d628e14","resolution":{"observed_at":"2026-08-10T22:12:58.804761Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:13:00.002240Z","title":"Mitzenmacher and E","venue":null,"work_id":"e3ba77cc-512e-4241-a7c1-4b84a2e9850c","year":2005},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:58.332594Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:c3174efbb6abe3a52ab2c0e545d9ee878cecb14367e374d86b00b598f472ea1d","observation_id":"ab7ca73c-1ece-4d4e-ab37-110571aa5911","resolution":{"observed_at":"2026-08-10T22:13:00.022139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:59.939765Z","title":null,"venue":null,"work_id":"ef4b0369-4a7a-4be0-9b72-c599ce86b3eb","year":2010},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:58.357519Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:98987af2cee80e03cd21a6d7823fd6feccf821066e9e415cb39b8c5aa17bb1d3","observation_id":"7f46b113-3266-448b-9911-a01d82074fc4","resolution":{"observed_at":"2026-08-10T22:12:59.959228Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:59.912017Z","title":"An introduction to coding for constrained systems,","venue":null,"work_id":"0681b07f-e542-49e5-9220-fd6ed092fa29","year":2016},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:58.405310Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:2e9a5e955bc248d50d3e7be93beb42bb4e47eec6d7060f8689fe1f2056752fde","observation_id":"a89b81e1-04c6-43f9-ab95-e186f51555e9","resolution":{"observed_at":"2026-08-10T22:12:59.920929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:59.868679Z","title":null,"venue":null,"work_id":"c52083c7-32e4-4eb3-92a1-ab1aed13982f","year":2014},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:58.434849Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:f907560af7da3f17b106bb4833b86b3640893a64b6efc6a3906dc88f7a056b0d","observation_id":"072d2cb5-44fa-41ef-ac66-6e36d6c585af","resolution":{"observed_at":"2026-08-10T22:12:59.881387Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1108002","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:58.644926Z","title":"On optimum methods in quickest detection problems,","venue":null,"work_id":"24ff2117-144d-4a59-b67b-c994b724dfdc","year":1963},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:58.450022Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:ace8787c43dd6f52baff615de8794226c2ba6522329192f97a2163337e303b98","observation_id":"e080dbc5-d856-4fb3-b3e4-7da81c94999b","resolution":{"observed_at":"2026-08-10T22:12:58.671799Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0040585x97981202","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:58.564882Z","title":"General asymptotic Bayesian theory of quickest change detection,","venue":null,"work_id":"e230cd19-9a62-439b-bdd8-d2f1de815b0c","year":2005},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:58.461523Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:719e158fa887f770fd9057e634af4d99a3317e1333c9395e080bcffc01272038","observation_id":"09793835-a27e-4879-a286-36c3dc346219","resolution":{"observed_at":"2026-08-10T22:12:58.594726Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:12:56.131586Z","title":"Available: https://onlinelibrary.wiley.com/doi/abs/10.1002/anie.201411378","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels","version":5},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-10T22:12:56.131586Z"},"links":{"citing_paper":"/paper/2501.02917"},"observation_digest":"sha256:060da10a6625c8c4b2e6073027cec4229e627472cadf1c5949c6be66fd6b0182","observation_id":"a7c60f39-8535-429a-96ec-9d0292eb48d1","resolution":{"observed_at":"2026-08-10T22:12:56.131586Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.02917","last_updated":"2025-04-24T09:37:12Z","latest_version":5,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-10T21:57:58.575171Z","submitted_at":"2025-01-06T10:56:13Z","title":"On Achievable Rates Over Noisy Nanopore Channels"},"reference_resolution":{"displayed":54,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":9,"verified_fuzzy":38},"total_outbound_references":54},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 54 of 54 outbound references and 1 inbound Pith citation observation for arXiv:2501.02917."}