{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4L2GJGHXKDP7GUWB7CAL6XLCA3","short_pith_number":"pith:4L2GJGHX","canonical_record":{"source":{"id":"1604.01878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-07T05:44:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fa2db783bb31ca0efcc23a564de74718b00a7e2d43cdf601996cbb95daa56320","abstract_canon_sha256":"52d8a35e8b557545056ae128d85578ac87f38fb0e5cf8defc44ec0b93e234fa0"},"schema_version":"1.0"},"canonical_sha256":"e2f46498f750dff352c1f880bf5d6206e395078cf40015a9e66fb96ed0dc2a3a","source":{"kind":"arxiv","id":"1604.01878","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01878","created_at":"2026-05-18T01:17:31Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01878v1","created_at":"2026-05-18T01:17:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01878","created_at":"2026-05-18T01:17:31Z"},{"alias_kind":"pith_short_12","alias_value":"4L2GJGHXKDP7","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4L2GJGHXKDP7GUWB","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4L2GJGHX","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4L2GJGHXKDP7GUWB7CAL6XLCA3","target":"record","payload":{"canonical_record":{"source":{"id":"1604.01878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-07T05:44:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fa2db783bb31ca0efcc23a564de74718b00a7e2d43cdf601996cbb95daa56320","abstract_canon_sha256":"52d8a35e8b557545056ae128d85578ac87f38fb0e5cf8defc44ec0b93e234fa0"},"schema_version":"1.0"},"canonical_sha256":"e2f46498f750dff352c1f880bf5d6206e395078cf40015a9e66fb96ed0dc2a3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:31.825656Z","signature_b64":"DnxQq13ytSEgPnEtwY/HtAtNWWCokjVk95I59Fbb3OxKJXy0YrL1h4UPnvEXdzqusOsk/AdFJJK4xjrn+QDHCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2f46498f750dff352c1f880bf5d6206e395078cf40015a9e66fb96ed0dc2a3a","last_reissued_at":"2026-05-18T01:17:31.824934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:31.824934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.01878","source_version":1,"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:17:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0lL2n6Fzdvl91nAawaT4s4KKfbFZILf+NG5my+LjPmAhgSxQDwDJ/utp7lZa0/MfcUulTmpKdYmyIWTt4K4cAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:53:16.028892Z"},"content_sha256":"e36c10efad1f3d0488a6dcb6ac6fb52deeaec27d81727409cd1c39b0069084af","schema_version":"1.0","event_id":"sha256:e36c10efad1f3d0488a6dcb6ac6fb52deeaec27d81727409cd1c39b0069084af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4L2GJGHXKDP7GUWB7CAL6XLCA3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Single-Letter Upper Bound on the Feedback Capacity of Unifilar Finite-State Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haim H. Permuter, Henry D. Pfister, Oron Sabag","submitted_at":"2016-04-07T05:44:31Z","abstract_excerpt":"An upper bound on the feedback capacity of unifilar finite-state channels (FSCs) is derived. A new technique, called the $Q$-contexts, is based on a construction of a directed graph that is used to quantize recursively the receiver's output sequences to a finite set of contexts. For any choice of $Q$-graph, the feedback capacity is bounded by a single-letter expression, $C_\\text{fb}\\leq \\sup I(X,S;Y|Q)$, where the supremum is over $P_{X|S,Q}$ and the distribution of $(S,Q)$ is their stationary distribution. It is shown that the bound is tight for all unifilar FSCs where feedback capacity is kn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01878","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"},"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:17:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ENQtlpwBl4mXbUg5AnODXlpejnXO4NdemU7mLDMdhtOBI8NLuIkfKsIKisSO/6XL1mmmLkSuroHXctK8O8sNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:53:16.029520Z"},"content_sha256":"0095f3081a3eb2ac22bf1bcbe8f8f3a9870440b0cf3330f71d08e7ddfca08a70","schema_version":"1.0","event_id":"sha256:0095f3081a3eb2ac22bf1bcbe8f8f3a9870440b0cf3330f71d08e7ddfca08a70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4L2GJGHXKDP7GUWB7CAL6XLCA3/bundle.json","state_url":"https://pith.science/pith/4L2GJGHXKDP7GUWB7CAL6XLCA3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4L2GJGHXKDP7GUWB7CAL6XLCA3/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-05-27T11:53:16Z","links":{"resolver":"https://pith.science/pith/4L2GJGHXKDP7GUWB7CAL6XLCA3","bundle":"https://pith.science/pith/4L2GJGHXKDP7GUWB7CAL6XLCA3/bundle.json","state":"https://pith.science/pith/4L2GJGHXKDP7GUWB7CAL6XLCA3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4L2GJGHXKDP7GUWB7CAL6XLCA3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4L2GJGHXKDP7GUWB7CAL6XLCA3","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":"52d8a35e8b557545056ae128d85578ac87f38fb0e5cf8defc44ec0b93e234fa0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-07T05:44:31Z","title_canon_sha256":"fa2db783bb31ca0efcc23a564de74718b00a7e2d43cdf601996cbb95daa56320"},"schema_version":"1.0","source":{"id":"1604.01878","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01878","created_at":"2026-05-18T01:17:31Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01878v1","created_at":"2026-05-18T01:17:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01878","created_at":"2026-05-18T01:17:31Z"},{"alias_kind":"pith_short_12","alias_value":"4L2GJGHXKDP7","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4L2GJGHXKDP7GUWB","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4L2GJGHX","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:0095f3081a3eb2ac22bf1bcbe8f8f3a9870440b0cf3330f71d08e7ddfca08a70","target":"graph","created_at":"2026-05-18T01:17:31Z","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":"An upper bound on the feedback capacity of unifilar finite-state channels (FSCs) is derived. A new technique, called the $Q$-contexts, is based on a construction of a directed graph that is used to quantize recursively the receiver's output sequences to a finite set of contexts. For any choice of $Q$-graph, the feedback capacity is bounded by a single-letter expression, $C_\\text{fb}\\leq \\sup I(X,S;Y|Q)$, where the supremum is over $P_{X|S,Q}$ and the distribution of $(S,Q)$ is their stationary distribution. It is shown that the bound is tight for all unifilar FSCs where feedback capacity is kn","authors_text":"Haim H. Permuter, Henry D. Pfister, Oron Sabag","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-07T05:44:31Z","title":"A Single-Letter Upper Bound on the Feedback Capacity of Unifilar Finite-State Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01878","kind":"arxiv","version":1},"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:e36c10efad1f3d0488a6dcb6ac6fb52deeaec27d81727409cd1c39b0069084af","target":"record","created_at":"2026-05-18T01:17:31Z","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":"52d8a35e8b557545056ae128d85578ac87f38fb0e5cf8defc44ec0b93e234fa0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-07T05:44:31Z","title_canon_sha256":"fa2db783bb31ca0efcc23a564de74718b00a7e2d43cdf601996cbb95daa56320"},"schema_version":"1.0","source":{"id":"1604.01878","kind":"arxiv","version":1}},"canonical_sha256":"e2f46498f750dff352c1f880bf5d6206e395078cf40015a9e66fb96ed0dc2a3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2f46498f750dff352c1f880bf5d6206e395078cf40015a9e66fb96ed0dc2a3a","first_computed_at":"2026-05-18T01:17:31.824934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:31.824934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DnxQq13ytSEgPnEtwY/HtAtNWWCokjVk95I59Fbb3OxKJXy0YrL1h4UPnvEXdzqusOsk/AdFJJK4xjrn+QDHCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:31.825656Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01878","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e36c10efad1f3d0488a6dcb6ac6fb52deeaec27d81727409cd1c39b0069084af","sha256:0095f3081a3eb2ac22bf1bcbe8f8f3a9870440b0cf3330f71d08e7ddfca08a70"],"state_sha256":"cad510c708800b5844b3dc515660df01bf133697b50392e2458b15ddbfc69fcf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cH6LUYKycGM7J6hTj/5+FPovigCOkYZtvr9s6kD3pk5o9WG4X6MgRZIw6WGEWXAEiZAf6gpiNIBJtJcjADhTCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:53:16.032877Z","bundle_sha256":"d8078651c0a18268a43e0bc3301a4b11b82c74c59813332187efe0c55a7ac08e"}}