{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4M73V5U4EWQ5DFXUGEQ4YY37QK","short_pith_number":"pith:4M73V5U4","schema_version":"1.0","canonical_sha256":"e33fbaf69c25a1d196f43121cc637f82ab92d6749486dae7f75c401acd6f29ce","source":{"kind":"arxiv","id":"1903.07597","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.07597","created_at":"2026-05-17T23:51:00.910927+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.07597v1","created_at":"2026-05-17T23:51:00.910927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07597","created_at":"2026-05-17T23:51:00.910927+00:00"},{"alias_kind":"pith_short_12","alias_value":"4M73V5U4EWQ5","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4M73V5U4EWQ5DFXU","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4M73V5U4","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4M73V5U4EWQ5DFXUGEQ4YY37QK","json":"https://pith.science/pith/4M73V5U4EWQ5DFXUGEQ4YY37QK.json","graph_json":"https://pith.science/api/pith-number/4M73V5U4EWQ5DFXUGEQ4YY37QK/graph.json","events_json":"https://pith.science/api/pith-number/4M73V5U4EWQ5DFXUGEQ4YY37QK/events.json","paper":"https://pith.science/paper/4M73V5U4"},"agent_actions":{"view_html":"https://pith.science/pith/4M73V5U4EWQ5DFXUGEQ4YY37QK","download_json":"https://pith.science/pith/4M73V5U4EWQ5DFXUGEQ4YY37QK.json","view_paper":"https://pith.science/paper/4M73V5U4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.07597&json=true","fetch_graph":"https://pith.science/api/pith-number/4M73V5U4EWQ5DFXUGEQ4YY37QK/graph.json","fetch_events":"https://pith.science/api/pith-number/4M73V5U4EWQ5DFXUGEQ4YY37QK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4M73V5U4EWQ5DFXUGEQ4YY37QK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4M73V5U4EWQ5DFXUGEQ4YY37QK/action/storage_attestation","attest_author":"https://pith.science/pith/4M73V5U4EWQ5DFXUGEQ4YY37QK/action/author_attestation","sign_citation":"https://pith.science/pith/4M73V5U4EWQ5DFXUGEQ4YY37QK/action/citation_signature","submit_replication":"https://pith.science/pith/4M73V5U4EWQ5DFXUGEQ4YY37QK/action/replication_record"}},"created_at":"2026-05-17T23:51:00.910927+00:00","updated_at":"2026-05-17T23:51:00.910927+00:00"}