{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HBRPTWABZNVDS6GP2WQBCHVD74","short_pith_number":"pith:HBRPTWAB","canonical_record":{"source":{"id":"1701.06678","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T23:35:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"68fc8db476efa9c034a2fdc5f1dbd92cf6dd99d0649cc54b390e434423615e4f","abstract_canon_sha256":"60945cd834251c3e660f4abd10c0c9ca492fdf4dea0b33a78830d6270d96f390"},"schema_version":"1.0"},"canonical_sha256":"3862f9d801cb6a3978cfd5a0111ea3ff037a8aeb140bce21caeae5af0c740fee","source":{"kind":"arxiv","id":"1701.06678","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06678","created_at":"2026-05-18T00:40:40Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06678v4","created_at":"2026-05-18T00:40:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06678","created_at":"2026-05-18T00:40:40Z"},{"alias_kind":"pith_short_12","alias_value":"HBRPTWABZNVD","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HBRPTWABZNVDS6GP","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HBRPTWAB","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HBRPTWABZNVDS6GP2WQBCHVD74","target":"record","payload":{"canonical_record":{"source":{"id":"1701.06678","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T23:35:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"68fc8db476efa9c034a2fdc5f1dbd92cf6dd99d0649cc54b390e434423615e4f","abstract_canon_sha256":"60945cd834251c3e660f4abd10c0c9ca492fdf4dea0b33a78830d6270d96f390"},"schema_version":"1.0"},"canonical_sha256":"3862f9d801cb6a3978cfd5a0111ea3ff037a8aeb140bce21caeae5af0c740fee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:40.573051Z","signature_b64":"EfddOVtQVXGxJMHRIFXHlvNaT6ie5w1iaLqzDzS1PM5O4pp4kjlJFyHpJzfMlB1PKpOVXW2kYUBbtvSY9eJzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3862f9d801cb6a3978cfd5a0111ea3ff037a8aeb140bce21caeae5af0c740fee","last_reissued_at":"2026-05-18T00:40:40.572121Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:40.572121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.06678","source_version":4,"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-18T00:40:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a7nuMP66uNc0zmhgtS3j6jZldJNMLriq+cLI191Y+WDRKaGhmtoCMZ10gU729hmEsTQ11ll9Y0SEkdt14mteAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:57:43.009497Z"},"content_sha256":"ab41357e50ad78807f8b3f13f8dac871cf42fa9f5997dac9b87718cf130e71a6","schema_version":"1.0","event_id":"sha256:ab41357e50ad78807f8b3f13f8dac871cf42fa9f5997dac9b87718cf130e71a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HBRPTWABZNVDS6GP2WQBCHVD74","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variable-length codes for channels with memory and feedback: error-exponent upper bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Achilleas Anastasopoulos, Jui Wu","submitted_at":"2017-01-23T23:35:16Z","abstract_excerpt":"The reliability function of memoryless channels with noiseless feedback and variable-length coding has been found to be a linear function of the average rate in the classic work of Burnashev. In this work we consider unifilar channels with noiseless feedback and study upper bounds for the channel reliability function with variable length codes. In unifilar channels the channel state is known to the transmitter but is unknown to the receiver. We generalize Burnashev's analysis and derive a similar expression which is linear in average rate and depends on the channel capacity, as well as an addi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06678","kind":"arxiv","version":4},"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-18T00:40:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w/y1w3T3QU1bmUIp/jSlvrs3ByuRKcMpITAzdsnXOhh7ByyLhCASIzC2gAXJE/Te5qDpjGCIbXS/HOwvRT+aAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:57:43.010156Z"},"content_sha256":"28e0a5cc6c9742221290b7148214685ca8cbfbdbf298d67aa7bdaf7d2612c9b8","schema_version":"1.0","event_id":"sha256:28e0a5cc6c9742221290b7148214685ca8cbfbdbf298d67aa7bdaf7d2612c9b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HBRPTWABZNVDS6GP2WQBCHVD74/bundle.json","state_url":"https://pith.science/pith/HBRPTWABZNVDS6GP2WQBCHVD74/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HBRPTWABZNVDS6GP2WQBCHVD74/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-11T22:57:43Z","links":{"resolver":"https://pith.science/pith/HBRPTWABZNVDS6GP2WQBCHVD74","bundle":"https://pith.science/pith/HBRPTWABZNVDS6GP2WQBCHVD74/bundle.json","state":"https://pith.science/pith/HBRPTWABZNVDS6GP2WQBCHVD74/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HBRPTWABZNVDS6GP2WQBCHVD74/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HBRPTWABZNVDS6GP2WQBCHVD74","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":"60945cd834251c3e660f4abd10c0c9ca492fdf4dea0b33a78830d6270d96f390","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T23:35:16Z","title_canon_sha256":"68fc8db476efa9c034a2fdc5f1dbd92cf6dd99d0649cc54b390e434423615e4f"},"schema_version":"1.0","source":{"id":"1701.06678","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06678","created_at":"2026-05-18T00:40:40Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06678v4","created_at":"2026-05-18T00:40:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06678","created_at":"2026-05-18T00:40:40Z"},{"alias_kind":"pith_short_12","alias_value":"HBRPTWABZNVD","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HBRPTWABZNVDS6GP","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HBRPTWAB","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:28e0a5cc6c9742221290b7148214685ca8cbfbdbf298d67aa7bdaf7d2612c9b8","target":"graph","created_at":"2026-05-18T00:40:40Z","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 reliability function of memoryless channels with noiseless feedback and variable-length coding has been found to be a linear function of the average rate in the classic work of Burnashev. In this work we consider unifilar channels with noiseless feedback and study upper bounds for the channel reliability function with variable length codes. In unifilar channels the channel state is known to the transmitter but is unknown to the receiver. We generalize Burnashev's analysis and derive a similar expression which is linear in average rate and depends on the channel capacity, as well as an addi","authors_text":"Achilleas Anastasopoulos, Jui Wu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T23:35:16Z","title":"Variable-length codes for channels with memory and feedback: error-exponent upper bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06678","kind":"arxiv","version":4},"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:ab41357e50ad78807f8b3f13f8dac871cf42fa9f5997dac9b87718cf130e71a6","target":"record","created_at":"2026-05-18T00:40:40Z","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":"60945cd834251c3e660f4abd10c0c9ca492fdf4dea0b33a78830d6270d96f390","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-23T23:35:16Z","title_canon_sha256":"68fc8db476efa9c034a2fdc5f1dbd92cf6dd99d0649cc54b390e434423615e4f"},"schema_version":"1.0","source":{"id":"1701.06678","kind":"arxiv","version":4}},"canonical_sha256":"3862f9d801cb6a3978cfd5a0111ea3ff037a8aeb140bce21caeae5af0c740fee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3862f9d801cb6a3978cfd5a0111ea3ff037a8aeb140bce21caeae5af0c740fee","first_computed_at":"2026-05-18T00:40:40.572121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:40.572121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EfddOVtQVXGxJMHRIFXHlvNaT6ie5w1iaLqzDzS1PM5O4pp4kjlJFyHpJzfMlB1PKpOVXW2kYUBbtvSY9eJzAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:40.573051Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06678","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab41357e50ad78807f8b3f13f8dac871cf42fa9f5997dac9b87718cf130e71a6","sha256:28e0a5cc6c9742221290b7148214685ca8cbfbdbf298d67aa7bdaf7d2612c9b8"],"state_sha256":"744d63e0f588b547aed6427df1025244edbf21e6719332ac8d121fb876f764b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7A3ZBCbjdUG9fTCMRBwTc2hbfEzB1vIGgzuzfVY6UqTLCe5cr/uQqas2oH3+Utofvrn1+wCsd9KrrHwHojr/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:57:43.013718Z","bundle_sha256":"4c6d0825aacff21fc33edc06e9c1625b191b2dae3777b4109eb1c29c8db12183"}}