{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:B7YKJYYY66KIDZ77SVPNVGY6LR","short_pith_number":"pith:B7YKJYYY","schema_version":"1.0","canonical_sha256":"0ff0a4e318f79481e7ff955eda9b1e5c74e084fb4e7cf26cd85d30c18877afd5","source":{"kind":"arxiv","id":"1603.05399","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.05399","created_at":"2026-05-18T01:18:56.442213+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05399v1","created_at":"2026-05-18T01:18:56.442213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05399","created_at":"2026-05-18T01:18:56.442213+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7YKJYYY66KI","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7YKJYYY66KIDZ77","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7YKJYYY","created_at":"2026-05-18T12:30:07.202191+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/B7YKJYYY66KIDZ77SVPNVGY6LR","json":"https://pith.science/pith/B7YKJYYY66KIDZ77SVPNVGY6LR.json","graph_json":"https://pith.science/api/pith-number/B7YKJYYY66KIDZ77SVPNVGY6LR/graph.json","events_json":"https://pith.science/api/pith-number/B7YKJYYY66KIDZ77SVPNVGY6LR/events.json","paper":"https://pith.science/paper/B7YKJYYY"},"agent_actions":{"view_html":"https://pith.science/pith/B7YKJYYY66KIDZ77SVPNVGY6LR","download_json":"https://pith.science/pith/B7YKJYYY66KIDZ77SVPNVGY6LR.json","view_paper":"https://pith.science/paper/B7YKJYYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05399&json=true","fetch_graph":"https://pith.science/api/pith-number/B7YKJYYY66KIDZ77SVPNVGY6LR/graph.json","fetch_events":"https://pith.science/api/pith-number/B7YKJYYY66KIDZ77SVPNVGY6LR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7YKJYYY66KIDZ77SVPNVGY6LR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7YKJYYY66KIDZ77SVPNVGY6LR/action/storage_attestation","attest_author":"https://pith.science/pith/B7YKJYYY66KIDZ77SVPNVGY6LR/action/author_attestation","sign_citation":"https://pith.science/pith/B7YKJYYY66KIDZ77SVPNVGY6LR/action/citation_signature","submit_replication":"https://pith.science/pith/B7YKJYYY66KIDZ77SVPNVGY6LR/action/replication_record"}},"created_at":"2026-05-18T01:18:56.442213+00:00","updated_at":"2026-05-18T01:18:56.442213+00:00"}