{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DBORXKBCMU5CLRSERVCTVZZWYP","short_pith_number":"pith:DBORXKBC","schema_version":"1.0","canonical_sha256":"185d1ba822653a25c6448d453ae736c3f69ade920ea1040b4ef0a91dbaa26899","source":{"kind":"arxiv","id":"1403.6982","version":2},"attestation_state":"computed","paper":{"title":"Parallel BCC with One Common and Two Confidential Messages and Imperfect CSIT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Benfarah, Nicola Laurenti, Stefano Tomasin","submitted_at":"2014-03-27T11:32:17Z","abstract_excerpt":"We consider a broadcast communication system over parallel sub-channels where the transmitter sends three messages: a common message to two users, and two confidential messages to each user which need to be kept secret from the other user. We assume partial channel state information at the transmitter (CSIT), stemming from noisy channel estimation. The first contribution of this paper is the characterization of the secrecy capacity region boundary as the solution of weighted sum-rate problems, with suitable weights. Partial CSIT is addressed by adding a margin to the estimated channel gains. T"},"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":"1403.6982","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-27T11:32:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"876ae5a0e209882759f79ab2c03db8e9bb946e48fe50c47aa32350aa500706f5","abstract_canon_sha256":"2e467abccec6ea62afd8adc01884607de95a76d2328134b5ccf23beb5197b9a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:03.170566Z","signature_b64":"4s4TO3Gy4cEN4ZFCAwWDoLzyTs4XhokVwx6LLkcddVmedbrfLMn7VniP+VHEHWTr/4dxjacMzwNll63Y27e+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"185d1ba822653a25c6448d453ae736c3f69ade920ea1040b4ef0a91dbaa26899","last_reissued_at":"2026-05-18T00:59:03.169973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:03.169973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel BCC with One Common and Two Confidential Messages and Imperfect CSIT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Benfarah, Nicola Laurenti, Stefano Tomasin","submitted_at":"2014-03-27T11:32:17Z","abstract_excerpt":"We consider a broadcast communication system over parallel sub-channels where the transmitter sends three messages: a common message to two users, and two confidential messages to each user which need to be kept secret from the other user. We assume partial channel state information at the transmitter (CSIT), stemming from noisy channel estimation. The first contribution of this paper is the characterization of the secrecy capacity region boundary as the solution of weighted sum-rate problems, with suitable weights. Partial CSIT is addressed by adding a margin to the estimated channel gains. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6982","kind":"arxiv","version":2},"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":"1403.6982","created_at":"2026-05-18T00:59:03.170074+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.6982v2","created_at":"2026-05-18T00:59:03.170074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6982","created_at":"2026-05-18T00:59:03.170074+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBORXKBCMU5C","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBORXKBCMU5CLRSE","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBORXKBC","created_at":"2026-05-18T12:28:25.294606+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/DBORXKBCMU5CLRSERVCTVZZWYP","json":"https://pith.science/pith/DBORXKBCMU5CLRSERVCTVZZWYP.json","graph_json":"https://pith.science/api/pith-number/DBORXKBCMU5CLRSERVCTVZZWYP/graph.json","events_json":"https://pith.science/api/pith-number/DBORXKBCMU5CLRSERVCTVZZWYP/events.json","paper":"https://pith.science/paper/DBORXKBC"},"agent_actions":{"view_html":"https://pith.science/pith/DBORXKBCMU5CLRSERVCTVZZWYP","download_json":"https://pith.science/pith/DBORXKBCMU5CLRSERVCTVZZWYP.json","view_paper":"https://pith.science/paper/DBORXKBC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.6982&json=true","fetch_graph":"https://pith.science/api/pith-number/DBORXKBCMU5CLRSERVCTVZZWYP/graph.json","fetch_events":"https://pith.science/api/pith-number/DBORXKBCMU5CLRSERVCTVZZWYP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBORXKBCMU5CLRSERVCTVZZWYP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBORXKBCMU5CLRSERVCTVZZWYP/action/storage_attestation","attest_author":"https://pith.science/pith/DBORXKBCMU5CLRSERVCTVZZWYP/action/author_attestation","sign_citation":"https://pith.science/pith/DBORXKBCMU5CLRSERVCTVZZWYP/action/citation_signature","submit_replication":"https://pith.science/pith/DBORXKBCMU5CLRSERVCTVZZWYP/action/replication_record"}},"created_at":"2026-05-18T00:59:03.170074+00:00","updated_at":"2026-05-18T00:59:03.170074+00:00"}