{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WMADMSP5SHQF6PAH5CFEQBLSJZ","short_pith_number":"pith:WMADMSP5","schema_version":"1.0","canonical_sha256":"b3003649fd91e05f3c07e88a4805724e56e422f113a7a88e5b7eaccd3ce52a2a","source":{"kind":"arxiv","id":"1508.04022","version":1},"attestation_state":"computed","paper":{"title":"Joint Source-Channel Coding for Broadcast Channel with Cooperating Receivers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Behrooz Razeghi, Ghosheh Abed Hodtani, Mostafa Monemizadeh, Sajjad Bahrami","submitted_at":"2015-08-17T13:38:27Z","abstract_excerpt":"It is known that, as opposed to point-to-point channel, separate source and channel coding is not optimal in general for sending correlated sources over multiuser channels. In some works joint source-channel coding has been investigated for some certain multiuser channels; i.g., multiple access channel (MAC) and broadcast channel (BC). In this paper, we obtain a sufficient condition for transmitting arbitrarily correlated sources over a discrete memoryless BC with cooperating receivers, where the receivers are allowed to exchange messages via a pair of noisy cooperative links. It is seen that "},"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":"1508.04022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-17T13:38:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d2b61fb51b91ce4f414dc18b2c7e7752cb1a0068becdfbd69f4bc01c2a909c4c","abstract_canon_sha256":"0bf003fa5fd5155ffc3999ef8814f9d60462731d210c106160eb031e47662511"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:57.904310Z","signature_b64":"7kUkr3Tb6dvut/lTC3inDjDa41zy7YYURMOidjADfvNuGPdvOl3ZTL2sYl9mv1Fjn8R9Vroh8dGHyKYHy88cBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3003649fd91e05f3c07e88a4805724e56e422f113a7a88e5b7eaccd3ce52a2a","last_reissued_at":"2026-05-18T00:58:57.903854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:57.903854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint Source-Channel Coding for Broadcast Channel with Cooperating Receivers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Behrooz Razeghi, Ghosheh Abed Hodtani, Mostafa Monemizadeh, Sajjad Bahrami","submitted_at":"2015-08-17T13:38:27Z","abstract_excerpt":"It is known that, as opposed to point-to-point channel, separate source and channel coding is not optimal in general for sending correlated sources over multiuser channels. In some works joint source-channel coding has been investigated for some certain multiuser channels; i.g., multiple access channel (MAC) and broadcast channel (BC). In this paper, we obtain a sufficient condition for transmitting arbitrarily correlated sources over a discrete memoryless BC with cooperating receivers, where the receivers are allowed to exchange messages via a pair of noisy cooperative links. It is seen that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04022","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":"1508.04022","created_at":"2026-05-18T00:58:57.903918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.04022v1","created_at":"2026-05-18T00:58:57.903918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04022","created_at":"2026-05-18T00:58:57.903918+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMADMSP5SHQF","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMADMSP5SHQF6PAH","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMADMSP5","created_at":"2026-05-18T12:29:47.479230+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/WMADMSP5SHQF6PAH5CFEQBLSJZ","json":"https://pith.science/pith/WMADMSP5SHQF6PAH5CFEQBLSJZ.json","graph_json":"https://pith.science/api/pith-number/WMADMSP5SHQF6PAH5CFEQBLSJZ/graph.json","events_json":"https://pith.science/api/pith-number/WMADMSP5SHQF6PAH5CFEQBLSJZ/events.json","paper":"https://pith.science/paper/WMADMSP5"},"agent_actions":{"view_html":"https://pith.science/pith/WMADMSP5SHQF6PAH5CFEQBLSJZ","download_json":"https://pith.science/pith/WMADMSP5SHQF6PAH5CFEQBLSJZ.json","view_paper":"https://pith.science/paper/WMADMSP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.04022&json=true","fetch_graph":"https://pith.science/api/pith-number/WMADMSP5SHQF6PAH5CFEQBLSJZ/graph.json","fetch_events":"https://pith.science/api/pith-number/WMADMSP5SHQF6PAH5CFEQBLSJZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMADMSP5SHQF6PAH5CFEQBLSJZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMADMSP5SHQF6PAH5CFEQBLSJZ/action/storage_attestation","attest_author":"https://pith.science/pith/WMADMSP5SHQF6PAH5CFEQBLSJZ/action/author_attestation","sign_citation":"https://pith.science/pith/WMADMSP5SHQF6PAH5CFEQBLSJZ/action/citation_signature","submit_replication":"https://pith.science/pith/WMADMSP5SHQF6PAH5CFEQBLSJZ/action/replication_record"}},"created_at":"2026-05-18T00:58:57.903918+00:00","updated_at":"2026-05-18T00:58:57.903918+00:00"}