{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4M73V5U4EWQ5DFXUGEQ4YY37QK","short_pith_number":"pith:4M73V5U4","canonical_record":{"source":{"id":"1903.07597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-18T17:43:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"825c2af26da8810d8843adf04c3174f0b7c9fed5bf028f4488caf54c7f934fa5","abstract_canon_sha256":"cbfc83cc810203b150cc0f65195cd84e425e8d52e055351ee82e21cd096b0773"},"schema_version":"1.0"},"canonical_sha256":"e33fbaf69c25a1d196f43121cc637f82ab92d6749486dae7f75c401acd6f29ce","source":{"kind":"arxiv","id":"1903.07597","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07597","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07597v1","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07597","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"pith_short_12","alias_value":"4M73V5U4EWQ5","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4M73V5U4EWQ5DFXU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4M73V5U4","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4M73V5U4EWQ5DFXUGEQ4YY37QK","target":"record","payload":{"canonical_record":{"source":{"id":"1903.07597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-18T17:43:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"825c2af26da8810d8843adf04c3174f0b7c9fed5bf028f4488caf54c7f934fa5","abstract_canon_sha256":"cbfc83cc810203b150cc0f65195cd84e425e8d52e055351ee82e21cd096b0773"},"schema_version":"1.0"},"canonical_sha256":"e33fbaf69c25a1d196f43121cc637f82ab92d6749486dae7f75c401acd6f29ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:00.911566Z","signature_b64":"Paf0S1ZMe9IxszMyhD4ynMg5cxK0qdzwTdsToaXi8+339dZGQPOIdHHwmlr/VYk63FY7GFhVKKIlNQ9fnzHHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e33fbaf69c25a1d196f43121cc637f82ab92d6749486dae7f75c401acd6f29ce","last_reissued_at":"2026-05-17T23:51:00.910820Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:00.910820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.07597","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:51:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HhSKW1z2tLKH66hJCShcXNMs1dvxvU7AvIwIIqQQyswExhz00MvnHfakr1Qwiz+Mwk2Zr5ZCrbtZD2OQQ2xyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:09:23.097409Z"},"content_sha256":"62e4f5e56df1c89d897e1c0741e0ffae2c383c19d32fbc7685e39150d7396159","schema_version":"1.0","event_id":"sha256:62e4f5e56df1c89d897e1c0741e0ffae2c383c19d32fbc7685e39150d7396159"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4M73V5U4EWQ5DFXUGEQ4YY37QK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Capacity of Computation Broadcast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hua Sun, Syed A. Jafar","submitted_at":"2019-03-18T17:43:29Z","abstract_excerpt":"The two-user computation broadcast problem is introduced as the setting where User $1$ wants message $W_1$ and has side-information $W_1'$, User $2$ wants message $W_2$ and has side-information $W_2'$, and $(W_1, W_1', W_2, W_2')$ may have arbitrary dependencies. The rate of a computation broadcast scheme is defined as the ratio $H(W_1,W_2)/H(S)$, where $S$ is the information broadcast to both users to simultaneously satisfy their demands. The supremum of achievable rates is called the capacity of computation broadcast $C_{{CB}}$. It is shown that $C_{{CB}}\\leq H(W_1,W_2)/\\left[H(W_1|W_1')+H(W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07597","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:51:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nSA150e4s/Pr0X1EQAE5eGy0ikQuwHzNVE+uFvPxtZQ94qBqiFSOzOFbyXekC1lL5cy7qAopEEdx0BGnYfmFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:09:23.097765Z"},"content_sha256":"1afafbd3e693e217854eb4371bcd0aa84100a7f95764d7cd01723695886f5365","schema_version":"1.0","event_id":"sha256:1afafbd3e693e217854eb4371bcd0aa84100a7f95764d7cd01723695886f5365"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4M73V5U4EWQ5DFXUGEQ4YY37QK/bundle.json","state_url":"https://pith.science/pith/4M73V5U4EWQ5DFXUGEQ4YY37QK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4M73V5U4EWQ5DFXUGEQ4YY37QK/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-20T05:09:23Z","links":{"resolver":"https://pith.science/pith/4M73V5U4EWQ5DFXUGEQ4YY37QK","bundle":"https://pith.science/pith/4M73V5U4EWQ5DFXUGEQ4YY37QK/bundle.json","state":"https://pith.science/pith/4M73V5U4EWQ5DFXUGEQ4YY37QK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4M73V5U4EWQ5DFXUGEQ4YY37QK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4M73V5U4EWQ5DFXUGEQ4YY37QK","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":"cbfc83cc810203b150cc0f65195cd84e425e8d52e055351ee82e21cd096b0773","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-18T17:43:29Z","title_canon_sha256":"825c2af26da8810d8843adf04c3174f0b7c9fed5bf028f4488caf54c7f934fa5"},"schema_version":"1.0","source":{"id":"1903.07597","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07597","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07597v1","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07597","created_at":"2026-05-17T23:51:00Z"},{"alias_kind":"pith_short_12","alias_value":"4M73V5U4EWQ5","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4M73V5U4EWQ5DFXU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4M73V5U4","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:1afafbd3e693e217854eb4371bcd0aa84100a7f95764d7cd01723695886f5365","target":"graph","created_at":"2026-05-17T23:51:00Z","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 two-user computation broadcast problem is introduced as the setting where User $1$ wants message $W_1$ and has side-information $W_1'$, User $2$ wants message $W_2$ and has side-information $W_2'$, and $(W_1, W_1', W_2, W_2')$ may have arbitrary dependencies. The rate of a computation broadcast scheme is defined as the ratio $H(W_1,W_2)/H(S)$, where $S$ is the information broadcast to both users to simultaneously satisfy their demands. The supremum of achievable rates is called the capacity of computation broadcast $C_{{CB}}$. It is shown that $C_{{CB}}\\leq H(W_1,W_2)/\\left[H(W_1|W_1')+H(W","authors_text":"Hua Sun, Syed A. Jafar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-18T17:43:29Z","title":"On the Capacity of Computation Broadcast"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07597","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:62e4f5e56df1c89d897e1c0741e0ffae2c383c19d32fbc7685e39150d7396159","target":"record","created_at":"2026-05-17T23:51:00Z","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":"cbfc83cc810203b150cc0f65195cd84e425e8d52e055351ee82e21cd096b0773","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-18T17:43:29Z","title_canon_sha256":"825c2af26da8810d8843adf04c3174f0b7c9fed5bf028f4488caf54c7f934fa5"},"schema_version":"1.0","source":{"id":"1903.07597","kind":"arxiv","version":1}},"canonical_sha256":"e33fbaf69c25a1d196f43121cc637f82ab92d6749486dae7f75c401acd6f29ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e33fbaf69c25a1d196f43121cc637f82ab92d6749486dae7f75c401acd6f29ce","first_computed_at":"2026-05-17T23:51:00.910820Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:00.910820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Paf0S1ZMe9IxszMyhD4ynMg5cxK0qdzwTdsToaXi8+339dZGQPOIdHHwmlr/VYk63FY7GFhVKKIlNQ9fnzHHBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:00.911566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.07597","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62e4f5e56df1c89d897e1c0741e0ffae2c383c19d32fbc7685e39150d7396159","sha256:1afafbd3e693e217854eb4371bcd0aa84100a7f95764d7cd01723695886f5365"],"state_sha256":"5c6b7bfe5bc8e9956c40d087566f400e3d102c99a231aa1e5cd6d1ca97655a6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jy+lcm+YqF1+zkqKLcsyRsA2dQrN2N2s6MuiEtyft02Q6t1b/1ER53huClqxOpMgfGOarwrhfsfogac2E5hXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:09:23.099703Z","bundle_sha256":"5d650021a06ee90ecbae3dcc6e9af08fb4cf58a445475f249611db3ade71a9a6"}}