{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:R4Q4BENIRLH5KENNQZQ3O7IZB3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e8f97b38fa67ec43a4267f4244bf0ece431e736902d04adf9a2881bd21a3c1d2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-01-10T13:14:04Z","title_canon_sha256":"fd0bc007c5c3626ab82bbab842e9deb3ec961e2ec1658c98c4edf09942c92666"},"schema_version":"1.0","source":{"id":"2001.03423","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.03423","created_at":"2026-07-05T00:39:40Z"},{"alias_kind":"arxiv_version","alias_value":"2001.03423v3","created_at":"2026-07-05T00:39:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.03423","created_at":"2026-07-05T00:39:40Z"},{"alias_kind":"pith_short_12","alias_value":"R4Q4BENIRLH5","created_at":"2026-07-05T00:39:40Z"},{"alias_kind":"pith_short_16","alias_value":"R4Q4BENIRLH5KENN","created_at":"2026-07-05T00:39:40Z"},{"alias_kind":"pith_short_8","alias_value":"R4Q4BENI","created_at":"2026-07-05T00:39:40Z"}],"graph_snapshots":[{"event_id":"sha256:734290c447212f7ab29f6175d89432446ff256e042ece01b7ce92e1e667f3c28","target":"graph","created_at":"2026-07-05T00:39:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2001.03423/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Navin Kashyap, V. Arvind Rameshwar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-01-10T13:14:04Z","title":"Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.03423","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3b1cf790de1626ebf0cbccc3c5bf0a6f11a28f2686385bdad03da8e457ed01af","target":"record","created_at":"2026-07-05T00:39:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e8f97b38fa67ec43a4267f4244bf0ece431e736902d04adf9a2881bd21a3c1d2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-01-10T13:14:04Z","title_canon_sha256":"fd0bc007c5c3626ab82bbab842e9deb3ec961e2ec1658c98c4edf09942c92666"},"schema_version":"1.0","source":{"id":"2001.03423","kind":"arxiv","version":3}},"canonical_sha256":"8f21c091a88acfd511ad8661b77d190ed9a0ba6570b32634f7b4385aff7c4368","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f21c091a88acfd511ad8661b77d190ed9a0ba6570b32634f7b4385aff7c4368","first_computed_at":"2026-07-05T00:39:40.892579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:39:40.892579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WLNPiw3C0hVxtLmaQg4kDn1ugMJrDfdh8XthuH1M7yzghfvwrd9rn6tvKxW7FPWqVeO8Fg0VDEfPacJd0N3CBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:39:40.892919Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.03423","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b1cf790de1626ebf0cbccc3c5bf0a6f11a28f2686385bdad03da8e457ed01af","sha256:734290c447212f7ab29f6175d89432446ff256e042ece01b7ce92e1e667f3c28"],"state_sha256":"a2637ec55c11c5552905b8e02246b132ee64316f7b9660b5323b5f8b2212dbfa"}