{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FQTYSXCRGZP7YTUCUO4JKXNTSU","short_pith_number":"pith:FQTYSXCR","schema_version":"1.0","canonical_sha256":"2c27895c51365ffc4e82a3b8955db395317e6149780a1df4dcdcbed88f7be596","source":{"kind":"arxiv","id":"2212.12886","version":1},"attestation_state":"computed","paper":{"title":"Finite-State Channels with Feedback and State Known at the Encoder","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eli Shemuel, Haim H. Permuter, Oron Sabag","submitted_at":"2022-12-25T10:29:26Z","abstract_excerpt":"We consider finite state channels (FSCs) with feedback and state information known causally at the encoder. This setting is quite general and includes: a memoryless channel with i.i.d. state (the Shannon strategy), Markovian states that include look-ahead (LA) access to the state and energy harvesting. We characterize the feedback capacity of the general setting as the directed information between auxiliary random variables with memory to the channel outputs. We also propose two methods for computing the feedback capacity: (i) formulating an infinite-horizon average-reward dynamic program; and"},"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":"2212.12886","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2022-12-25T10:29:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a962908aca650585f4441a76209903fd1a2ad8a05a3c529ee6a916f0aaea8c83","abstract_canon_sha256":"53bb2efffe00f84190ac76cbcd8af7dae7152d72e6bec2e4e25c909af13dd36b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:28:14.532346Z","signature_b64":"QBTgYcx1sgwBRQ1Q3gUlFdekGCkWv5pdc9CiI/QcFd3ELpWhS+c5qlTrUA5W7m5RNFW2esz2EowTaUPAOekPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c27895c51365ffc4e82a3b8955db395317e6149780a1df4dcdcbed88f7be596","last_reissued_at":"2026-07-05T05:28:14.531949Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:28:14.531949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite-State Channels with Feedback and State Known at the Encoder","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eli Shemuel, Haim H. Permuter, Oron Sabag","submitted_at":"2022-12-25T10:29:26Z","abstract_excerpt":"We consider finite state channels (FSCs) with feedback and state information known causally at the encoder. This setting is quite general and includes: a memoryless channel with i.i.d. state (the Shannon strategy), Markovian states that include look-ahead (LA) access to the state and energy harvesting. We characterize the feedback capacity of the general setting as the directed information between auxiliary random variables with memory to the channel outputs. We also propose two methods for computing the feedback capacity: (i) formulating an infinite-horizon average-reward dynamic program; and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.12886","kind":"arxiv","version":1},"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/2212.12886/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":"2212.12886","created_at":"2026-07-05T05:28:14.532005+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.12886v1","created_at":"2026-07-05T05:28:14.532005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.12886","created_at":"2026-07-05T05:28:14.532005+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQTYSXCRGZP7","created_at":"2026-07-05T05:28:14.532005+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQTYSXCRGZP7YTUC","created_at":"2026-07-05T05:28:14.532005+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQTYSXCR","created_at":"2026-07-05T05:28:14.532005+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.03335","citing_title":"Actions Speak Louder Than Words: Rate-Reward Trade-off in Markov Decision Processes","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FQTYSXCRGZP7YTUCUO4JKXNTSU","json":"https://pith.science/pith/FQTYSXCRGZP7YTUCUO4JKXNTSU.json","graph_json":"https://pith.science/api/pith-number/FQTYSXCRGZP7YTUCUO4JKXNTSU/graph.json","events_json":"https://pith.science/api/pith-number/FQTYSXCRGZP7YTUCUO4JKXNTSU/events.json","paper":"https://pith.science/paper/FQTYSXCR"},"agent_actions":{"view_html":"https://pith.science/pith/FQTYSXCRGZP7YTUCUO4JKXNTSU","download_json":"https://pith.science/pith/FQTYSXCRGZP7YTUCUO4JKXNTSU.json","view_paper":"https://pith.science/paper/FQTYSXCR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.12886&json=true","fetch_graph":"https://pith.science/api/pith-number/FQTYSXCRGZP7YTUCUO4JKXNTSU/graph.json","fetch_events":"https://pith.science/api/pith-number/FQTYSXCRGZP7YTUCUO4JKXNTSU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQTYSXCRGZP7YTUCUO4JKXNTSU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQTYSXCRGZP7YTUCUO4JKXNTSU/action/storage_attestation","attest_author":"https://pith.science/pith/FQTYSXCRGZP7YTUCUO4JKXNTSU/action/author_attestation","sign_citation":"https://pith.science/pith/FQTYSXCRGZP7YTUCUO4JKXNTSU/action/citation_signature","submit_replication":"https://pith.science/pith/FQTYSXCRGZP7YTUCUO4JKXNTSU/action/replication_record"}},"created_at":"2026-07-05T05:28:14.532005+00:00","updated_at":"2026-07-05T05:28:14.532005+00:00"}