{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TWPJX6637OKCWGXM675YX32SBS","short_pith_number":"pith:TWPJX663","schema_version":"1.0","canonical_sha256":"9d9e9bfbdbfb942b1aecf7fb8bef520c8fcdc58f9284804f8b12e0ab9d37b97a","source":{"kind":"arxiv","id":"1601.01286","version":3},"attestation_state":"computed","paper":{"title":"Strong Secrecy for Cooperative Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gerhard Kramer, Haim H. Permuter, Paul Cuff, Ziv Goldfeld","submitted_at":"2016-01-06T19:39:40Z","abstract_excerpt":"A broadcast channel (BC) where the decoders cooperate via a one-sided link is considered. One common and two private messages are transmitted and the private message to the cooperative user should be kept secret from the cooperation-aided user. The secrecy level is measured in terms of strong secrecy, i.e., a vanishing information leakage. An inner bound on the capacity region is derived by using a channel-resolvability-based code that double-bins the codebook of the secret message, and by using a likelihood encoder to choose the transmitted codeword. The inner bound is shown to be tight for s"},"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":"1601.01286","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-06T19:39:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"edb01735603f5e99bd0e36442b3364b3c5ced3f3094ac7161029533f2929618a","abstract_canon_sha256":"d1db2c5c8fe531a90830a504047269f0cb72b45953d05d44aa68e672b05f0835"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:00.461844Z","signature_b64":"MPFN/m2dHqiuKlR1A9MfXIE/wwAYW7sVXI5fdv8BRZ4OyvjCknuRVcmJjDGFx5CIkfhV9CXK7dsKAeR2L4JTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d9e9bfbdbfb942b1aecf7fb8bef520c8fcdc58f9284804f8b12e0ab9d37b97a","last_reissued_at":"2026-05-17T23:45:00.461260Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:00.461260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Secrecy for Cooperative Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gerhard Kramer, Haim H. Permuter, Paul Cuff, Ziv Goldfeld","submitted_at":"2016-01-06T19:39:40Z","abstract_excerpt":"A broadcast channel (BC) where the decoders cooperate via a one-sided link is considered. One common and two private messages are transmitted and the private message to the cooperative user should be kept secret from the cooperation-aided user. The secrecy level is measured in terms of strong secrecy, i.e., a vanishing information leakage. An inner bound on the capacity region is derived by using a channel-resolvability-based code that double-bins the codebook of the secret message, and by using a likelihood encoder to choose the transmitted codeword. The inner bound is shown to be tight for s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01286","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":"1601.01286","created_at":"2026-05-17T23:45:00.461350+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.01286v3","created_at":"2026-05-17T23:45:00.461350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01286","created_at":"2026-05-17T23:45:00.461350+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWPJX6637OKC","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWPJX6637OKCWGXM","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWPJX663","created_at":"2026-05-18T12:30:46.583412+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/TWPJX6637OKCWGXM675YX32SBS","json":"https://pith.science/pith/TWPJX6637OKCWGXM675YX32SBS.json","graph_json":"https://pith.science/api/pith-number/TWPJX6637OKCWGXM675YX32SBS/graph.json","events_json":"https://pith.science/api/pith-number/TWPJX6637OKCWGXM675YX32SBS/events.json","paper":"https://pith.science/paper/TWPJX663"},"agent_actions":{"view_html":"https://pith.science/pith/TWPJX6637OKCWGXM675YX32SBS","download_json":"https://pith.science/pith/TWPJX6637OKCWGXM675YX32SBS.json","view_paper":"https://pith.science/paper/TWPJX663","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.01286&json=true","fetch_graph":"https://pith.science/api/pith-number/TWPJX6637OKCWGXM675YX32SBS/graph.json","fetch_events":"https://pith.science/api/pith-number/TWPJX6637OKCWGXM675YX32SBS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWPJX6637OKCWGXM675YX32SBS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWPJX6637OKCWGXM675YX32SBS/action/storage_attestation","attest_author":"https://pith.science/pith/TWPJX6637OKCWGXM675YX32SBS/action/author_attestation","sign_citation":"https://pith.science/pith/TWPJX6637OKCWGXM675YX32SBS/action/citation_signature","submit_replication":"https://pith.science/pith/TWPJX6637OKCWGXM675YX32SBS/action/replication_record"}},"created_at":"2026-05-17T23:45:00.461350+00:00","updated_at":"2026-05-17T23:45:00.461350+00:00"}