{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:R4Q4BENIRLH5KENNQZQ3O7IZB3","short_pith_number":"pith:R4Q4BENI","schema_version":"1.0","canonical_sha256":"8f21c091a88acfd511ad8661b77d190ed9a0ba6570b32634f7b4385aff7c4368","source":{"kind":"arxiv","id":"2001.03423","version":3},"attestation_state":"computed","paper":{"title":"Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Navin Kashyap, V. Arvind Rameshwar","submitted_at":"2020-01-10T13:14:04Z","abstract_excerpt":"This paper studies the capacities of input-driven finite-state channels, i.e., channels whose current state is a time-invariant deterministic function of the previous state and the current input. We lower bound the capacity of such a channel using a dynamic programming formulation of a bound on the maximum reverse directed information rate. We show that the dynamic programming-based bounds can be simplified by solving the corresponding Bellman equation explicitly. In particular, we provide analytical lower bounds on the capacities of $(d, k)$-runlength-limited input-constrained binary symmetri"},"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":"2001.03423","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-01-10T13:14:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fd0bc007c5c3626ab82bbab842e9deb3ec961e2ec1658c98c4edf09942c92666","abstract_canon_sha256":"e8f97b38fa67ec43a4267f4244bf0ece431e736902d04adf9a2881bd21a3c1d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:39:40.892919Z","signature_b64":"WLNPiw3C0hVxtLmaQg4kDn1ugMJrDfdh8XthuH1M7yzghfvwrd9rn6tvKxW7FPWqVeO8Fg0VDEfPacJd0N3CBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f21c091a88acfd511ad8661b77d190ed9a0ba6570b32634f7b4385aff7c4368","last_reissued_at":"2026-07-05T00:39:40.892579Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:39:40.892579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Navin Kashyap, V. Arvind Rameshwar","submitted_at":"2020-01-10T13:14:04Z","abstract_excerpt":"This paper studies the capacities of input-driven finite-state channels, i.e., channels whose current state is a time-invariant deterministic function of the previous state and the current input. We lower bound the capacity of such a channel using a dynamic programming formulation of a bound on the maximum reverse directed information rate. We show that the dynamic programming-based bounds can be simplified by solving the corresponding Bellman equation explicitly. In particular, we provide analytical lower bounds on the capacities of $(d, k)$-runlength-limited input-constrained binary symmetri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.03423","kind":"arxiv","version":3},"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/2001.03423/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":"2001.03423","created_at":"2026-07-05T00:39:40.892635+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.03423v3","created_at":"2026-07-05T00:39:40.892635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.03423","created_at":"2026-07-05T00:39:40.892635+00:00"},{"alias_kind":"pith_short_12","alias_value":"R4Q4BENIRLH5","created_at":"2026-07-05T00:39:40.892635+00:00"},{"alias_kind":"pith_short_16","alias_value":"R4Q4BENIRLH5KENN","created_at":"2026-07-05T00:39:40.892635+00:00"},{"alias_kind":"pith_short_8","alias_value":"R4Q4BENI","created_at":"2026-07-05T00:39:40.892635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R4Q4BENIRLH5KENNQZQ3O7IZB3","json":"https://pith.science/pith/R4Q4BENIRLH5KENNQZQ3O7IZB3.json","graph_json":"https://pith.science/api/pith-number/R4Q4BENIRLH5KENNQZQ3O7IZB3/graph.json","events_json":"https://pith.science/api/pith-number/R4Q4BENIRLH5KENNQZQ3O7IZB3/events.json","paper":"https://pith.science/paper/R4Q4BENI"},"agent_actions":{"view_html":"https://pith.science/pith/R4Q4BENIRLH5KENNQZQ3O7IZB3","download_json":"https://pith.science/pith/R4Q4BENIRLH5KENNQZQ3O7IZB3.json","view_paper":"https://pith.science/paper/R4Q4BENI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.03423&json=true","fetch_graph":"https://pith.science/api/pith-number/R4Q4BENIRLH5KENNQZQ3O7IZB3/graph.json","fetch_events":"https://pith.science/api/pith-number/R4Q4BENIRLH5KENNQZQ3O7IZB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R4Q4BENIRLH5KENNQZQ3O7IZB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R4Q4BENIRLH5KENNQZQ3O7IZB3/action/storage_attestation","attest_author":"https://pith.science/pith/R4Q4BENIRLH5KENNQZQ3O7IZB3/action/author_attestation","sign_citation":"https://pith.science/pith/R4Q4BENIRLH5KENNQZQ3O7IZB3/action/citation_signature","submit_replication":"https://pith.science/pith/R4Q4BENIRLH5KENNQZQ3O7IZB3/action/replication_record"}},"created_at":"2026-07-05T00:39:40.892635+00:00","updated_at":"2026-07-05T00:39:40.892635+00:00"}