{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:B7YKJYYY66KIDZ77SVPNVGY6LR","short_pith_number":"pith:B7YKJYYY","canonical_record":{"source":{"id":"1603.05399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-17T09:24:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f2f46ce28f4e6a6c5f49d0d3f12b66c2dd132065658d831f49ae279833503c13","abstract_canon_sha256":"73f8ed2a639e6896890c2340f717e99becce74e6463ea7482fe6df0acc507048"},"schema_version":"1.0"},"canonical_sha256":"0ff0a4e318f79481e7ff955eda9b1e5c74e084fb4e7cf26cd85d30c18877afd5","source":{"kind":"arxiv","id":"1603.05399","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05399","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05399v1","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05399","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"pith_short_12","alias_value":"B7YKJYYY66KI","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B7YKJYYY66KIDZ77","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B7YKJYYY","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:B7YKJYYY66KIDZ77SVPNVGY6LR","target":"record","payload":{"canonical_record":{"source":{"id":"1603.05399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-17T09:24:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f2f46ce28f4e6a6c5f49d0d3f12b66c2dd132065658d831f49ae279833503c13","abstract_canon_sha256":"73f8ed2a639e6896890c2340f717e99becce74e6463ea7482fe6df0acc507048"},"schema_version":"1.0"},"canonical_sha256":"0ff0a4e318f79481e7ff955eda9b1e5c74e084fb4e7cf26cd85d30c18877afd5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:56.442715Z","signature_b64":"zwKi/27t9ztgL9Mkgh/McS/ynVkEVqsFoauMncfUnMDWfiDBWm1c+rFXrMb95efQLrq+NQC39V+cPPwnRzj+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ff0a4e318f79481e7ff955eda9b1e5c74e084fb4e7cf26cd85d30c18877afd5","last_reissued_at":"2026-05-18T01:18:56.442138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:56.442138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.05399","source_version":1,"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-18T01:18:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uhnYWNyeY0fAfIb8E55iHxMs9TMvEE/I/zsqVlKTjHnAAmNZDU2BEq/7+9HiMG0JdafB11OKTB7ZFwaXeHiaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:57:57.389298Z"},"content_sha256":"cb546428d9a960f4f1bad15539f388c7f1e210e76162065ff1e855afea11110e","schema_version":"1.0","event_id":"sha256:cb546428d9a960f4f1bad15539f388c7f1e210e76162065ff1e855afea11110e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:B7YKJYYY66KIDZ77SVPNVGY6LR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong Secrecy in Pairwise Key Agreement over a Generalized Multiple Access Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Frederic Gabry, Matthieu Bloch, Mikael Skoglund, Panos Papadimitratos, Somayeh Salimi","submitted_at":"2016-03-17T09:24:10Z","abstract_excerpt":"This paper considers the problem of pairwise key agreement without public communication between three users connected through a generalized multiple access channel (MAC). While two users control the channel inputs, all three users observe noisy outputs from the channel and each pair of users wishes to agree on a secret key hidden from the remaining user. We first develop a \"pre-generated\" key-agreement scheme based on secrecy codes for the generalized MAC, in which the channel is only used to distribute pre-generated secret keys. We then extend this scheme to include an additional layer of rat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05399","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"},"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-18T01:18:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BLLaqNQDc/WJsVcqB7PB3oDFZA4R3N4ifZu0Kfb9L9baWYTv/uxNzSum8TwqGL6EIbnUgA1b68ojx8e8Y6rtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:57:57.389663Z"},"content_sha256":"53e94895414538d814e44d2d4685fc90dd80a70e225fd9c7e3f878aa348e05e3","schema_version":"1.0","event_id":"sha256:53e94895414538d814e44d2d4685fc90dd80a70e225fd9c7e3f878aa348e05e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B7YKJYYY66KIDZ77SVPNVGY6LR/bundle.json","state_url":"https://pith.science/pith/B7YKJYYY66KIDZ77SVPNVGY6LR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B7YKJYYY66KIDZ77SVPNVGY6LR/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-20T09:57:57Z","links":{"resolver":"https://pith.science/pith/B7YKJYYY66KIDZ77SVPNVGY6LR","bundle":"https://pith.science/pith/B7YKJYYY66KIDZ77SVPNVGY6LR/bundle.json","state":"https://pith.science/pith/B7YKJYYY66KIDZ77SVPNVGY6LR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B7YKJYYY66KIDZ77SVPNVGY6LR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:B7YKJYYY66KIDZ77SVPNVGY6LR","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":"73f8ed2a639e6896890c2340f717e99becce74e6463ea7482fe6df0acc507048","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-17T09:24:10Z","title_canon_sha256":"f2f46ce28f4e6a6c5f49d0d3f12b66c2dd132065658d831f49ae279833503c13"},"schema_version":"1.0","source":{"id":"1603.05399","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05399","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05399v1","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05399","created_at":"2026-05-18T01:18:56Z"},{"alias_kind":"pith_short_12","alias_value":"B7YKJYYY66KI","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B7YKJYYY66KIDZ77","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B7YKJYYY","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:53e94895414538d814e44d2d4685fc90dd80a70e225fd9c7e3f878aa348e05e3","target":"graph","created_at":"2026-05-18T01:18:56Z","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":"This paper considers the problem of pairwise key agreement without public communication between three users connected through a generalized multiple access channel (MAC). While two users control the channel inputs, all three users observe noisy outputs from the channel and each pair of users wishes to agree on a secret key hidden from the remaining user. We first develop a \"pre-generated\" key-agreement scheme based on secrecy codes for the generalized MAC, in which the channel is only used to distribute pre-generated secret keys. We then extend this scheme to include an additional layer of rat","authors_text":"Frederic Gabry, Matthieu Bloch, Mikael Skoglund, Panos Papadimitratos, Somayeh Salimi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-17T09:24:10Z","title":"Strong Secrecy in Pairwise Key Agreement over a Generalized Multiple Access Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05399","kind":"arxiv","version":1},"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:cb546428d9a960f4f1bad15539f388c7f1e210e76162065ff1e855afea11110e","target":"record","created_at":"2026-05-18T01:18:56Z","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":"73f8ed2a639e6896890c2340f717e99becce74e6463ea7482fe6df0acc507048","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-17T09:24:10Z","title_canon_sha256":"f2f46ce28f4e6a6c5f49d0d3f12b66c2dd132065658d831f49ae279833503c13"},"schema_version":"1.0","source":{"id":"1603.05399","kind":"arxiv","version":1}},"canonical_sha256":"0ff0a4e318f79481e7ff955eda9b1e5c74e084fb4e7cf26cd85d30c18877afd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ff0a4e318f79481e7ff955eda9b1e5c74e084fb4e7cf26cd85d30c18877afd5","first_computed_at":"2026-05-18T01:18:56.442138Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:56.442138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zwKi/27t9ztgL9Mkgh/McS/ynVkEVqsFoauMncfUnMDWfiDBWm1c+rFXrMb95efQLrq+NQC39V+cPPwnRzj+Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:56.442715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05399","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb546428d9a960f4f1bad15539f388c7f1e210e76162065ff1e855afea11110e","sha256:53e94895414538d814e44d2d4685fc90dd80a70e225fd9c7e3f878aa348e05e3"],"state_sha256":"6068b255d9395d43c48744d3ef5bf703a99ba63571db11ef57b3e7baf806cab4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AnqdUhXujrLFQEYh+iLm7JTpcp8zu6p5+IH+cP4V50qLFgcXQQxE9A5FkR3BBa94UTM8A1i9ZbM3m3YqPSt0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T09:57:57.391591Z","bundle_sha256":"f89018d143c689a2cea8ce61d0228972aeaf30f11de14e157427c3b5a872999d"}}