{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WK5J2PBFTSKYCBO4YWWF2UCNTM","short_pith_number":"pith:WK5J2PBF","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"},"canonical_sha256":"b2ba9d3c259c958105dcc5ac5d504d9b2959a7439a3ff9125a8357af7fee4bdf","source":{"kind":"arxiv","id":"1509.01332","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01332","created_at":"2026-05-18T00:27:55Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01332v3","created_at":"2026-05-18T00:27:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01332","created_at":"2026-05-18T00:27:55Z"},{"alias_kind":"pith_short_12","alias_value":"WK5J2PBFTSKY","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WK5J2PBFTSKYCBO4","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WK5J2PBF","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WK5J2PBFTSKYCBO4YWWF2UCNTM","target":"record","payload":{"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"},"canonical_sha256":"b2ba9d3c259c958105dcc5ac5d504d9b2959a7439a3ff9125a8357af7fee4bdf","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"},"source_kind":"arxiv","source_id":"1509.01332","source_version":3,"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-18T00:27:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ixp+NUfjRoh/noF2Y34YF+Qp+eaExIU4GJNj823lZozQGUrr5BwSEkcpluns4qeBsR+0S6fC/dmeWH9fYIr4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T03:49:50.097063Z"},"content_sha256":"8030f516b28c741140f076288a80e95375a6c6b59a160ba4d862abd995088046","schema_version":"1.0","event_id":"sha256:8030f516b28c741140f076288a80e95375a6c6b59a160ba4d862abd995088046"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WK5J2PBFTSKYCBO4YWWF2UCNTM","target":"graph","payload":{"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"},"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-18T00:27:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vt+Tfpy5BD62gyVg1M+fH/2865doazx3s8BC2pPxrbN4eccmCU23itrOFaEtsRj/MPO77p+Vp5XdRIwh/pezCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T03:49:50.097546Z"},"content_sha256":"21b9d1a9e6e23d585eafdfd126a040accfc1b032cbcda1575797242e831540d0","schema_version":"1.0","event_id":"sha256:21b9d1a9e6e23d585eafdfd126a040accfc1b032cbcda1575797242e831540d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WK5J2PBFTSKYCBO4YWWF2UCNTM/bundle.json","state_url":"https://pith.science/pith/WK5J2PBFTSKYCBO4YWWF2UCNTM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WK5J2PBFTSKYCBO4YWWF2UCNTM/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-21T03:49:50Z","links":{"resolver":"https://pith.science/pith/WK5J2PBFTSKYCBO4YWWF2UCNTM","bundle":"https://pith.science/pith/WK5J2PBFTSKYCBO4YWWF2UCNTM/bundle.json","state":"https://pith.science/pith/WK5J2PBFTSKYCBO4YWWF2UCNTM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WK5J2PBFTSKYCBO4YWWF2UCNTM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WK5J2PBFTSKYCBO4YWWF2UCNTM","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":"b943045f9b87f4815fb0a2afdadff25b28d3ab15ed4e3eb52a246d8baf1a89a0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-04T02:38:22Z","title_canon_sha256":"739b745446cb4e5394446432d1e14f070abb4e0f2662ab8e9fb2dc3420e64417"},"schema_version":"1.0","source":{"id":"1509.01332","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01332","created_at":"2026-05-18T00:27:55Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01332v3","created_at":"2026-05-18T00:27:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01332","created_at":"2026-05-18T00:27:55Z"},{"alias_kind":"pith_short_12","alias_value":"WK5J2PBFTSKY","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WK5J2PBFTSKYCBO4","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WK5J2PBF","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:21b9d1a9e6e23d585eafdfd126a040accfc1b032cbcda1575797242e831540d0","target":"graph","created_at":"2026-05-18T00:27:55Z","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":"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 ","authors_text":"Emanuele Viterbo, Lakshmi Natarajan, Yi Hong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-04T02:38:22Z","title":"Lattice Codes Achieve the Capacity of Common Message Gaussian Broadcast Channels with Coded Side Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01332","kind":"arxiv","version":3},"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:8030f516b28c741140f076288a80e95375a6c6b59a160ba4d862abd995088046","target":"record","created_at":"2026-05-18T00:27:55Z","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":"b943045f9b87f4815fb0a2afdadff25b28d3ab15ed4e3eb52a246d8baf1a89a0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-04T02:38:22Z","title_canon_sha256":"739b745446cb4e5394446432d1e14f070abb4e0f2662ab8e9fb2dc3420e64417"},"schema_version":"1.0","source":{"id":"1509.01332","kind":"arxiv","version":3}},"canonical_sha256":"b2ba9d3c259c958105dcc5ac5d504d9b2959a7439a3ff9125a8357af7fee4bdf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2ba9d3c259c958105dcc5ac5d504d9b2959a7439a3ff9125a8357af7fee4bdf","first_computed_at":"2026-05-18T00:27:55.444557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:55.444557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J1fTX+JD/FmXIsSKvxeCT4RxmR5oaCWcgO8g2vRDuIv8HQqGQkQDsIf95Aa/2YA+9CuPHl8Am7gsYtpVJPHOBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:55.445157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.01332","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8030f516b28c741140f076288a80e95375a6c6b59a160ba4d862abd995088046","sha256:21b9d1a9e6e23d585eafdfd126a040accfc1b032cbcda1575797242e831540d0"],"state_sha256":"a58e5ed4584774f5b6a1c9a74129cb3062c74d9c51174ac733745aee1e727ed5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RsdYhn01fXAII3OmEeWmfCBiygA728opqYA/2JNifN0FZS2EAS/olMpXoCjnJTgu9tZhcnB/fwCr4L/pA+thAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T03:49:50.099459Z","bundle_sha256":"a60c94ae2a2dee99720933ac2cfec985241a4984478f018150120c8c0a94d9e6"}}