{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WP26KP2KNWKVYM5KQAFTGWSPHH","short_pith_number":"pith:WP26KP2K","schema_version":"1.0","canonical_sha256":"b3f5e53f4a6d955c33aa800b335a4f39fcfab4f8f77fd3828794aa0d5a023bfc","source":{"kind":"arxiv","id":"1202.1387","version":3},"attestation_state":"computed","paper":{"title":"Successive Secret Key Agreement over Generalized Multiple Access and Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mahmoud Salmasizadeh, Mikael Skoglund, Mohammad Reza Aref, Somayeh Salimi","submitted_at":"2012-02-07T10:04:48Z","abstract_excerpt":"A secret key agreement framework between three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. There is a generalized discrete memoryless multiple access channel (GDMMAC) from users 1 and 2 to user 3 where the three users receive outputs from the channel. Furthermore, there is a broadcast channel (BC) from user 3 to users 1 and 2. Secret key sharing is intended where GDMMAC and BC can be successively used. In this framework, an inner bound of the secret key capacity region is derive"},"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":"1202.1387","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-07T10:04:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"42f4edacca5c78fbabe875c13a454137e4c1f4f1207056fa57e64be7de5f2b5a","abstract_canon_sha256":"5190eee92c40be94f0a78b16da6b547e2733293c3c2b73b7973bba7d67bd556a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:23.287773Z","signature_b64":"yZlZLrv9nFNPvvWcrP7+dBRO7GJ6u3QLOCYhE69nrJpDoZJ5Hy3/wNQCcHSzdWIMWxENZBE7MQzy5TE4oIudDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3f5e53f4a6d955c33aa800b335a4f39fcfab4f8f77fd3828794aa0d5a023bfc","last_reissued_at":"2026-05-18T03:26:23.287039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:23.287039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Successive Secret Key Agreement over Generalized Multiple Access and Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mahmoud Salmasizadeh, Mikael Skoglund, Mohammad Reza Aref, Somayeh Salimi","submitted_at":"2012-02-07T10:04:48Z","abstract_excerpt":"A secret key agreement framework between three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. There is a generalized discrete memoryless multiple access channel (GDMMAC) from users 1 and 2 to user 3 where the three users receive outputs from the channel. Furthermore, there is a broadcast channel (BC) from user 3 to users 1 and 2. Secret key sharing is intended where GDMMAC and BC can be successively used. In this framework, an inner bound of the secret key capacity region is derive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1387","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":"1202.1387","created_at":"2026-05-18T03:26:23.287162+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.1387v3","created_at":"2026-05-18T03:26:23.287162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1387","created_at":"2026-05-18T03:26:23.287162+00:00"},{"alias_kind":"pith_short_12","alias_value":"WP26KP2KNWKV","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WP26KP2KNWKVYM5K","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WP26KP2K","created_at":"2026-05-18T12:27:25.539911+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/WP26KP2KNWKVYM5KQAFTGWSPHH","json":"https://pith.science/pith/WP26KP2KNWKVYM5KQAFTGWSPHH.json","graph_json":"https://pith.science/api/pith-number/WP26KP2KNWKVYM5KQAFTGWSPHH/graph.json","events_json":"https://pith.science/api/pith-number/WP26KP2KNWKVYM5KQAFTGWSPHH/events.json","paper":"https://pith.science/paper/WP26KP2K"},"agent_actions":{"view_html":"https://pith.science/pith/WP26KP2KNWKVYM5KQAFTGWSPHH","download_json":"https://pith.science/pith/WP26KP2KNWKVYM5KQAFTGWSPHH.json","view_paper":"https://pith.science/paper/WP26KP2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.1387&json=true","fetch_graph":"https://pith.science/api/pith-number/WP26KP2KNWKVYM5KQAFTGWSPHH/graph.json","fetch_events":"https://pith.science/api/pith-number/WP26KP2KNWKVYM5KQAFTGWSPHH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WP26KP2KNWKVYM5KQAFTGWSPHH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WP26KP2KNWKVYM5KQAFTGWSPHH/action/storage_attestation","attest_author":"https://pith.science/pith/WP26KP2KNWKVYM5KQAFTGWSPHH/action/author_attestation","sign_citation":"https://pith.science/pith/WP26KP2KNWKVYM5KQAFTGWSPHH/action/citation_signature","submit_replication":"https://pith.science/pith/WP26KP2KNWKVYM5KQAFTGWSPHH/action/replication_record"}},"created_at":"2026-05-18T03:26:23.287162+00:00","updated_at":"2026-05-18T03:26:23.287162+00:00"}