{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:CLE7M6FPAUSYSXUET26SUQXQ3U","short_pith_number":"pith:CLE7M6FP","canonical_record":{"source":{"id":"1112.1687","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T20:57:16Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"d9dc4a57ab6d0025ba6704f08384191a7f2105864c3e1412194f4b46791fe267","abstract_canon_sha256":"1bf38fbf9521d59f2026e20dc9a7ded3cdddbdfe52f03f36206258910673a99f"},"schema_version":"1.0"},"canonical_sha256":"12c9f678af0525895e849ebd2a42f0dd2e4663b1943695d43f44755007522b32","source":{"kind":"arxiv","id":"1112.1687","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1687","created_at":"2026-05-18T03:32:45Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1687v5","created_at":"2026-05-18T03:32:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1687","created_at":"2026-05-18T03:32:45Z"},{"alias_kind":"pith_short_12","alias_value":"CLE7M6FPAUSY","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CLE7M6FPAUSYSXUE","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CLE7M6FP","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:CLE7M6FPAUSYSXUET26SUQXQ3U","target":"record","payload":{"canonical_record":{"source":{"id":"1112.1687","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T20:57:16Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"d9dc4a57ab6d0025ba6704f08384191a7f2105864c3e1412194f4b46791fe267","abstract_canon_sha256":"1bf38fbf9521d59f2026e20dc9a7ded3cdddbdfe52f03f36206258910673a99f"},"schema_version":"1.0"},"canonical_sha256":"12c9f678af0525895e849ebd2a42f0dd2e4663b1943695d43f44755007522b32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:45.454186Z","signature_b64":"h8jXWny+NLjqY2/Inqi6ycG5KhUf3igo3ghS9RpFLccPBmuXzOh4GD7mZCIxAq3ISMhFOy04GOkLL2l1PK/iBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12c9f678af0525895e849ebd2a42f0dd2e4663b1943695d43f44755007522b32","last_reissued_at":"2026-05-18T03:32:45.453552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:45.453552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.1687","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-18T03:32:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NNPi396lV5dbWqueOV9wZkGyBm5k0OIkByR7jjaQLBmlIb/HbGwZXI8j1v5VABwL0n4JPLqIk6kZh+T1RhrMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:05:01.484016Z"},"content_sha256":"e03d24f338312cd9d11e663e571e778f5e720e20ecb854c323f6aa2693727705","schema_version":"1.0","event_id":"sha256:e03d24f338312cd9d11e663e571e778f5e720e20ecb854c323f6aa2693727705"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:CLE7M6FPAUSYSXUET26SUQXQ3U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-asymptotic information theoretic bound for some multi-party scenarios","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Naqueeb Ahmad Warsi, Naresh Sharma","submitted_at":"2011-12-07T20:57:16Z","abstract_excerpt":"In the last few years, there has been a great interest in extending the information-theoretic scenario for the non-asymptotic or one-shot case, i.e., where the channel is used only once. We provide the one-shot rate region for the distributed source-coding (Slepian-Wolf) and the multiple-access channel. Our results are based on defining a novel one-shot typical set based on smooth entropies that yields the one-shot achievable rate regions while leveraging the results from the asymptotic analysis. Our results are asymptotically optimal, i.e., for the distributed source coding they yield the sam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1687","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-18T03:32:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gMghwQ7SgxoW4PJDkF0drQpHabmp/vt0iVwWsCRQYKMgwDecoAqnbkwiR3d7r7/0BOYv2j/30a0P8bp8/WKnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:05:01.484382Z"},"content_sha256":"d107ac60c0f044576da56fe35e03b3bebf5891d70e6c23de4a2f3e77ad39a646","schema_version":"1.0","event_id":"sha256:d107ac60c0f044576da56fe35e03b3bebf5891d70e6c23de4a2f3e77ad39a646"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CLE7M6FPAUSYSXUET26SUQXQ3U/bundle.json","state_url":"https://pith.science/pith/CLE7M6FPAUSYSXUET26SUQXQ3U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CLE7M6FPAUSYSXUET26SUQXQ3U/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-02T07:05:01Z","links":{"resolver":"https://pith.science/pith/CLE7M6FPAUSYSXUET26SUQXQ3U","bundle":"https://pith.science/pith/CLE7M6FPAUSYSXUET26SUQXQ3U/bundle.json","state":"https://pith.science/pith/CLE7M6FPAUSYSXUET26SUQXQ3U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CLE7M6FPAUSYSXUET26SUQXQ3U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CLE7M6FPAUSYSXUET26SUQXQ3U","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":"1bf38fbf9521d59f2026e20dc9a7ded3cdddbdfe52f03f36206258910673a99f","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T20:57:16Z","title_canon_sha256":"d9dc4a57ab6d0025ba6704f08384191a7f2105864c3e1412194f4b46791fe267"},"schema_version":"1.0","source":{"id":"1112.1687","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1687","created_at":"2026-05-18T03:32:45Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1687v5","created_at":"2026-05-18T03:32:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1687","created_at":"2026-05-18T03:32:45Z"},{"alias_kind":"pith_short_12","alias_value":"CLE7M6FPAUSY","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CLE7M6FPAUSYSXUE","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CLE7M6FP","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:d107ac60c0f044576da56fe35e03b3bebf5891d70e6c23de4a2f3e77ad39a646","target":"graph","created_at":"2026-05-18T03:32:45Z","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":"In the last few years, there has been a great interest in extending the information-theoretic scenario for the non-asymptotic or one-shot case, i.e., where the channel is used only once. We provide the one-shot rate region for the distributed source-coding (Slepian-Wolf) and the multiple-access channel. Our results are based on defining a novel one-shot typical set based on smooth entropies that yields the one-shot achievable rate regions while leveraging the results from the asymptotic analysis. Our results are asymptotically optimal, i.e., for the distributed source coding they yield the sam","authors_text":"Naqueeb Ahmad Warsi, Naresh Sharma","cross_cats":["math.IT","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T20:57:16Z","title":"Non-asymptotic information theoretic bound for some multi-party scenarios"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1687","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:e03d24f338312cd9d11e663e571e778f5e720e20ecb854c323f6aa2693727705","target":"record","created_at":"2026-05-18T03:32:45Z","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":"1bf38fbf9521d59f2026e20dc9a7ded3cdddbdfe52f03f36206258910673a99f","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-07T20:57:16Z","title_canon_sha256":"d9dc4a57ab6d0025ba6704f08384191a7f2105864c3e1412194f4b46791fe267"},"schema_version":"1.0","source":{"id":"1112.1687","kind":"arxiv","version":5}},"canonical_sha256":"12c9f678af0525895e849ebd2a42f0dd2e4663b1943695d43f44755007522b32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12c9f678af0525895e849ebd2a42f0dd2e4663b1943695d43f44755007522b32","first_computed_at":"2026-05-18T03:32:45.453552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:45.453552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h8jXWny+NLjqY2/Inqi6ycG5KhUf3igo3ghS9RpFLccPBmuXzOh4GD7mZCIxAq3ISMhFOy04GOkLL2l1PK/iBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:45.454186Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1687","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e03d24f338312cd9d11e663e571e778f5e720e20ecb854c323f6aa2693727705","sha256:d107ac60c0f044576da56fe35e03b3bebf5891d70e6c23de4a2f3e77ad39a646"],"state_sha256":"530a1fde9cf49be50da8db3a9cb9157a7720f56ed5e16a8444330c8785e0411f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6j0k7JTg37BeTXPx4fstwzqbVvMefjNpXJ6VVpfU79LbzDuATSrNXtun1dxFz0X9pagSGex4f19lrD+Vnp3sCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:05:01.486344Z","bundle_sha256":"ee5532d880341413d6bfd6fca485eb16364c2edc60c92dd9e6dae27408a0a9f1"}}