{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KNGT6BUQNWKZPVUFTOAT7NS6BF","short_pith_number":"pith:KNGT6BUQ","canonical_record":{"source":{"id":"1710.07419","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-20T05:45:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d0081b917464aa5d57c78a963c902f9cd00942511cb235ed06bf8aeb8897e21e","abstract_canon_sha256":"69fa6425655edd3159dcaafc7a01d1037c13d89ce0664d0550a904bbd3510219"},"schema_version":"1.0"},"canonical_sha256":"534d3f06906d9597d6859b813fb65e09404a6247c2efb2eee33840f595ef058e","source":{"kind":"arxiv","id":"1710.07419","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07419","created_at":"2026-05-17T23:49:17Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07419v3","created_at":"2026-05-17T23:49:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07419","created_at":"2026-05-17T23:49:17Z"},{"alias_kind":"pith_short_12","alias_value":"KNGT6BUQNWKZ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KNGT6BUQNWKZPVUF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KNGT6BUQ","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KNGT6BUQNWKZPVUFTOAT7NS6BF","target":"record","payload":{"canonical_record":{"source":{"id":"1710.07419","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-20T05:45:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d0081b917464aa5d57c78a963c902f9cd00942511cb235ed06bf8aeb8897e21e","abstract_canon_sha256":"69fa6425655edd3159dcaafc7a01d1037c13d89ce0664d0550a904bbd3510219"},"schema_version":"1.0"},"canonical_sha256":"534d3f06906d9597d6859b813fb65e09404a6247c2efb2eee33840f595ef058e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:17.918536Z","signature_b64":"83y0WBYmTUq4V1WcNMBusxlMhMNNtMU8dlSeGNU5eZfhF9OUm01NO35CIxFsZidEltkqWczPomMajhxGrtUZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"534d3f06906d9597d6859b813fb65e09404a6247c2efb2eee33840f595ef058e","last_reissued_at":"2026-05-17T23:49:17.918013Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:17.918013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.07419","source_version":3,"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:49:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HEVu3BnlPl779TvsC/S9if4TKf9BiSYCT1fVw1ZY0fP324MAonnxZbvgOxU3w+P2Fx1pvIinJK6K07AnmHgpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:14:20.850484Z"},"content_sha256":"4053e4898d9d70d2b0ef5f772d21d0cf127db72e36f916c37088013a850f5869","schema_version":"1.0","event_id":"sha256:4053e4898d9d70d2b0ef5f772d21d0cf127db72e36f916c37088013a850f5869"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KNGT6BUQNWKZPVUFTOAT7NS6BF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Reliability Function of Lossy Source-Channel Coding of Variable-Length Codes with Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lan V. Truong, Vincent Y. F. Tan","submitted_at":"2017-10-20T05:45:36Z","abstract_excerpt":"We consider transmission of discrete memoryless sources (DMSes) across discrete memoryless channels (DMCs) using variable-length lossy source-channel codes with feedback. The reliability function (optimum error exponent) is shown to be equal to $\\max\\{0, B(1-R(D)/C)\\},$ where $R(D)$ is the rate-distortion function of the source, $B$ is the maximum relative entropy between output distributions of the DMC, and $C$ is the Shannon capacity of the channel. We show that, in this setting and in this asymptotic regime, separate source-channel coding is, in fact, optimal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07419","kind":"arxiv","version":3},"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:49:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"195hLaslPHeIC6Fmsdrm1Jn3SfGlSY8Ij+m2+vQUkot4PI4fgHW+tJThYtoatTlz3itmmiC74RmFj0gVzp/tDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:14:20.851134Z"},"content_sha256":"cad3a87568536e8b2ee2d6f5f7439d3bc08dddf5f8818ffe24210de260e48123","schema_version":"1.0","event_id":"sha256:cad3a87568536e8b2ee2d6f5f7439d3bc08dddf5f8818ffe24210de260e48123"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KNGT6BUQNWKZPVUFTOAT7NS6BF/bundle.json","state_url":"https://pith.science/pith/KNGT6BUQNWKZPVUFTOAT7NS6BF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KNGT6BUQNWKZPVUFTOAT7NS6BF/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-28T18:14:20Z","links":{"resolver":"https://pith.science/pith/KNGT6BUQNWKZPVUFTOAT7NS6BF","bundle":"https://pith.science/pith/KNGT6BUQNWKZPVUFTOAT7NS6BF/bundle.json","state":"https://pith.science/pith/KNGT6BUQNWKZPVUFTOAT7NS6BF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KNGT6BUQNWKZPVUFTOAT7NS6BF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KNGT6BUQNWKZPVUFTOAT7NS6BF","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":"69fa6425655edd3159dcaafc7a01d1037c13d89ce0664d0550a904bbd3510219","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-20T05:45:36Z","title_canon_sha256":"d0081b917464aa5d57c78a963c902f9cd00942511cb235ed06bf8aeb8897e21e"},"schema_version":"1.0","source":{"id":"1710.07419","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07419","created_at":"2026-05-17T23:49:17Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07419v3","created_at":"2026-05-17T23:49:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07419","created_at":"2026-05-17T23:49:17Z"},{"alias_kind":"pith_short_12","alias_value":"KNGT6BUQNWKZ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KNGT6BUQNWKZPVUF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KNGT6BUQ","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:cad3a87568536e8b2ee2d6f5f7439d3bc08dddf5f8818ffe24210de260e48123","target":"graph","created_at":"2026-05-17T23:49:17Z","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":"We consider transmission of discrete memoryless sources (DMSes) across discrete memoryless channels (DMCs) using variable-length lossy source-channel codes with feedback. The reliability function (optimum error exponent) is shown to be equal to $\\max\\{0, B(1-R(D)/C)\\},$ where $R(D)$ is the rate-distortion function of the source, $B$ is the maximum relative entropy between output distributions of the DMC, and $C$ is the Shannon capacity of the channel. We show that, in this setting and in this asymptotic regime, separate source-channel coding is, in fact, optimal.","authors_text":"Lan V. Truong, Vincent Y. F. Tan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-20T05:45:36Z","title":"The Reliability Function of Lossy Source-Channel Coding of Variable-Length Codes with Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07419","kind":"arxiv","version":3},"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:4053e4898d9d70d2b0ef5f772d21d0cf127db72e36f916c37088013a850f5869","target":"record","created_at":"2026-05-17T23:49:17Z","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":"69fa6425655edd3159dcaafc7a01d1037c13d89ce0664d0550a904bbd3510219","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-20T05:45:36Z","title_canon_sha256":"d0081b917464aa5d57c78a963c902f9cd00942511cb235ed06bf8aeb8897e21e"},"schema_version":"1.0","source":{"id":"1710.07419","kind":"arxiv","version":3}},"canonical_sha256":"534d3f06906d9597d6859b813fb65e09404a6247c2efb2eee33840f595ef058e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"534d3f06906d9597d6859b813fb65e09404a6247c2efb2eee33840f595ef058e","first_computed_at":"2026-05-17T23:49:17.918013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:17.918013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"83y0WBYmTUq4V1WcNMBusxlMhMNNtMU8dlSeGNU5eZfhF9OUm01NO35CIxFsZidEltkqWczPomMajhxGrtUZDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:17.918536Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07419","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4053e4898d9d70d2b0ef5f772d21d0cf127db72e36f916c37088013a850f5869","sha256:cad3a87568536e8b2ee2d6f5f7439d3bc08dddf5f8818ffe24210de260e48123"],"state_sha256":"4468f6f3f3f6f922168d2ae38d6291d141d8e1bea31069081ef17d96c954eb70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JnFH/BAPznwAtUu4/Fw5Fd8zOMRX0YC+TItBlB+Ytp2q+V4oX33QqRO6iCWpst/DUEzyqs3s1q9KCFSyF2MVBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:14:20.854385Z","bundle_sha256":"6ff5fde4bfeb9a4e8b238a8aefd3fea7222210ac9278aebfe9fe204385813c2e"}}