{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WT6IGYOGRLDQCBYW5QAPCKIISD","short_pith_number":"pith:WT6IGYOG","schema_version":"1.0","canonical_sha256":"b4fc8361c68ac7010716ec00f1290890de9ecab1a7c19f9bc21728dadd15c65a","source":{"kind":"arxiv","id":"2501.02917","version":5},"attestation_state":"computed","paper":{"title":"On Achievable Rates Over Noisy Nanopore Channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nir Weinberger, V. Arvind Rameshwar","submitted_at":"2025-01-06T10:56:13Z","abstract_excerpt":"In this paper, we consider a recent channel model of a nanopore sequencer proposed by McBain, Viterbo, and Saunderson (2024), termed the noisy nanopore channel (NNC). In essence, an NNC is a duplication channel with structured, Markov inputs, that is corrupted by memoryless noise. We first discuss a (tight) lower bound on the capacity of the NNC in the absence of random noise. Next, we present lower and upper bounds on the channel capacity of general noisy nanopore channels. We then consider two interesting regimes of operation of an NNC: first, where the memory of the input process is large a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2501.02917","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-01-06T10:56:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"79a236bf5d98a006ce27b2d6927f66335d3d11f4db0a77db7eb2499fa24e90b6","abstract_canon_sha256":"d37732261a92b4a4100c509210a14990d7faad82e9cfeacaa1e899ad496b4de7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:14.702986Z","signature_b64":"HM+A02d6PXwlwsBTYHgQK1HLCZL8h5TKGR7Ri0Zo/i27MV0Q/FQoJQN7i3nbzF7xg6PZPiVnqG8nW7qwDcuJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4fc8361c68ac7010716ec00f1290890de9ecab1a7c19f9bc21728dadd15c65a","last_reissued_at":"2026-07-05T10:53:14.702469Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:14.702469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Achievable Rates Over Noisy Nanopore Channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nir Weinberger, V. Arvind Rameshwar","submitted_at":"2025-01-06T10:56:13Z","abstract_excerpt":"In this paper, we consider a recent channel model of a nanopore sequencer proposed by McBain, Viterbo, and Saunderson (2024), termed the noisy nanopore channel (NNC). In essence, an NNC is a duplication channel with structured, Markov inputs, that is corrupted by memoryless noise. We first discuss a (tight) lower bound on the capacity of the NNC in the absence of random noise. Next, we present lower and upper bounds on the channel capacity of general noisy nanopore channels. We then consider two interesting regimes of operation of an NNC: first, where the memory of the input process is large a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.02917","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.02917/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2501.02917","created_at":"2026-07-05T10:53:14.702530+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.02917v5","created_at":"2026-07-05T10:53:14.702530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.02917","created_at":"2026-07-05T10:53:14.702530+00:00"},{"alias_kind":"pith_short_12","alias_value":"WT6IGYOGRLDQ","created_at":"2026-07-05T10:53:14.702530+00:00"},{"alias_kind":"pith_short_16","alias_value":"WT6IGYOGRLDQCBYW","created_at":"2026-07-05T10:53:14.702530+00:00"},{"alias_kind":"pith_short_8","alias_value":"WT6IGYOG","created_at":"2026-07-05T10:53:14.702530+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.12800","citing_title":"Concatenated Codes for Short-Molecule DNA Storage with Sequencing Channels of Positive Zero-Undetected-Error Capacity","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WT6IGYOGRLDQCBYW5QAPCKIISD","json":"https://pith.science/pith/WT6IGYOGRLDQCBYW5QAPCKIISD.json","graph_json":"https://pith.science/api/pith-number/WT6IGYOGRLDQCBYW5QAPCKIISD/graph.json","events_json":"https://pith.science/api/pith-number/WT6IGYOGRLDQCBYW5QAPCKIISD/events.json","paper":"https://pith.science/paper/WT6IGYOG"},"agent_actions":{"view_html":"https://pith.science/pith/WT6IGYOGRLDQCBYW5QAPCKIISD","download_json":"https://pith.science/pith/WT6IGYOGRLDQCBYW5QAPCKIISD.json","view_paper":"https://pith.science/paper/WT6IGYOG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.02917&json=true","fetch_graph":"https://pith.science/api/pith-number/WT6IGYOGRLDQCBYW5QAPCKIISD/graph.json","fetch_events":"https://pith.science/api/pith-number/WT6IGYOGRLDQCBYW5QAPCKIISD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WT6IGYOGRLDQCBYW5QAPCKIISD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WT6IGYOGRLDQCBYW5QAPCKIISD/action/storage_attestation","attest_author":"https://pith.science/pith/WT6IGYOGRLDQCBYW5QAPCKIISD/action/author_attestation","sign_citation":"https://pith.science/pith/WT6IGYOGRLDQCBYW5QAPCKIISD/action/citation_signature","submit_replication":"https://pith.science/pith/WT6IGYOGRLDQCBYW5QAPCKIISD/action/replication_record"}},"created_at":"2026-07-05T10:53:14.702530+00:00","updated_at":"2026-07-05T10:53:14.702530+00:00"}