{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ICYLRCPGCWRITQCOGW766MZCFF","short_pith_number":"pith:ICYLRCPG","canonical_record":{"source":{"id":"1604.01063","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-04T21:05:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"65fd1a318d94ff392b18b07477d43b80226bf263cebd1c8829b75bec62ff99e3","abstract_canon_sha256":"af24efb65aed58b0469032ea006b90dc20455a6a7ab194bd82750f82b555140f"},"schema_version":"1.0"},"canonical_sha256":"40b0b889e615a289c04e35bfef3322296d6f2cbb49751cf3d8945f818c2076c4","source":{"kind":"arxiv","id":"1604.01063","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01063","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01063v2","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01063","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"pith_short_12","alias_value":"ICYLRCPGCWRI","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"ICYLRCPGCWRITQCO","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"ICYLRCPG","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ICYLRCPGCWRITQCOGW766MZCFF","target":"record","payload":{"canonical_record":{"source":{"id":"1604.01063","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-04T21:05:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"65fd1a318d94ff392b18b07477d43b80226bf263cebd1c8829b75bec62ff99e3","abstract_canon_sha256":"af24efb65aed58b0469032ea006b90dc20455a6a7ab194bd82750f82b555140f"},"schema_version":"1.0"},"canonical_sha256":"40b0b889e615a289c04e35bfef3322296d6f2cbb49751cf3d8945f818c2076c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:28.705609Z","signature_b64":"Jqpr6LyOvi/27M+Pixtiktme6i9WxWm1lKPytVXStYtuSD/+66uGZ8RhNBV4ThV+JnD6S4AinAU+SqusaRwdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40b0b889e615a289c04e35bfef3322296d6f2cbb49751cf3d8945f818c2076c4","last_reissued_at":"2026-05-18T01:08:28.705017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:28.705017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.01063","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:08:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hT9TX5ZjBjVQmseVy5NSY3poX7zxqN4xfmDsgcjng+4l4e0PQIEsHhlqRBYk8GnA/R5Qq7Rzdye7CKdNLXKRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:38:04.375292Z"},"content_sha256":"a9908ae337862d50990686dafe122be5dc4524d1f16b0536a2cfd2ce220d7d8f","schema_version":"1.0","event_id":"sha256:a9908ae337862d50990686dafe122be5dc4524d1f16b0536a2cfd2ce220d7d8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ICYLRCPGCWRITQCOGW766MZCFF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Structures of Maximizing Distributions of Feedback Capacity for General Channels with Memory & Applications","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","submitted_at":"2016-04-04T21:05:02Z","abstract_excerpt":"For any class of channel conditional distributions, with finite memory dependence on channel input RVs $A^n {\\stackrel{\\triangle}{=}} \\{A_i: i=0, \\ldots, n\\}$ or channel output RVs $B^n {\\stackrel{\\triangle}{=}} \\{B_i: i=0, \\ldots, n\\}$ or both, we characterize the sets of channel input distributions, which maximize directed information defined by $ I(A^n \\rightarrow B^n) {\\stackrel{\\triangle}{=}} \\sum_{i=0}^n I(A^i;B_i|B^{i-1}) $ and we derive the corresponding expressions, called \"characterizations of Finite Transmission Feedback Information (FTFI) capacity\". The main theorems state that opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01063","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:08:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nT5TFos698WHw/2mZsvfqQHjPHSuN4uHVW4PDoC/wkDS5BNbvexXXlLt2yUwSFJu42eW5tL+jTXGSGKrd0t3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:38:04.375655Z"},"content_sha256":"aa3a4b50af31b3d843c0f507e8ecdaef404eb7ee5a3614c08dd73eb0648eb414","schema_version":"1.0","event_id":"sha256:aa3a4b50af31b3d843c0f507e8ecdaef404eb7ee5a3614c08dd73eb0648eb414"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ICYLRCPGCWRITQCOGW766MZCFF/bundle.json","state_url":"https://pith.science/pith/ICYLRCPGCWRITQCOGW766MZCFF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ICYLRCPGCWRITQCOGW766MZCFF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T02:38:04Z","links":{"resolver":"https://pith.science/pith/ICYLRCPGCWRITQCOGW766MZCFF","bundle":"https://pith.science/pith/ICYLRCPGCWRITQCOGW766MZCFF/bundle.json","state":"https://pith.science/pith/ICYLRCPGCWRITQCOGW766MZCFF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ICYLRCPGCWRITQCOGW766MZCFF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ICYLRCPGCWRITQCOGW766MZCFF","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":"af24efb65aed58b0469032ea006b90dc20455a6a7ab194bd82750f82b555140f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-04T21:05:02Z","title_canon_sha256":"65fd1a318d94ff392b18b07477d43b80226bf263cebd1c8829b75bec62ff99e3"},"schema_version":"1.0","source":{"id":"1604.01063","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01063","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01063v2","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01063","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"pith_short_12","alias_value":"ICYLRCPGCWRI","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"ICYLRCPGCWRITQCO","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"ICYLRCPG","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:aa3a4b50af31b3d843c0f507e8ecdaef404eb7ee5a3614c08dd73eb0648eb414","target":"graph","created_at":"2026-05-18T01:08:28Z","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"},"paper":{"abstract_excerpt":"For any class of channel conditional distributions, with finite memory dependence on channel input RVs $A^n {\\stackrel{\\triangle}{=}} \\{A_i: i=0, \\ldots, n\\}$ or channel output RVs $B^n {\\stackrel{\\triangle}{=}} \\{B_i: i=0, \\ldots, n\\}$ or both, we characterize the sets of channel input distributions, which maximize directed information defined by $ I(A^n \\rightarrow B^n) {\\stackrel{\\triangle}{=}} \\sum_{i=0}^n I(A^i;B_i|B^{i-1}) $ and we derive the corresponding expressions, called \"characterizations of Finite Transmission Feedback Information (FTFI) capacity\". The main theorems state that opt","authors_text":"Charalambos D. Charalambous, Christos K. Kourtellaris","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-04T21:05:02Z","title":"Information Structures of Maximizing Distributions of Feedback Capacity for General Channels with Memory & Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01063","kind":"arxiv","version":2},"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:a9908ae337862d50990686dafe122be5dc4524d1f16b0536a2cfd2ce220d7d8f","target":"record","created_at":"2026-05-18T01:08:28Z","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":"af24efb65aed58b0469032ea006b90dc20455a6a7ab194bd82750f82b555140f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-04T21:05:02Z","title_canon_sha256":"65fd1a318d94ff392b18b07477d43b80226bf263cebd1c8829b75bec62ff99e3"},"schema_version":"1.0","source":{"id":"1604.01063","kind":"arxiv","version":2}},"canonical_sha256":"40b0b889e615a289c04e35bfef3322296d6f2cbb49751cf3d8945f818c2076c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40b0b889e615a289c04e35bfef3322296d6f2cbb49751cf3d8945f818c2076c4","first_computed_at":"2026-05-18T01:08:28.705017Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:28.705017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jqpr6LyOvi/27M+Pixtiktme6i9WxWm1lKPytVXStYtuSD/+66uGZ8RhNBV4ThV+JnD6S4AinAU+SqusaRwdCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:28.705609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01063","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9908ae337862d50990686dafe122be5dc4524d1f16b0536a2cfd2ce220d7d8f","sha256:aa3a4b50af31b3d843c0f507e8ecdaef404eb7ee5a3614c08dd73eb0648eb414"],"state_sha256":"16c664f190361961911086298a482df1ab2e3f456cbfda5869a08b3dbd027cb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t2UvNHW/EqhjISX0pTVVil+mLHZ0sbM+LF3Rz50rm2To0BsQIr7ukwu2PFsUURE1ZDDv6YVuW/FAyDWfL7ByAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:38:04.377560Z","bundle_sha256":"1cf119e277ca1bf20cb48c3718ef25e37eefa9ae967b82a0e2c113afaaa20f34"}}