{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:D3ZWGINXXA4IDOYRBGBT6LCRPK","short_pith_number":"pith:D3ZWGINX","schema_version":"1.0","canonical_sha256":"1ef36321b7b83881bb1109833f2c517a810dca5be246ec51ea29e82703552db9","source":{"kind":"arxiv","id":"1608.06057","version":5},"attestation_state":"computed","paper":{"title":"MIMO Gaussian Broadcast Channels with Common, Private and Confidential Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haim H. Permuter, Ziv Goldfeld","submitted_at":"2016-08-22T06:08:33Z","abstract_excerpt":"The two-user multiple-input multiple-output (MIMO) Gaussian broadcast channel (BC) with common, private and confidential messages is considered. The transmitter sends a common message to both users, a confidential message to User 1 and a private (non-confidential) message to User 2. The secrecy-capacity region is characterized by showing that certain inner and outer bounds coincide and that the boundary points are achieved by Gaussian inputs, which enables the development of a tight converse. The proof relies on factorization of upper concave envelopes and a variant of dirty-paper coding (DPC)"},"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":"1608.06057","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-22T06:08:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2476d680e0e79fa05800864c5cbf5531bc90ab44e9ff99fc24e6a5264f7a9049","abstract_canon_sha256":"6808666d51778c5e05ec8ca077eabce090a3d5ea9699df5e21d178cc27afe784"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:00.379925Z","signature_b64":"EVFQeawok+P2COBuioO4QSvOtYD/5OGrS7aw1y22FtAVs3GQ1aDQHrxqKZq+VrydHTjiXvKLyQw5YH3OlVYZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ef36321b7b83881bb1109833f2c517a810dca5be246ec51ea29e82703552db9","last_reissued_at":"2026-05-17T23:45:00.379237Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:00.379237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MIMO Gaussian Broadcast Channels with Common, Private and Confidential Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Haim H. Permuter, Ziv Goldfeld","submitted_at":"2016-08-22T06:08:33Z","abstract_excerpt":"The two-user multiple-input multiple-output (MIMO) Gaussian broadcast channel (BC) with common, private and confidential messages is considered. The transmitter sends a common message to both users, a confidential message to User 1 and a private (non-confidential) message to User 2. The secrecy-capacity region is characterized by showing that certain inner and outer bounds coincide and that the boundary points are achieved by Gaussian inputs, which enables the development of a tight converse. The proof relies on factorization of upper concave envelopes and a variant of dirty-paper coding (DPC)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06057","kind":"arxiv","version":5},"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":"1608.06057","created_at":"2026-05-17T23:45:00.379359+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.06057v5","created_at":"2026-05-17T23:45:00.379359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06057","created_at":"2026-05-17T23:45:00.379359+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3ZWGINXXA4I","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3ZWGINXXA4IDOYR","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3ZWGINX","created_at":"2026-05-18T12:30:09.641336+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/D3ZWGINXXA4IDOYRBGBT6LCRPK","json":"https://pith.science/pith/D3ZWGINXXA4IDOYRBGBT6LCRPK.json","graph_json":"https://pith.science/api/pith-number/D3ZWGINXXA4IDOYRBGBT6LCRPK/graph.json","events_json":"https://pith.science/api/pith-number/D3ZWGINXXA4IDOYRBGBT6LCRPK/events.json","paper":"https://pith.science/paper/D3ZWGINX"},"agent_actions":{"view_html":"https://pith.science/pith/D3ZWGINXXA4IDOYRBGBT6LCRPK","download_json":"https://pith.science/pith/D3ZWGINXXA4IDOYRBGBT6LCRPK.json","view_paper":"https://pith.science/paper/D3ZWGINX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.06057&json=true","fetch_graph":"https://pith.science/api/pith-number/D3ZWGINXXA4IDOYRBGBT6LCRPK/graph.json","fetch_events":"https://pith.science/api/pith-number/D3ZWGINXXA4IDOYRBGBT6LCRPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3ZWGINXXA4IDOYRBGBT6LCRPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3ZWGINXXA4IDOYRBGBT6LCRPK/action/storage_attestation","attest_author":"https://pith.science/pith/D3ZWGINXXA4IDOYRBGBT6LCRPK/action/author_attestation","sign_citation":"https://pith.science/pith/D3ZWGINXXA4IDOYRBGBT6LCRPK/action/citation_signature","submit_replication":"https://pith.science/pith/D3ZWGINXXA4IDOYRBGBT6LCRPK/action/replication_record"}},"created_at":"2026-05-17T23:45:00.379359+00:00","updated_at":"2026-05-17T23:45:00.379359+00:00"}