{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WK5J2PBFTSKYCBO4YWWF2UCNTM","short_pith_number":"pith:WK5J2PBF","schema_version":"1.0","canonical_sha256":"b2ba9d3c259c958105dcc5ac5d504d9b2959a7439a3ff9125a8357af7fee4bdf","source":{"kind":"arxiv","id":"1509.01332","version":3},"attestation_state":"computed","paper":{"title":"Lattice Codes Achieve the Capacity of Common Message Gaussian Broadcast Channels with Coded Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emanuele Viterbo, Lakshmi Natarajan, Yi Hong","submitted_at":"2015-09-04T02:38:22Z","abstract_excerpt":"Lattices possess elegant mathematical properties which have been previously used in the literature to show that structured codes can be efficient in a variety of communication scenarios, including coding for the additive white Gaussian noise (AWGN) channel, dirty-paper channel, Wyner-Ziv coding, coding for relay networks and so forth. We consider the family of single-transmitter multiple-receiver Gaussian channels where the source transmits a set of common messages to all the receivers (multicast scenario), and each receiver has 'coded side information', i.e., prior information in the form of "},"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":"1509.01332","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-04T02:38:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"739b745446cb4e5394446432d1e14f070abb4e0f2662ab8e9fb2dc3420e64417","abstract_canon_sha256":"b943045f9b87f4815fb0a2afdadff25b28d3ab15ed4e3eb52a246d8baf1a89a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:55.445157Z","signature_b64":"J1fTX+JD/FmXIsSKvxeCT4RxmR5oaCWcgO8g2vRDuIv8HQqGQkQDsIf95Aa/2YA+9CuPHl8Am7gsYtpVJPHOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2ba9d3c259c958105dcc5ac5d504d9b2959a7439a3ff9125a8357af7fee4bdf","last_reissued_at":"2026-05-18T00:27:55.444557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:55.444557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lattice Codes Achieve the Capacity of Common Message Gaussian Broadcast Channels with Coded Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emanuele Viterbo, Lakshmi Natarajan, Yi Hong","submitted_at":"2015-09-04T02:38:22Z","abstract_excerpt":"Lattices possess elegant mathematical properties which have been previously used in the literature to show that structured codes can be efficient in a variety of communication scenarios, including coding for the additive white Gaussian noise (AWGN) channel, dirty-paper channel, Wyner-Ziv coding, coding for relay networks and so forth. We consider the family of single-transmitter multiple-receiver Gaussian channels where the source transmits a set of common messages to all the receivers (multicast scenario), and each receiver has 'coded side information', i.e., prior information in the form of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01332","kind":"arxiv","version":3},"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":"1509.01332","created_at":"2026-05-18T00:27:55.444668+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.01332v3","created_at":"2026-05-18T00:27:55.444668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01332","created_at":"2026-05-18T00:27:55.444668+00:00"},{"alias_kind":"pith_short_12","alias_value":"WK5J2PBFTSKY","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WK5J2PBFTSKYCBO4","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WK5J2PBF","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/WK5J2PBFTSKYCBO4YWWF2UCNTM","json":"https://pith.science/pith/WK5J2PBFTSKYCBO4YWWF2UCNTM.json","graph_json":"https://pith.science/api/pith-number/WK5J2PBFTSKYCBO4YWWF2UCNTM/graph.json","events_json":"https://pith.science/api/pith-number/WK5J2PBFTSKYCBO4YWWF2UCNTM/events.json","paper":"https://pith.science/paper/WK5J2PBF"},"agent_actions":{"view_html":"https://pith.science/pith/WK5J2PBFTSKYCBO4YWWF2UCNTM","download_json":"https://pith.science/pith/WK5J2PBFTSKYCBO4YWWF2UCNTM.json","view_paper":"https://pith.science/paper/WK5J2PBF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.01332&json=true","fetch_graph":"https://pith.science/api/pith-number/WK5J2PBFTSKYCBO4YWWF2UCNTM/graph.json","fetch_events":"https://pith.science/api/pith-number/WK5J2PBFTSKYCBO4YWWF2UCNTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WK5J2PBFTSKYCBO4YWWF2UCNTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WK5J2PBFTSKYCBO4YWWF2UCNTM/action/storage_attestation","attest_author":"https://pith.science/pith/WK5J2PBFTSKYCBO4YWWF2UCNTM/action/author_attestation","sign_citation":"https://pith.science/pith/WK5J2PBFTSKYCBO4YWWF2UCNTM/action/citation_signature","submit_replication":"https://pith.science/pith/WK5J2PBFTSKYCBO4YWWF2UCNTM/action/replication_record"}},"created_at":"2026-05-18T00:27:55.444668+00:00","updated_at":"2026-05-18T00:27:55.444668+00:00"}