{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IS7BGJQ4MCJ75DJUYQYJB2SFHA","short_pith_number":"pith:IS7BGJQ4","canonical_record":{"source":{"id":"1105.5419","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-26T22:13:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c104371c5421a3df0c26bcc461c7234bef608d55f814f3c08ec46e2bc6d529a3","abstract_canon_sha256":"6cd1fc630d6ee247cd8ec1b88681b0e50c85d775b0be3c15d206c8f09421009c"},"schema_version":"1.0"},"canonical_sha256":"44be13261c6093fe8d34c43090ea4538176ce66f112444099f09fd9309c6c84e","source":{"kind":"arxiv","id":"1105.5419","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5419","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5419v3","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5419","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"pith_short_12","alias_value":"IS7BGJQ4MCJ7","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"IS7BGJQ4MCJ75DJU","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"IS7BGJQ4","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IS7BGJQ4MCJ75DJUYQYJB2SFHA","target":"record","payload":{"canonical_record":{"source":{"id":"1105.5419","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-26T22:13:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c104371c5421a3df0c26bcc461c7234bef608d55f814f3c08ec46e2bc6d529a3","abstract_canon_sha256":"6cd1fc630d6ee247cd8ec1b88681b0e50c85d775b0be3c15d206c8f09421009c"},"schema_version":"1.0"},"canonical_sha256":"44be13261c6093fe8d34c43090ea4538176ce66f112444099f09fd9309c6c84e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:07.121711Z","signature_b64":"+zhrEzPcyuGY7aq713TKNqBskHG4Zkvzp2krv2nFPgNkGDumEqpk2erNJyXHcRD4jpkg0SNFNm7n6xgoOTwvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44be13261c6093fe8d34c43090ea4538176ce66f112444099f09fd9309c6c84e","last_reissued_at":"2026-05-18T03:14:07.121223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:07.121223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.5419","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:14:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1yEEboI/NjoByl28r2ENIez3A1cIMluDD30Md0jLbkpBp6Dr1O4IyT/yUPfM3poaij2u/Tym9WAkmulKlUoiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:16:26.286514Z"},"content_sha256":"24cee132d6026bc9c67389f146124e96a2a20205bb2dcca0096aa67e622ab214","schema_version":"1.0","event_id":"sha256:24cee132d6026bc9c67389f146124e96a2a20205bb2dcca0096aa67e622ab214"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IS7BGJQ4MCJ75DJUYQYJB2SFHA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong Secrecy from Channel Resolvability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"J. Nicholas Laneman, Matthieu R. Bloch","submitted_at":"2011-05-26T22:13:37Z","abstract_excerpt":"We analyze physical-layer security based on the premise that the coding mechanism for secrecy over noisy channels is tied to the notion of channel resolvability. Instead of considering capacity-based constructions, which associate to each message a sub-code that operates just below the capacity of the eavesdropper's channel, we consider channel-resolvability-based constructions, which associate to each message a sub-code that operates just above the resolvability of the eavesdropper's channel. Building upon the work of Csiszar and Hayashi, we provide further evidence that channel resolvability"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5419","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:14:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ia7XsFwMSxOW7OZXVInTQTMgAMqngUKifz67kcfMABBQCFOpR+5aUzWvYkuxK337oWXz9a+/XnYK+tvoyiPDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:16:26.287071Z"},"content_sha256":"8b6cc7963df8922ebb0325a0ad59444d8f519e084dac3bac1cd3137e30737010","schema_version":"1.0","event_id":"sha256:8b6cc7963df8922ebb0325a0ad59444d8f519e084dac3bac1cd3137e30737010"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IS7BGJQ4MCJ75DJUYQYJB2SFHA/bundle.json","state_url":"https://pith.science/pith/IS7BGJQ4MCJ75DJUYQYJB2SFHA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IS7BGJQ4MCJ75DJUYQYJB2SFHA/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-05T04:16:26Z","links":{"resolver":"https://pith.science/pith/IS7BGJQ4MCJ75DJUYQYJB2SFHA","bundle":"https://pith.science/pith/IS7BGJQ4MCJ75DJUYQYJB2SFHA/bundle.json","state":"https://pith.science/pith/IS7BGJQ4MCJ75DJUYQYJB2SFHA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IS7BGJQ4MCJ75DJUYQYJB2SFHA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IS7BGJQ4MCJ75DJUYQYJB2SFHA","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":"6cd1fc630d6ee247cd8ec1b88681b0e50c85d775b0be3c15d206c8f09421009c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-26T22:13:37Z","title_canon_sha256":"c104371c5421a3df0c26bcc461c7234bef608d55f814f3c08ec46e2bc6d529a3"},"schema_version":"1.0","source":{"id":"1105.5419","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5419","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5419v3","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5419","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"pith_short_12","alias_value":"IS7BGJQ4MCJ7","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"IS7BGJQ4MCJ75DJU","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"IS7BGJQ4","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:8b6cc7963df8922ebb0325a0ad59444d8f519e084dac3bac1cd3137e30737010","target":"graph","created_at":"2026-05-18T03:14:07Z","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":"We analyze physical-layer security based on the premise that the coding mechanism for secrecy over noisy channels is tied to the notion of channel resolvability. Instead of considering capacity-based constructions, which associate to each message a sub-code that operates just below the capacity of the eavesdropper's channel, we consider channel-resolvability-based constructions, which associate to each message a sub-code that operates just above the resolvability of the eavesdropper's channel. Building upon the work of Csiszar and Hayashi, we provide further evidence that channel resolvability","authors_text":"J. Nicholas Laneman, Matthieu R. Bloch","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-26T22:13:37Z","title":"Strong Secrecy from Channel Resolvability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5419","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:24cee132d6026bc9c67389f146124e96a2a20205bb2dcca0096aa67e622ab214","target":"record","created_at":"2026-05-18T03:14:07Z","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":"6cd1fc630d6ee247cd8ec1b88681b0e50c85d775b0be3c15d206c8f09421009c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-26T22:13:37Z","title_canon_sha256":"c104371c5421a3df0c26bcc461c7234bef608d55f814f3c08ec46e2bc6d529a3"},"schema_version":"1.0","source":{"id":"1105.5419","kind":"arxiv","version":3}},"canonical_sha256":"44be13261c6093fe8d34c43090ea4538176ce66f112444099f09fd9309c6c84e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44be13261c6093fe8d34c43090ea4538176ce66f112444099f09fd9309c6c84e","first_computed_at":"2026-05-18T03:14:07.121223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:07.121223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+zhrEzPcyuGY7aq713TKNqBskHG4Zkvzp2krv2nFPgNkGDumEqpk2erNJyXHcRD4jpkg0SNFNm7n6xgoOTwvDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:07.121711Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.5419","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24cee132d6026bc9c67389f146124e96a2a20205bb2dcca0096aa67e622ab214","sha256:8b6cc7963df8922ebb0325a0ad59444d8f519e084dac3bac1cd3137e30737010"],"state_sha256":"1dc2fc8f0bd9399546c8b6c85f64df7497e34acfe7b45ca25d0c2e7e296f9c66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"76jOg6gSf15HpHtyT2pI1D0S01rizUxgJ55QMaBgI+9gvqI9YLfXUJ9FUKxeR9Wff6ID5TZsb2GzMwHMVmvZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T04:16:26.290234Z","bundle_sha256":"cd2a3a96e3f84b260703aeb3870054155255dead98929f102beb48de6b228b9f"}}