{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SXBJV4XPSR5KFZ5S64LM34GTJK","short_pith_number":"pith:SXBJV4XP","schema_version":"1.0","canonical_sha256":"95c29af2ef947aa2e7b2f716cdf0d34aa56c7674af21da4f9376626a2a70a7f3","source":{"kind":"arxiv","id":"1312.6784","version":3},"attestation_state":"computed","paper":{"title":"Relay Broadcast Channel with Confidential Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bin Dai, Linman Yu, Zheng Ma","submitted_at":"2013-12-24T09:36:56Z","abstract_excerpt":"We investigate the effects of an additional relay node on the secrecy of broadcast channels by considering the model of relay broadcast channels with confidential messages. We show that this additional relay node can increase the achievable secrecy rate region of the broadcast channels with confidential messages. More specifically, first, we investigate the discrete memoryless relay broadcast channels with two confidential messages and one common message. Three inner bounds (with respect to decode-forward, generalized noise-forward and compress-forward strategies) and an outer bound on the cap"},"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":"1312.6784","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-24T09:36:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"40c2935f2bf8f85d753f815568cdf1db8364bac60a282f0820fbe1b7aa81dee2","abstract_canon_sha256":"3ae14eb0f491f2a8b459a292242274bb65fd9ce4f944cb694c1c6497afb39f63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:08.814355Z","signature_b64":"eR36hC3GudyaXsQ/hzzL832ju0QoCqymHWUwpzgEiBRaP0Wv2X4UBkg0uFO/2dRKSUL549jNn3bEiLrgGWAhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95c29af2ef947aa2e7b2f716cdf0d34aa56c7674af21da4f9376626a2a70a7f3","last_reissued_at":"2026-05-18T01:25:08.813667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:08.813667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relay Broadcast Channel with Confidential Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bin Dai, Linman Yu, Zheng Ma","submitted_at":"2013-12-24T09:36:56Z","abstract_excerpt":"We investigate the effects of an additional relay node on the secrecy of broadcast channels by considering the model of relay broadcast channels with confidential messages. We show that this additional relay node can increase the achievable secrecy rate region of the broadcast channels with confidential messages. More specifically, first, we investigate the discrete memoryless relay broadcast channels with two confidential messages and one common message. Three inner bounds (with respect to decode-forward, generalized noise-forward and compress-forward strategies) and an outer bound on the cap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6784","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":"1312.6784","created_at":"2026-05-18T01:25:08.813769+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6784v3","created_at":"2026-05-18T01:25:08.813769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6784","created_at":"2026-05-18T01:25:08.813769+00:00"},{"alias_kind":"pith_short_12","alias_value":"SXBJV4XPSR5K","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SXBJV4XPSR5KFZ5S","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SXBJV4XP","created_at":"2026-05-18T12:27:59.945178+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/SXBJV4XPSR5KFZ5S64LM34GTJK","json":"https://pith.science/pith/SXBJV4XPSR5KFZ5S64LM34GTJK.json","graph_json":"https://pith.science/api/pith-number/SXBJV4XPSR5KFZ5S64LM34GTJK/graph.json","events_json":"https://pith.science/api/pith-number/SXBJV4XPSR5KFZ5S64LM34GTJK/events.json","paper":"https://pith.science/paper/SXBJV4XP"},"agent_actions":{"view_html":"https://pith.science/pith/SXBJV4XPSR5KFZ5S64LM34GTJK","download_json":"https://pith.science/pith/SXBJV4XPSR5KFZ5S64LM34GTJK.json","view_paper":"https://pith.science/paper/SXBJV4XP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6784&json=true","fetch_graph":"https://pith.science/api/pith-number/SXBJV4XPSR5KFZ5S64LM34GTJK/graph.json","fetch_events":"https://pith.science/api/pith-number/SXBJV4XPSR5KFZ5S64LM34GTJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SXBJV4XPSR5KFZ5S64LM34GTJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SXBJV4XPSR5KFZ5S64LM34GTJK/action/storage_attestation","attest_author":"https://pith.science/pith/SXBJV4XPSR5KFZ5S64LM34GTJK/action/author_attestation","sign_citation":"https://pith.science/pith/SXBJV4XPSR5KFZ5S64LM34GTJK/action/citation_signature","submit_replication":"https://pith.science/pith/SXBJV4XPSR5KFZ5S64LM34GTJK/action/replication_record"}},"created_at":"2026-05-18T01:25:08.813769+00:00","updated_at":"2026-05-18T01:25:08.813769+00:00"}