{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZB5ER7LNLZLHKIZM2HHX3XTYYN","short_pith_number":"pith:ZB5ER7LN","schema_version":"1.0","canonical_sha256":"c87a48fd6d5e5675232cd1cf7dde78c372f860e25b6a0d3e66299df6277d2b40","source":{"kind":"arxiv","id":"1209.4557","version":1},"attestation_state":"computed","paper":{"title":"Strong Secrecy for Multiple Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Holger Boche, Moritz Wiese","submitted_at":"2012-09-20T15:06:44Z","abstract_excerpt":"We show strongly secret achievable rate regions for two different wiretap multiple-access channel coding problems. In the first problem, each encoder has a private message and both together have a common message to transmit. The encoders have entropy-limited access to common randomness. If no common randomness is available, then the achievable region derived here does not allow for the secret transmission of a common message. The second coding problem assumes that the encoders do not have a common message nor access to common randomness. However, they may have a conferencing link over which th"},"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":"1209.4557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-20T15:06:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"72c169041ecfd8a99ebb033ab92cd15ae0bd2b07f7ad98b47631529f79f86d72","abstract_canon_sha256":"40e4f9d520ec01b40876fbdbe9316fdaecc823ce8c73874fa6cb867bd0085c3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:32.605561Z","signature_b64":"mv1QDmWveDEQ0crqhveHKHg89efd7i8yIZ2E5fQvjymIRJfZEcj/v97zGfvAurrb5f4NHlFx+8U9s5hWpTMDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c87a48fd6d5e5675232cd1cf7dde78c372f860e25b6a0d3e66299df6277d2b40","last_reissued_at":"2026-05-18T02:50:32.605118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:32.605118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Secrecy for Multiple Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Holger Boche, Moritz Wiese","submitted_at":"2012-09-20T15:06:44Z","abstract_excerpt":"We show strongly secret achievable rate regions for two different wiretap multiple-access channel coding problems. In the first problem, each encoder has a private message and both together have a common message to transmit. The encoders have entropy-limited access to common randomness. If no common randomness is available, then the achievable region derived here does not allow for the secret transmission of a common message. The second coding problem assumes that the encoders do not have a common message nor access to common randomness. However, they may have a conferencing link over which th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4557","kind":"arxiv","version":1},"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":"1209.4557","created_at":"2026-05-18T02:50:32.605176+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.4557v1","created_at":"2026-05-18T02:50:32.605176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4557","created_at":"2026-05-18T02:50:32.605176+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZB5ER7LNLZLH","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZB5ER7LNLZLHKIZM","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZB5ER7LN","created_at":"2026-05-18T12:27:30.460161+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/ZB5ER7LNLZLHKIZM2HHX3XTYYN","json":"https://pith.science/pith/ZB5ER7LNLZLHKIZM2HHX3XTYYN.json","graph_json":"https://pith.science/api/pith-number/ZB5ER7LNLZLHKIZM2HHX3XTYYN/graph.json","events_json":"https://pith.science/api/pith-number/ZB5ER7LNLZLHKIZM2HHX3XTYYN/events.json","paper":"https://pith.science/paper/ZB5ER7LN"},"agent_actions":{"view_html":"https://pith.science/pith/ZB5ER7LNLZLHKIZM2HHX3XTYYN","download_json":"https://pith.science/pith/ZB5ER7LNLZLHKIZM2HHX3XTYYN.json","view_paper":"https://pith.science/paper/ZB5ER7LN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.4557&json=true","fetch_graph":"https://pith.science/api/pith-number/ZB5ER7LNLZLHKIZM2HHX3XTYYN/graph.json","fetch_events":"https://pith.science/api/pith-number/ZB5ER7LNLZLHKIZM2HHX3XTYYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZB5ER7LNLZLHKIZM2HHX3XTYYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZB5ER7LNLZLHKIZM2HHX3XTYYN/action/storage_attestation","attest_author":"https://pith.science/pith/ZB5ER7LNLZLHKIZM2HHX3XTYYN/action/author_attestation","sign_citation":"https://pith.science/pith/ZB5ER7LNLZLHKIZM2HHX3XTYYN/action/citation_signature","submit_replication":"https://pith.science/pith/ZB5ER7LNLZLHKIZM2HHX3XTYYN/action/replication_record"}},"created_at":"2026-05-18T02:50:32.605176+00:00","updated_at":"2026-05-18T02:50:32.605176+00:00"}