{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:535ONQYKY3KTVOM6ZVEYJSCCUX","short_pith_number":"pith:535ONQYK","canonical_record":{"source":{"id":"1907.08063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-18T14:11:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3229460b783308f44b0e771d5f6d6fe1197f0c8eea01ccfc01e355a9c829566b","abstract_canon_sha256":"1c570e834098e29a915de669d46c94a8cf28a45351b67d405cdde76df193cd10"},"schema_version":"1.0"},"canonical_sha256":"eefae6c30ac6d53ab99ecd4984c842a5c12b197c6e9633bd9acd767bdd87e2af","source":{"kind":"arxiv","id":"1907.08063","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08063","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08063v1","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08063","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"535ONQYKY3KT","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"535ONQYKY3KTVOM6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"535ONQYK","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:535ONQYKY3KTVOM6ZVEYJSCCUX","target":"record","payload":{"canonical_record":{"source":{"id":"1907.08063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-18T14:11:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3229460b783308f44b0e771d5f6d6fe1197f0c8eea01ccfc01e355a9c829566b","abstract_canon_sha256":"1c570e834098e29a915de669d46c94a8cf28a45351b67d405cdde76df193cd10"},"schema_version":"1.0"},"canonical_sha256":"eefae6c30ac6d53ab99ecd4984c842a5c12b197c6e9633bd9acd767bdd87e2af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:15.233158Z","signature_b64":"++YvpuDvRBrC+teMIfsyVqZKhmSm2gdu8saVrVVG/1y+1o5UpN00xPVaHqYBOqQZ0ZIbayP8vuvD7uyb5muQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eefae6c30ac6d53ab99ecd4984c842a5c12b197c6e9633bd9acd767bdd87e2af","last_reissued_at":"2026-05-17T23:40:15.232255Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:15.232255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.08063","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-17T23:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dTmfGBbF1bQlxC+1pYs02YzOsB7EudIyBYKqnjrbeLK6Rf3iJWLPVjXjlP6wVrKEn4EXbEQWNtlJLp7gECunBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:18:08.672523Z"},"content_sha256":"9b94d9dbbbcf1ac7530c5df6872b61d4c0871a2af396569a6e6592cc910976a1","schema_version":"1.0","event_id":"sha256:9b94d9dbbbcf1ac7530c5df6872b61d4c0871a2af396569a6e6592cc910976a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:535ONQYKY3KTVOM6ZVEYJSCCUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph-Based Encoders and their Performance for Finite-State Channels with Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bashar Huleihel, Haim Permuter, Oron Sabag","submitted_at":"2019-07-18T14:11:10Z","abstract_excerpt":"The capacity of unifilar finite-state channels in the presence of feedback is investigated. We derive a new evaluation method to extract graph-based encoders with their achievable rates, and to compute upper bounds to examine their performance. The evaluation method is built upon a recent methodology to derive simple bounds on the capacity using auxiliary directed graphs. While it is not clear whether the upper bound is convex, we manage to formulate it as a convex optimization problem using transformation of the argument with proper constraints. The lower bound is formulated as a non-convex o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08063","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-17T23:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qgIUek+VWsVCGltqspSH7x3aSueD5lcDn3oZGT21CUOesMlCk8PEDXyqZ/4mEgDY2/yJOLoKU/3vsFQP3kofBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:18:08.672883Z"},"content_sha256":"e596b97909c44b73a3f5babc0a9db386e4c71d786cd2072a50e80e899edf62da","schema_version":"1.0","event_id":"sha256:e596b97909c44b73a3f5babc0a9db386e4c71d786cd2072a50e80e899edf62da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/535ONQYKY3KTVOM6ZVEYJSCCUX/bundle.json","state_url":"https://pith.science/pith/535ONQYKY3KTVOM6ZVEYJSCCUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/535ONQYKY3KTVOM6ZVEYJSCCUX/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-01T05:18:08Z","links":{"resolver":"https://pith.science/pith/535ONQYKY3KTVOM6ZVEYJSCCUX","bundle":"https://pith.science/pith/535ONQYKY3KTVOM6ZVEYJSCCUX/bundle.json","state":"https://pith.science/pith/535ONQYKY3KTVOM6ZVEYJSCCUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/535ONQYKY3KTVOM6ZVEYJSCCUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:535ONQYKY3KTVOM6ZVEYJSCCUX","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":"1c570e834098e29a915de669d46c94a8cf28a45351b67d405cdde76df193cd10","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-18T14:11:10Z","title_canon_sha256":"3229460b783308f44b0e771d5f6d6fe1197f0c8eea01ccfc01e355a9c829566b"},"schema_version":"1.0","source":{"id":"1907.08063","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08063","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08063v1","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08063","created_at":"2026-05-17T23:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"535ONQYKY3KT","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"535ONQYKY3KTVOM6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"535ONQYK","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:e596b97909c44b73a3f5babc0a9db386e4c71d786cd2072a50e80e899edf62da","target":"graph","created_at":"2026-05-17T23:40:15Z","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":"The capacity of unifilar finite-state channels in the presence of feedback is investigated. We derive a new evaluation method to extract graph-based encoders with their achievable rates, and to compute upper bounds to examine their performance. The evaluation method is built upon a recent methodology to derive simple bounds on the capacity using auxiliary directed graphs. While it is not clear whether the upper bound is convex, we manage to formulate it as a convex optimization problem using transformation of the argument with proper constraints. The lower bound is formulated as a non-convex o","authors_text":"Bashar Huleihel, Haim Permuter, Oron Sabag","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-18T14:11:10Z","title":"Graph-Based Encoders and their Performance for Finite-State Channels with Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08063","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:9b94d9dbbbcf1ac7530c5df6872b61d4c0871a2af396569a6e6592cc910976a1","target":"record","created_at":"2026-05-17T23:40:15Z","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":"1c570e834098e29a915de669d46c94a8cf28a45351b67d405cdde76df193cd10","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-18T14:11:10Z","title_canon_sha256":"3229460b783308f44b0e771d5f6d6fe1197f0c8eea01ccfc01e355a9c829566b"},"schema_version":"1.0","source":{"id":"1907.08063","kind":"arxiv","version":1}},"canonical_sha256":"eefae6c30ac6d53ab99ecd4984c842a5c12b197c6e9633bd9acd767bdd87e2af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eefae6c30ac6d53ab99ecd4984c842a5c12b197c6e9633bd9acd767bdd87e2af","first_computed_at":"2026-05-17T23:40:15.232255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:15.232255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"++YvpuDvRBrC+teMIfsyVqZKhmSm2gdu8saVrVVG/1y+1o5UpN00xPVaHqYBOqQZ0ZIbayP8vuvD7uyb5muQCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:15.233158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08063","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b94d9dbbbcf1ac7530c5df6872b61d4c0871a2af396569a6e6592cc910976a1","sha256:e596b97909c44b73a3f5babc0a9db386e4c71d786cd2072a50e80e899edf62da"],"state_sha256":"f90cca060421893f1b2e05f82e5d72d6f64d57e9eeb5bb96314a906c988a79d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D7Akqg5XMWUmtnRzRsrr8lZ/2QPBs8kZE3+nXhxm8f8/PYiMpzLV1h4fwxL53u7MhKZejebXz6Idbqg3Tn2QAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:18:08.675649Z","bundle_sha256":"45bff7776ba6115044154c101c5b26e87133c6c466ac3d0208290cf0ba6abab7"}}