{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GQRXMAYVW24FNZL46OQJHXZW7V","short_pith_number":"pith:GQRXMAYV","schema_version":"1.0","canonical_sha256":"3423760315b6b856e57cf3a093df36fd7fc2eb028555bc63548dd56c58e45d87","source":{"kind":"arxiv","id":"1103.3113","version":1},"attestation_state":"computed","paper":{"title":"A Broadcast Approach To Secret Key Generation Over Slow Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"H. Vincent Poor, Predrag Spasojevic, Ruoheng Liu, Xiaojun Tang","submitted_at":"2011-03-16T07:03:51Z","abstract_excerpt":"A secret-key generation scheme based on a layered broadcasting strategy is introduced for slow-fading channels. In the model considered, Alice wants to share a key with Bob while keeping the key secret from Eve, who is a passive eavesdropper. Both Alice-Bob and Alice-Eve channels are assumed to undergo slow fading, and perfect channel state information (CSI) is assumed to be known only at the receivers during the transmission. In each fading slot, Alice broadcasts a continuum of coded layers and, hence, allows Bob to decode at the rate corresponding to the fading state (unknown to Alice). The "},"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":"1103.3113","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-16T07:03:51Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"9fcc24bdf0b00c07980c09f13e8fbba61785efc3966410411e6b829ee22aefa1","abstract_canon_sha256":"e0b0906df7986fdf094febc2bcaf454874da2c7d11dcd347ac3eb61239ec4a0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:44.763645Z","signature_b64":"fn48M7wM1J4FrIxyLzhoZE4moz+2nEkMc3wnylw79fxpBCEAKRnDDBCeJ1UflBPEUrHjyo/OJw5p1FFVssXFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3423760315b6b856e57cf3a093df36fd7fc2eb028555bc63548dd56c58e45d87","last_reissued_at":"2026-05-18T04:26:44.763050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:44.763050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Broadcast Approach To Secret Key Generation Over Slow Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"H. Vincent Poor, Predrag Spasojevic, Ruoheng Liu, Xiaojun Tang","submitted_at":"2011-03-16T07:03:51Z","abstract_excerpt":"A secret-key generation scheme based on a layered broadcasting strategy is introduced for slow-fading channels. In the model considered, Alice wants to share a key with Bob while keeping the key secret from Eve, who is a passive eavesdropper. Both Alice-Bob and Alice-Eve channels are assumed to undergo slow fading, and perfect channel state information (CSI) is assumed to be known only at the receivers during the transmission. In each fading slot, Alice broadcasts a continuum of coded layers and, hence, allows Bob to decode at the rate corresponding to the fading state (unknown to Alice). The "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3113","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":"1103.3113","created_at":"2026-05-18T04:26:44.763165+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.3113v1","created_at":"2026-05-18T04:26:44.763165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3113","created_at":"2026-05-18T04:26:44.763165+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQRXMAYVW24F","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQRXMAYVW24FNZL4","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQRXMAYV","created_at":"2026-05-18T12:26:30.835961+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/GQRXMAYVW24FNZL46OQJHXZW7V","json":"https://pith.science/pith/GQRXMAYVW24FNZL46OQJHXZW7V.json","graph_json":"https://pith.science/api/pith-number/GQRXMAYVW24FNZL46OQJHXZW7V/graph.json","events_json":"https://pith.science/api/pith-number/GQRXMAYVW24FNZL46OQJHXZW7V/events.json","paper":"https://pith.science/paper/GQRXMAYV"},"agent_actions":{"view_html":"https://pith.science/pith/GQRXMAYVW24FNZL46OQJHXZW7V","download_json":"https://pith.science/pith/GQRXMAYVW24FNZL46OQJHXZW7V.json","view_paper":"https://pith.science/paper/GQRXMAYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.3113&json=true","fetch_graph":"https://pith.science/api/pith-number/GQRXMAYVW24FNZL46OQJHXZW7V/graph.json","fetch_events":"https://pith.science/api/pith-number/GQRXMAYVW24FNZL46OQJHXZW7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQRXMAYVW24FNZL46OQJHXZW7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQRXMAYVW24FNZL46OQJHXZW7V/action/storage_attestation","attest_author":"https://pith.science/pith/GQRXMAYVW24FNZL46OQJHXZW7V/action/author_attestation","sign_citation":"https://pith.science/pith/GQRXMAYVW24FNZL46OQJHXZW7V/action/citation_signature","submit_replication":"https://pith.science/pith/GQRXMAYVW24FNZL46OQJHXZW7V/action/replication_record"}},"created_at":"2026-05-18T04:26:44.763165+00:00","updated_at":"2026-05-18T04:26:44.763165+00:00"}