{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ICTQRAZHTWRHRIZGCSQ36JHBYO","short_pith_number":"pith:ICTQRAZH","canonical_record":{"source":{"id":"1301.6467","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T08:13:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e866a59f577fe9e98b1c6b00950222cc1601a87ee76de92d38b6390ef776ed7d","abstract_canon_sha256":"6af52696bfc3f7298c22407f0b65b683d333b5a112ad440eb34521d33dada2fb"},"schema_version":"1.0"},"canonical_sha256":"40a70883279da278a32614a1bf24e1c3aa89dd3890d2953e5b577d0b14808786","source":{"kind":"arxiv","id":"1301.6467","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6467","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6467v5","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6467","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"ICTQRAZHTWRH","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"ICTQRAZHTWRHRIZG","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"ICTQRAZH","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ICTQRAZHTWRHRIZGCSQ36JHBYO","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6467","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T08:13:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e866a59f577fe9e98b1c6b00950222cc1601a87ee76de92d38b6390ef776ed7d","abstract_canon_sha256":"6af52696bfc3f7298c22407f0b65b683d333b5a112ad440eb34521d33dada2fb"},"schema_version":"1.0"},"canonical_sha256":"40a70883279da278a32614a1bf24e1c3aa89dd3890d2953e5b577d0b14808786","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:32.723418Z","signature_b64":"W7gUezwgXHuA0nbnyZ8gJH7MRnvkWKOiKPKo1x8IcdcHXinvZkawsQk1wnrdPfFrdDUIwcpX5ornDyto+hXTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40a70883279da278a32614a1bf24e1c3aa89dd3890d2953e5b577d0b14808786","last_reissued_at":"2026-05-18T02:30:32.722833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:32.722833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6467","source_version":5,"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-18T02:30:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W0hZOZOqASTUXNfy4wvw7MPaJv7Dg6s9D24kLhcTvtd6tUH3IWN3NK14HOZ73URL+lcYIoA9qS1PIVNR3omnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:20:41.647976Z"},"content_sha256":"67f1e2e0b5508b05287649f565a32f77fabe4ace8ec3f2504206c103a6298578","schema_version":"1.0","event_id":"sha256:67f1e2e0b5508b05287649f565a32f77fabe4ace8ec3f2504206c103a6298578"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ICTQRAZHTWRHRIZGCSQ36JHBYO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Asymptotic and Second-Order Achievability Bounds for Coding With Side-Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Shigeaki Kuzuoka, Shun Watanabe, Vincent Y. F. Tan","submitted_at":"2013-01-28T08:13:51Z","abstract_excerpt":"We present novel non-asymptotic or finite blocklength achievability bounds for three side-information problems in network information theory. These include (i) the Wyner-Ahlswede-Korner (WAK) problem of almost-lossless source coding with rate-limited side-information, (ii) the Wyner-Ziv (WZ) problem of lossy source coding with side-information at the decoder and (iii) the Gel'fand-Pinsker (GP) problem of channel coding with noncausal state information available at the encoder. The bounds are proved using ideas from channel simulation and channel resolvability. Our bounds for all three problems"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6467","kind":"arxiv","version":5},"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-18T02:30:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Zh6Dpo6tHfJGj93qgTmb/ToTzBV4dHQcf5MqFMwGFg8NhXAbj2dfdzS8TaMXxvLxXWZbEnSLQeQ4XdnduJWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:20:41.648593Z"},"content_sha256":"553380a4559b8ad9b0fa31c8dc9724bc1d6d8853ac13f45ee29ec7e9618f20eb","schema_version":"1.0","event_id":"sha256:553380a4559b8ad9b0fa31c8dc9724bc1d6d8853ac13f45ee29ec7e9618f20eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ICTQRAZHTWRHRIZGCSQ36JHBYO/bundle.json","state_url":"https://pith.science/pith/ICTQRAZHTWRHRIZGCSQ36JHBYO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ICTQRAZHTWRHRIZGCSQ36JHBYO/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-27T04:20:41Z","links":{"resolver":"https://pith.science/pith/ICTQRAZHTWRHRIZGCSQ36JHBYO","bundle":"https://pith.science/pith/ICTQRAZHTWRHRIZGCSQ36JHBYO/bundle.json","state":"https://pith.science/pith/ICTQRAZHTWRHRIZGCSQ36JHBYO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ICTQRAZHTWRHRIZGCSQ36JHBYO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ICTQRAZHTWRHRIZGCSQ36JHBYO","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":"6af52696bfc3f7298c22407f0b65b683d333b5a112ad440eb34521d33dada2fb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T08:13:51Z","title_canon_sha256":"e866a59f577fe9e98b1c6b00950222cc1601a87ee76de92d38b6390ef776ed7d"},"schema_version":"1.0","source":{"id":"1301.6467","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6467","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6467v5","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6467","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"ICTQRAZHTWRH","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"ICTQRAZHTWRHRIZG","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"ICTQRAZH","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:553380a4559b8ad9b0fa31c8dc9724bc1d6d8853ac13f45ee29ec7e9618f20eb","target":"graph","created_at":"2026-05-18T02:30:32Z","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 present novel non-asymptotic or finite blocklength achievability bounds for three side-information problems in network information theory. These include (i) the Wyner-Ahlswede-Korner (WAK) problem of almost-lossless source coding with rate-limited side-information, (ii) the Wyner-Ziv (WZ) problem of lossy source coding with side-information at the decoder and (iii) the Gel'fand-Pinsker (GP) problem of channel coding with noncausal state information available at the encoder. The bounds are proved using ideas from channel simulation and channel resolvability. Our bounds for all three problems","authors_text":"Shigeaki Kuzuoka, Shun Watanabe, Vincent Y. F. Tan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T08:13:51Z","title":"Non-Asymptotic and Second-Order Achievability Bounds for Coding With Side-Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6467","kind":"arxiv","version":5},"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:67f1e2e0b5508b05287649f565a32f77fabe4ace8ec3f2504206c103a6298578","target":"record","created_at":"2026-05-18T02:30:32Z","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":"6af52696bfc3f7298c22407f0b65b683d333b5a112ad440eb34521d33dada2fb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T08:13:51Z","title_canon_sha256":"e866a59f577fe9e98b1c6b00950222cc1601a87ee76de92d38b6390ef776ed7d"},"schema_version":"1.0","source":{"id":"1301.6467","kind":"arxiv","version":5}},"canonical_sha256":"40a70883279da278a32614a1bf24e1c3aa89dd3890d2953e5b577d0b14808786","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40a70883279da278a32614a1bf24e1c3aa89dd3890d2953e5b577d0b14808786","first_computed_at":"2026-05-18T02:30:32.722833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:32.722833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W7gUezwgXHuA0nbnyZ8gJH7MRnvkWKOiKPKo1x8IcdcHXinvZkawsQk1wnrdPfFrdDUIwcpX5ornDyto+hXTAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:32.723418Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6467","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67f1e2e0b5508b05287649f565a32f77fabe4ace8ec3f2504206c103a6298578","sha256:553380a4559b8ad9b0fa31c8dc9724bc1d6d8853ac13f45ee29ec7e9618f20eb"],"state_sha256":"02eebea8c322be9b151433628a4ddc6617ddb4ffe541c441589aca89098c7cc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iAz2zHHiiw7uf4a676xbdYoEZXFewLBSjBIbGMWR/pp22Uoh2u0INLgVTDVmU9e4UKYVrpfZ2/8X09XO0n1PCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:20:41.651850Z","bundle_sha256":"a7bde3cc51889103b87251069dbe81d95c09e2807bd2d01a9776b05336587b27"}}