{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4R6YDNAUJCNU452YWHMZK2NG44","short_pith_number":"pith:4R6YDNAU","schema_version":"1.0","canonical_sha256":"e47d81b414489b4e7758b1d99569a6e716cdb7458d24e0ab5d0ab1c4ddd40a90","source":{"kind":"arxiv","id":"1703.01208","version":1},"attestation_state":"computed","paper":{"title":"Preserving Confidentiality in The Gaussian Broadcast Channel Using Compute-and-Forward","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Panos Papadimitratos, Parisa Babaheidarian, Somayeh Salimi","submitted_at":"2017-03-03T15:34:03Z","abstract_excerpt":"We study the transmission of confidential messages across a wireless broadcast channel with K>2 receivers and K helpers. The goal is to transmit all messages reliably to their intended receivers while keeping them confidential from the unintended receivers. We design a codebook based on nested lattice structure, cooperative jamming, lattice alignment, and i.i.d. coding. Moreover, we exploit the asymmetric compute-and-forward decoding strategy to handle finite SNR regimes. Unlike previous alignment schemes, our achievable rates are attainable at any finite SNR value. Also, we show that our sche"},"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":"1703.01208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-03T15:34:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d85e921b536e1e34c9facc0b053d94d70447669fbc9c35b6b05d2c41ed236d61","abstract_canon_sha256":"09716309b2690b9f93e9b9bc1b381b592a82361f2c8e852d0b31d5f18b7106f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:35.717034Z","signature_b64":"kWbrD7G7Z3P+6s4eRxPsdbe8kPtba843CvY9tYjqdGeqVaEs4pBjFNBdNseHkWixzuEq76Ilitkkjt1cuqfkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e47d81b414489b4e7758b1d99569a6e716cdb7458d24e0ab5d0ab1c4ddd40a90","last_reissued_at":"2026-05-18T00:49:35.716482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:35.716482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Preserving Confidentiality in The Gaussian Broadcast Channel Using Compute-and-Forward","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Panos Papadimitratos, Parisa Babaheidarian, Somayeh Salimi","submitted_at":"2017-03-03T15:34:03Z","abstract_excerpt":"We study the transmission of confidential messages across a wireless broadcast channel with K>2 receivers and K helpers. The goal is to transmit all messages reliably to their intended receivers while keeping them confidential from the unintended receivers. We design a codebook based on nested lattice structure, cooperative jamming, lattice alignment, and i.i.d. coding. Moreover, we exploit the asymmetric compute-and-forward decoding strategy to handle finite SNR regimes. Unlike previous alignment schemes, our achievable rates are attainable at any finite SNR value. Also, we show that our sche"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01208","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":"1703.01208","created_at":"2026-05-18T00:49:35.716574+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.01208v1","created_at":"2026-05-18T00:49:35.716574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01208","created_at":"2026-05-18T00:49:35.716574+00:00"},{"alias_kind":"pith_short_12","alias_value":"4R6YDNAUJCNU","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4R6YDNAUJCNU452Y","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4R6YDNAU","created_at":"2026-05-18T12:31:00.734936+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/4R6YDNAUJCNU452YWHMZK2NG44","json":"https://pith.science/pith/4R6YDNAUJCNU452YWHMZK2NG44.json","graph_json":"https://pith.science/api/pith-number/4R6YDNAUJCNU452YWHMZK2NG44/graph.json","events_json":"https://pith.science/api/pith-number/4R6YDNAUJCNU452YWHMZK2NG44/events.json","paper":"https://pith.science/paper/4R6YDNAU"},"agent_actions":{"view_html":"https://pith.science/pith/4R6YDNAUJCNU452YWHMZK2NG44","download_json":"https://pith.science/pith/4R6YDNAUJCNU452YWHMZK2NG44.json","view_paper":"https://pith.science/paper/4R6YDNAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.01208&json=true","fetch_graph":"https://pith.science/api/pith-number/4R6YDNAUJCNU452YWHMZK2NG44/graph.json","fetch_events":"https://pith.science/api/pith-number/4R6YDNAUJCNU452YWHMZK2NG44/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4R6YDNAUJCNU452YWHMZK2NG44/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4R6YDNAUJCNU452YWHMZK2NG44/action/storage_attestation","attest_author":"https://pith.science/pith/4R6YDNAUJCNU452YWHMZK2NG44/action/author_attestation","sign_citation":"https://pith.science/pith/4R6YDNAUJCNU452YWHMZK2NG44/action/citation_signature","submit_replication":"https://pith.science/pith/4R6YDNAUJCNU452YWHMZK2NG44/action/replication_record"}},"created_at":"2026-05-18T00:49:35.716574+00:00","updated_at":"2026-05-18T00:49:35.716574+00:00"}