{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7IQDW6PJOTYIHG5A3S3NOLWGOM","short_pith_number":"pith:7IQDW6PJ","canonical_record":{"source":{"id":"1208.0688","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-08-03T08:35:43Z","cross_cats_sorted":[],"title_canon_sha256":"e2ccbe0db85f3e19caf6187d130a0db6a56b5e3beed70854f3977353cfb5eb1b","abstract_canon_sha256":"ee45f858a7bc236588841ddebe119347451a0e6960e20bf8871ec7b09a02e42e"},"schema_version":"1.0"},"canonical_sha256":"fa203b79e974f0839ba0dcb6d72ec6732a09d2324a3f99546c2ba450983fcc48","source":{"kind":"arxiv","id":"1208.0688","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0688","created_at":"2026-05-18T03:49:23Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0688v1","created_at":"2026-05-18T03:49:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0688","created_at":"2026-05-18T03:49:23Z"},{"alias_kind":"pith_short_12","alias_value":"7IQDW6PJOTYI","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7IQDW6PJOTYIHG5A","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7IQDW6PJ","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7IQDW6PJOTYIHG5A3S3NOLWGOM","target":"record","payload":{"canonical_record":{"source":{"id":"1208.0688","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-08-03T08:35:43Z","cross_cats_sorted":[],"title_canon_sha256":"e2ccbe0db85f3e19caf6187d130a0db6a56b5e3beed70854f3977353cfb5eb1b","abstract_canon_sha256":"ee45f858a7bc236588841ddebe119347451a0e6960e20bf8871ec7b09a02e42e"},"schema_version":"1.0"},"canonical_sha256":"fa203b79e974f0839ba0dcb6d72ec6732a09d2324a3f99546c2ba450983fcc48","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:23.096571Z","signature_b64":"PVpCGEhywSOIrWfz+m3k7nNmIBK2QDPFIyvd7qQp4mhapFRXqwfIERN1Eabdb5f1p8Zd9KxDyxqgpeQwUoLoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa203b79e974f0839ba0dcb6d72ec6732a09d2324a3f99546c2ba450983fcc48","last_reissued_at":"2026-05-18T03:49:23.095751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:23.095751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.0688","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-18T03:49:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"11OhLWM+acWIeCV/sB2bm6EGxJ25gQlBnHgsMRtYhZ0C3ec33MdPnfLJnaIPazhBzbBmlyghZLtTcccPScPHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:38:19.738873Z"},"content_sha256":"83ad8399a3ce428f81898d8c0a938c74fae1c920f8e255fe86c997d1aec7e0ef","schema_version":"1.0","event_id":"sha256:83ad8399a3ce428f81898d8c0a938c74fae1c920f8e255fe86c997d1aec7e0ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7IQDW6PJOTYIHG5A3S3NOLWGOM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient and Secure Key Extraction using CSI without Chasing down Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jinsong Han, Jizhong Zhao, Shaojie Tang, Wei Xi, Xiangyang Li, Yihong Gong, Yunhao Liu, Zehua Zhou","submitted_at":"2012-08-03T08:35:43Z","abstract_excerpt":"Generating keys and keeping them secret is critical in secure communications. Due to the \"open-air\" nature, key distribution is more susceptible to attacks in wireless communications. An ingenious solution is to generate common secret keys by two communicating parties separately without the need of key exchange or distribution, and regenerate them on needs. Recently, it is promising to extract keys by measuring the random variation in wireless channels, e.g., RSS. In this paper, we propose an efficient Secret Key Extraction protocol without Chasing down Errors, SKECE. It establishes common cry"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0688","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-18T03:49:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NL9RQJnGGMDbXf/ozs6SW38OM/aYsu4Er4vAQgZSBWS2RhbR9MdB9RMy5ogof4zb2Q6S4MLm36m7ypehQ1dSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:38:19.739476Z"},"content_sha256":"84a8203dfb38eeb050ffe38dbd507f18442d0e32eb83dc17bf4c832d2b539f3f","schema_version":"1.0","event_id":"sha256:84a8203dfb38eeb050ffe38dbd507f18442d0e32eb83dc17bf4c832d2b539f3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7IQDW6PJOTYIHG5A3S3NOLWGOM/bundle.json","state_url":"https://pith.science/pith/7IQDW6PJOTYIHG5A3S3NOLWGOM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7IQDW6PJOTYIHG5A3S3NOLWGOM/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-04T23:38:19Z","links":{"resolver":"https://pith.science/pith/7IQDW6PJOTYIHG5A3S3NOLWGOM","bundle":"https://pith.science/pith/7IQDW6PJOTYIHG5A3S3NOLWGOM/bundle.json","state":"https://pith.science/pith/7IQDW6PJOTYIHG5A3S3NOLWGOM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7IQDW6PJOTYIHG5A3S3NOLWGOM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7IQDW6PJOTYIHG5A3S3NOLWGOM","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":"ee45f858a7bc236588841ddebe119347451a0e6960e20bf8871ec7b09a02e42e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-08-03T08:35:43Z","title_canon_sha256":"e2ccbe0db85f3e19caf6187d130a0db6a56b5e3beed70854f3977353cfb5eb1b"},"schema_version":"1.0","source":{"id":"1208.0688","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0688","created_at":"2026-05-18T03:49:23Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0688v1","created_at":"2026-05-18T03:49:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0688","created_at":"2026-05-18T03:49:23Z"},{"alias_kind":"pith_short_12","alias_value":"7IQDW6PJOTYI","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7IQDW6PJOTYIHG5A","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7IQDW6PJ","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:84a8203dfb38eeb050ffe38dbd507f18442d0e32eb83dc17bf4c832d2b539f3f","target":"graph","created_at":"2026-05-18T03:49: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":"Generating keys and keeping them secret is critical in secure communications. Due to the \"open-air\" nature, key distribution is more susceptible to attacks in wireless communications. An ingenious solution is to generate common secret keys by two communicating parties separately without the need of key exchange or distribution, and regenerate them on needs. Recently, it is promising to extract keys by measuring the random variation in wireless channels, e.g., RSS. In this paper, we propose an efficient Secret Key Extraction protocol without Chasing down Errors, SKECE. It establishes common cry","authors_text":"Jinsong Han, Jizhong Zhao, Shaojie Tang, Wei Xi, Xiangyang Li, Yihong Gong, Yunhao Liu, Zehua Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-08-03T08:35:43Z","title":"Efficient and Secure Key Extraction using CSI without Chasing down Errors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0688","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:83ad8399a3ce428f81898d8c0a938c74fae1c920f8e255fe86c997d1aec7e0ef","target":"record","created_at":"2026-05-18T03:49: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":"ee45f858a7bc236588841ddebe119347451a0e6960e20bf8871ec7b09a02e42e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-08-03T08:35:43Z","title_canon_sha256":"e2ccbe0db85f3e19caf6187d130a0db6a56b5e3beed70854f3977353cfb5eb1b"},"schema_version":"1.0","source":{"id":"1208.0688","kind":"arxiv","version":1}},"canonical_sha256":"fa203b79e974f0839ba0dcb6d72ec6732a09d2324a3f99546c2ba450983fcc48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa203b79e974f0839ba0dcb6d72ec6732a09d2324a3f99546c2ba450983fcc48","first_computed_at":"2026-05-18T03:49:23.095751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:23.095751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PVpCGEhywSOIrWfz+m3k7nNmIBK2QDPFIyvd7qQp4mhapFRXqwfIERN1Eabdb5f1p8Zd9KxDyxqgpeQwUoLoAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:23.096571Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.0688","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83ad8399a3ce428f81898d8c0a938c74fae1c920f8e255fe86c997d1aec7e0ef","sha256:84a8203dfb38eeb050ffe38dbd507f18442d0e32eb83dc17bf4c832d2b539f3f"],"state_sha256":"b1a3725b1038cb1e0149720707986adc64ec0078eb35402af1fd6d5790f7dbcb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D+bShBzqH5e5ZU4hGzMCj90ptjvBuJzRMs1Kp3777DZtxhY8NXWpgdcRVhWikoAqYGtN1Qwcjbavuf+QEk1NBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:38:19.742890Z","bundle_sha256":"e9a8756f1f0c661bb948d497ccae0fb9d65cb4f6ee791d7ccdbcee01ec2642cd"}}