{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WP26KP2KNWKVYM5KQAFTGWSPHH","short_pith_number":"pith:WP26KP2K","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"},"canonical_sha256":"b3f5e53f4a6d955c33aa800b335a4f39fcfab4f8f77fd3828794aa0d5a023bfc","source":{"kind":"arxiv","id":"1202.1387","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1387","created_at":"2026-05-18T03:26:23Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1387v3","created_at":"2026-05-18T03:26:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1387","created_at":"2026-05-18T03:26:23Z"},{"alias_kind":"pith_short_12","alias_value":"WP26KP2KNWKV","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WP26KP2KNWKVYM5K","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WP26KP2K","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WP26KP2KNWKVYM5KQAFTGWSPHH","target":"record","payload":{"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"},"canonical_sha256":"b3f5e53f4a6d955c33aa800b335a4f39fcfab4f8f77fd3828794aa0d5a023bfc","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"},"source_kind":"arxiv","source_id":"1202.1387","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:26:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yHKdPGshuVu8U0gTk/GbCFNn/oCRPlkjAeaic8D3MXV7MrB14nVmXdSKnTrZ//8leJu2fFH3TORoJUqVujdgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:59:40.634928Z"},"content_sha256":"fe57b58206061a8cc45651a784d01104d6305f3950d470fe126243d5c2653fa0","schema_version":"1.0","event_id":"sha256:fe57b58206061a8cc45651a784d01104d6305f3950d470fe126243d5c2653fa0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WP26KP2KNWKVYM5KQAFTGWSPHH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:26:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J9Tl+wAVz7IC2/LF8flD7qWSgluaVnMdrQxmYugR0bJWnBV2gm4m2BbTP8fqpwCGeBt8Tlhv+NSba0LTvctqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T15:59:40.635289Z"},"content_sha256":"af3174befad88aa20e90b480c863ade091c78ab8499dd99c23492e4152574d17","schema_version":"1.0","event_id":"sha256:af3174befad88aa20e90b480c863ade091c78ab8499dd99c23492e4152574d17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WP26KP2KNWKVYM5KQAFTGWSPHH/bundle.json","state_url":"https://pith.science/pith/WP26KP2KNWKVYM5KQAFTGWSPHH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WP26KP2KNWKVYM5KQAFTGWSPHH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T15:59:40Z","links":{"resolver":"https://pith.science/pith/WP26KP2KNWKVYM5KQAFTGWSPHH","bundle":"https://pith.science/pith/WP26KP2KNWKVYM5KQAFTGWSPHH/bundle.json","state":"https://pith.science/pith/WP26KP2KNWKVYM5KQAFTGWSPHH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WP26KP2KNWKVYM5KQAFTGWSPHH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WP26KP2KNWKVYM5KQAFTGWSPHH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5190eee92c40be94f0a78b16da6b547e2733293c3c2b73b7973bba7d67bd556a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-07T10:04:48Z","title_canon_sha256":"42f4edacca5c78fbabe875c13a454137e4c1f4f1207056fa57e64be7de5f2b5a"},"schema_version":"1.0","source":{"id":"1202.1387","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1387","created_at":"2026-05-18T03:26:23Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1387v3","created_at":"2026-05-18T03:26:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1387","created_at":"2026-05-18T03:26:23Z"},{"alias_kind":"pith_short_12","alias_value":"WP26KP2KNWKV","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WP26KP2KNWKVYM5K","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WP26KP2K","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:af3174befad88aa20e90b480c863ade091c78ab8499dd99c23492e4152574d17","target":"graph","created_at":"2026-05-18T03:26:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Mahmoud Salmasizadeh, Mikael Skoglund, Mohammad Reza Aref, Somayeh Salimi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-07T10:04:48Z","title":"Successive Secret Key Agreement over Generalized Multiple Access and Broadcast Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1387","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fe57b58206061a8cc45651a784d01104d6305f3950d470fe126243d5c2653fa0","target":"record","created_at":"2026-05-18T03:26:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5190eee92c40be94f0a78b16da6b547e2733293c3c2b73b7973bba7d67bd556a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-07T10:04:48Z","title_canon_sha256":"42f4edacca5c78fbabe875c13a454137e4c1f4f1207056fa57e64be7de5f2b5a"},"schema_version":"1.0","source":{"id":"1202.1387","kind":"arxiv","version":3}},"canonical_sha256":"b3f5e53f4a6d955c33aa800b335a4f39fcfab4f8f77fd3828794aa0d5a023bfc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3f5e53f4a6d955c33aa800b335a4f39fcfab4f8f77fd3828794aa0d5a023bfc","first_computed_at":"2026-05-18T03:26:23.287039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:23.287039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yZlZLrv9nFNPvvWcrP7+dBRO7GJ6u3QLOCYhE69nrJpDoZJ5Hy3/wNQCcHSzdWIMWxENZBE7MQzy5TE4oIudDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:23.287773Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.1387","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe57b58206061a8cc45651a784d01104d6305f3950d470fe126243d5c2653fa0","sha256:af3174befad88aa20e90b480c863ade091c78ab8499dd99c23492e4152574d17"],"state_sha256":"5dd29e162f66733c06311318c013d7e99466714feede7678aebf9c9b77b622c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wJxqt9ftHfjs0AZOM2KTsaCh9QurNJWEaUgLiNFoVxSffHCQ04CwRfazPICrGP9L1F8E/nXVc8yyARlRMGmgDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T15:59:40.637374Z","bundle_sha256":"cf493b9ced350f0f4a20ea090098de17e82091fe49ea26e9472bc094fae0643f"}}