{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4L2GJGHXKDP7GUWB7CAL6XLCA3","short_pith_number":"pith:4L2GJGHX","schema_version":"1.0","canonical_sha256":"e2f46498f750dff352c1f880bf5d6206e395078cf40015a9e66fb96ed0dc2a3a","source":{"kind":"arxiv","id":"1604.01878","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.01878","created_at":"2026-05-18T01:17:31.825034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.01878v1","created_at":"2026-05-18T01:17:31.825034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01878","created_at":"2026-05-18T01:17:31.825034+00:00"},{"alias_kind":"pith_short_12","alias_value":"4L2GJGHXKDP7","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4L2GJGHXKDP7GUWB","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4L2GJGHX","created_at":"2026-05-18T12:29:58.707656+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/4L2GJGHXKDP7GUWB7CAL6XLCA3","json":"https://pith.science/pith/4L2GJGHXKDP7GUWB7CAL6XLCA3.json","graph_json":"https://pith.science/api/pith-number/4L2GJGHXKDP7GUWB7CAL6XLCA3/graph.json","events_json":"https://pith.science/api/pith-number/4L2GJGHXKDP7GUWB7CAL6XLCA3/events.json","paper":"https://pith.science/paper/4L2GJGHX"},"agent_actions":{"view_html":"https://pith.science/pith/4L2GJGHXKDP7GUWB7CAL6XLCA3","download_json":"https://pith.science/pith/4L2GJGHXKDP7GUWB7CAL6XLCA3.json","view_paper":"https://pith.science/paper/4L2GJGHX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.01878&json=true","fetch_graph":"https://pith.science/api/pith-number/4L2GJGHXKDP7GUWB7CAL6XLCA3/graph.json","fetch_events":"https://pith.science/api/pith-number/4L2GJGHXKDP7GUWB7CAL6XLCA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4L2GJGHXKDP7GUWB7CAL6XLCA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4L2GJGHXKDP7GUWB7CAL6XLCA3/action/storage_attestation","attest_author":"https://pith.science/pith/4L2GJGHXKDP7GUWB7CAL6XLCA3/action/author_attestation","sign_citation":"https://pith.science/pith/4L2GJGHXKDP7GUWB7CAL6XLCA3/action/citation_signature","submit_replication":"https://pith.science/pith/4L2GJGHXKDP7GUWB7CAL6XLCA3/action/replication_record"}},"created_at":"2026-05-18T01:17:31.825034+00:00","updated_at":"2026-05-18T01:17:31.825034+00:00"}