{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YQ45XCRYOJBAMV3KHVUENT3N2W","short_pith_number":"pith:YQ45XCRY","schema_version":"1.0","canonical_sha256":"c439db8a38724206576a3d6846cf6dd582ec01d3fe82ae4418ec7e3cdfeebccc","source":{"kind":"arxiv","id":"1701.01007","version":1},"attestation_state":"computed","paper":{"title":"Single Letter Expression of Capacity for a Class of Channels with Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Charalambos D. Charalambous, Christos K. Kourtellaris, Ioannis Tzortzis","submitted_at":"2017-01-04T13:42:12Z","abstract_excerpt":"We study finite alphabet channels with Unit Memory on the previous Channel Outputs called UMCO channels. We identify necessary and sufficient conditions, to test whether the capacity achieving channel input distributions with feedback are time-invariant, and whether feedback capacity is characterized by single letter, expressions, similar to that of memoryless channels. The method is based on showing that a certain dynamic programming equation, which in general, is a nested optimization problem over the sequence of channel input distributions, reduces to a non-nested optimization problem. More"},"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":"1701.01007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-04T13:42:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3200d5f6fe80233d592b23d71d18fe6a949185d7d246e7895e72f6be37e7ca1a","abstract_canon_sha256":"e91b36d878949367b1a144de96e9610d2161d6a713b70348e2d031cd26649966"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:21.691016Z","signature_b64":"u62MqCX5opjz99/FrItn7lxvFralC3148zVu3IDYBzm0zBPPGid04lLq938t0WVnuDmaAlQ/CqFrhOeDFipEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c439db8a38724206576a3d6846cf6dd582ec01d3fe82ae4418ec7e3cdfeebccc","last_reissued_at":"2026-05-18T00:53:21.690427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:21.690427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Single Letter Expression of Capacity for a Class of Channels with Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Charalambos D. Charalambous, Christos K. Kourtellaris, Ioannis Tzortzis","submitted_at":"2017-01-04T13:42:12Z","abstract_excerpt":"We study finite alphabet channels with Unit Memory on the previous Channel Outputs called UMCO channels. We identify necessary and sufficient conditions, to test whether the capacity achieving channel input distributions with feedback are time-invariant, and whether feedback capacity is characterized by single letter, expressions, similar to that of memoryless channels. The method is based on showing that a certain dynamic programming equation, which in general, is a nested optimization problem over the sequence of channel input distributions, reduces to a non-nested optimization problem. More"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01007","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":""},"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":"1701.01007","created_at":"2026-05-18T00:53:21.690513+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.01007v1","created_at":"2026-05-18T00:53:21.690513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01007","created_at":"2026-05-18T00:53:21.690513+00:00"},{"alias_kind":"pith_short_12","alias_value":"YQ45XCRYOJBA","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YQ45XCRYOJBAMV3K","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YQ45XCRY","created_at":"2026-05-18T12:31:56.362134+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/YQ45XCRYOJBAMV3KHVUENT3N2W","json":"https://pith.science/pith/YQ45XCRYOJBAMV3KHVUENT3N2W.json","graph_json":"https://pith.science/api/pith-number/YQ45XCRYOJBAMV3KHVUENT3N2W/graph.json","events_json":"https://pith.science/api/pith-number/YQ45XCRYOJBAMV3KHVUENT3N2W/events.json","paper":"https://pith.science/paper/YQ45XCRY"},"agent_actions":{"view_html":"https://pith.science/pith/YQ45XCRYOJBAMV3KHVUENT3N2W","download_json":"https://pith.science/pith/YQ45XCRYOJBAMV3KHVUENT3N2W.json","view_paper":"https://pith.science/paper/YQ45XCRY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.01007&json=true","fetch_graph":"https://pith.science/api/pith-number/YQ45XCRYOJBAMV3KHVUENT3N2W/graph.json","fetch_events":"https://pith.science/api/pith-number/YQ45XCRYOJBAMV3KHVUENT3N2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YQ45XCRYOJBAMV3KHVUENT3N2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YQ45XCRYOJBAMV3KHVUENT3N2W/action/storage_attestation","attest_author":"https://pith.science/pith/YQ45XCRYOJBAMV3KHVUENT3N2W/action/author_attestation","sign_citation":"https://pith.science/pith/YQ45XCRYOJBAMV3KHVUENT3N2W/action/citation_signature","submit_replication":"https://pith.science/pith/YQ45XCRYOJBAMV3KHVUENT3N2W/action/replication_record"}},"created_at":"2026-05-18T00:53:21.690513+00:00","updated_at":"2026-05-18T00:53:21.690513+00:00"}