{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NB4YSVTV3X6KBYNVR7FU75GHPZ","short_pith_number":"pith:NB4YSVTV","schema_version":"1.0","canonical_sha256":"6879895675ddfca0e1b58fcb4ff4c77e7ff70898745bacedbc7647ea5b7995e5","source":{"kind":"arxiv","id":"1710.02342","version":2},"attestation_state":"computed","paper":{"title":"The MAC Resolvability Region, Semantic Security and Its Operational Implications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Igor Bjelakovic, Matthias Frey, Slawomir Stanczak","submitted_at":"2017-10-06T10:45:24Z","abstract_excerpt":"Building upon previous work on the relation between secrecy and channel resolvability, we revisit a secrecy proof for the multiple-access channel (MAC) from the perspective of resolvability. In particular, we refine and extend the proof to obtain novel results on the second-order achievable rates. Then we characterize the resolvability region of the memoryless MAC by establishing a conceptually simple converse proof for resolvability that relies on the uniform continuity of Shannon's entropy with respect to the variational distance. We discuss the operational meaning of the information theoret"},"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":"1710.02342","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-06T10:45:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bbec6a3effcbd4b1b73d3eb5588de353853312c96c3b85b94d726b48d38d095d","abstract_canon_sha256":"e7ec0bae6ac7daf5c9b3ac419d8b7bf92d5484385c990924c0ccfa3afd45b23f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:23.431712Z","signature_b64":"fg+BmzUv/kPVp6AG3IkYn56EUk4aUEJGUok1TTFqePej+IADXijlQAJWf4snB1ty9KP2BXd/H0Usr0EjFhkHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6879895675ddfca0e1b58fcb4ff4c77e7ff70898745bacedbc7647ea5b7995e5","last_reissued_at":"2026-05-18T00:25:23.431089Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:23.431089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The MAC Resolvability Region, Semantic Security and Its Operational Implications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Igor Bjelakovic, Matthias Frey, Slawomir Stanczak","submitted_at":"2017-10-06T10:45:24Z","abstract_excerpt":"Building upon previous work on the relation between secrecy and channel resolvability, we revisit a secrecy proof for the multiple-access channel (MAC) from the perspective of resolvability. In particular, we refine and extend the proof to obtain novel results on the second-order achievable rates. Then we characterize the resolvability region of the memoryless MAC by establishing a conceptually simple converse proof for resolvability that relies on the uniform continuity of Shannon's entropy with respect to the variational distance. We discuss the operational meaning of the information theoret"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02342","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":"1710.02342","created_at":"2026-05-18T00:25:23.431177+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02342v2","created_at":"2026-05-18T00:25:23.431177+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02342","created_at":"2026-05-18T00:25:23.431177+00:00"},{"alias_kind":"pith_short_12","alias_value":"NB4YSVTV3X6K","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NB4YSVTV3X6KBYNV","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NB4YSVTV","created_at":"2026-05-18T12:31:31.346846+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/NB4YSVTV3X6KBYNVR7FU75GHPZ","json":"https://pith.science/pith/NB4YSVTV3X6KBYNVR7FU75GHPZ.json","graph_json":"https://pith.science/api/pith-number/NB4YSVTV3X6KBYNVR7FU75GHPZ/graph.json","events_json":"https://pith.science/api/pith-number/NB4YSVTV3X6KBYNVR7FU75GHPZ/events.json","paper":"https://pith.science/paper/NB4YSVTV"},"agent_actions":{"view_html":"https://pith.science/pith/NB4YSVTV3X6KBYNVR7FU75GHPZ","download_json":"https://pith.science/pith/NB4YSVTV3X6KBYNVR7FU75GHPZ.json","view_paper":"https://pith.science/paper/NB4YSVTV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02342&json=true","fetch_graph":"https://pith.science/api/pith-number/NB4YSVTV3X6KBYNVR7FU75GHPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/NB4YSVTV3X6KBYNVR7FU75GHPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NB4YSVTV3X6KBYNVR7FU75GHPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NB4YSVTV3X6KBYNVR7FU75GHPZ/action/storage_attestation","attest_author":"https://pith.science/pith/NB4YSVTV3X6KBYNVR7FU75GHPZ/action/author_attestation","sign_citation":"https://pith.science/pith/NB4YSVTV3X6KBYNVR7FU75GHPZ/action/citation_signature","submit_replication":"https://pith.science/pith/NB4YSVTV3X6KBYNVR7FU75GHPZ/action/replication_record"}},"created_at":"2026-05-18T00:25:23.431177+00:00","updated_at":"2026-05-18T00:25:23.431177+00:00"}