{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RAG52LY4MKGBORKKCMKGFURSVN","short_pith_number":"pith:RAG52LY4","canonical_record":{"source":{"id":"1105.2621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-13T06:17:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3731a8d54b655524fd3b7bf14a034e593c49b484c4857e4e1d6c14d99af74dc1","abstract_canon_sha256":"88b5366f0e912573f796f8af63dae0760cc7f5f6eb77fb3b0eee5c034678b07f"},"schema_version":"1.0"},"canonical_sha256":"880ddd2f1c628c17454a131462d232ab78d4a8432672cd34da8dccd1ce2f3d93","source":{"kind":"arxiv","id":"1105.2621","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2621","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2621v1","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2621","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"RAG52LY4MKGB","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RAG52LY4MKGBORKK","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RAG52LY4","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RAG52LY4MKGBORKKCMKGFURSVN","target":"record","payload":{"canonical_record":{"source":{"id":"1105.2621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-13T06:17:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3731a8d54b655524fd3b7bf14a034e593c49b484c4857e4e1d6c14d99af74dc1","abstract_canon_sha256":"88b5366f0e912573f796f8af63dae0760cc7f5f6eb77fb3b0eee5c034678b07f"},"schema_version":"1.0"},"canonical_sha256":"880ddd2f1c628c17454a131462d232ab78d4a8432672cd34da8dccd1ce2f3d93","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:00.297657Z","signature_b64":"tnTvmN3dnB+3eXmwetQJkGHZkiBQmLuAT8uMJjJx4k9xaHTUTJPhR5jWv7NngJDI3iMOgGJUa1zX4PcpaFJECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"880ddd2f1c628c17454a131462d232ab78d4a8432672cd34da8dccd1ce2f3d93","last_reissued_at":"2026-05-18T02:22:00.296848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:00.296848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.2621","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-18T02:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OL0mdxu18hh+0LyuLUFM397gxCUrkM9XkGrIqTqIfN2kjb1GQNFWgCiH/DMWIh3wQjw893GzS4Gn678aKKexAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:40:17.022870Z"},"content_sha256":"5548a5a8168f798a8b86c8256da133bb96dcfd78434562bebf112a9fe7d77cc5","schema_version":"1.0","event_id":"sha256:5548a5a8168f798a8b86c8256da133bb96dcfd78434562bebf112a9fe7d77cc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RAG52LY4MKGBORKKCMKGFURSVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Compressed Sensing Wire-Tap Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Galen Reeves, Michael Gastpar, Naveen Goela, Nebojsa Milosavljevic","submitted_at":"2011-05-13T06:17:33Z","abstract_excerpt":"A multiplicative Gaussian wire-tap channel inspired by compressed sensing is studied. Lower and upper bounds on the secrecy capacity are derived, and shown to be relatively tight in the large system limit for a large class of compressed sensing matrices. Surprisingly, it is shown that the secrecy capacity of this channel is nearly equal to the capacity without any secrecy constraint provided that the channel of the eavesdropper is strictly worse than the channel of the intended receiver. In other words, the eavesdropper can see almost everything and yet learn almost nothing. This behavior, whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2621","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-18T02:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hs5FWVSY5AhbIG2Usu8GKN+Q0v50O+3EKcOXDw2suVzekGUs9J57NirCSEBTGEtQ85+5Sh9l+2YdMvXCm/vIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:40:17.023221Z"},"content_sha256":"d81157a5e2b6e5f5c15ea5a2137cd0f3f4ddc0dc941b26a3fc6495fb53efe102","schema_version":"1.0","event_id":"sha256:d81157a5e2b6e5f5c15ea5a2137cd0f3f4ddc0dc941b26a3fc6495fb53efe102"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAG52LY4MKGBORKKCMKGFURSVN/bundle.json","state_url":"https://pith.science/pith/RAG52LY4MKGBORKKCMKGFURSVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAG52LY4MKGBORKKCMKGFURSVN/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-05-28T03:40:17Z","links":{"resolver":"https://pith.science/pith/RAG52LY4MKGBORKKCMKGFURSVN","bundle":"https://pith.science/pith/RAG52LY4MKGBORKKCMKGFURSVN/bundle.json","state":"https://pith.science/pith/RAG52LY4MKGBORKKCMKGFURSVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAG52LY4MKGBORKKCMKGFURSVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RAG52LY4MKGBORKKCMKGFURSVN","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":"88b5366f0e912573f796f8af63dae0760cc7f5f6eb77fb3b0eee5c034678b07f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-13T06:17:33Z","title_canon_sha256":"3731a8d54b655524fd3b7bf14a034e593c49b484c4857e4e1d6c14d99af74dc1"},"schema_version":"1.0","source":{"id":"1105.2621","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2621","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2621v1","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2621","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"RAG52LY4MKGB","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RAG52LY4MKGBORKK","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RAG52LY4","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:d81157a5e2b6e5f5c15ea5a2137cd0f3f4ddc0dc941b26a3fc6495fb53efe102","target":"graph","created_at":"2026-05-18T02:22:00Z","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":"A multiplicative Gaussian wire-tap channel inspired by compressed sensing is studied. Lower and upper bounds on the secrecy capacity are derived, and shown to be relatively tight in the large system limit for a large class of compressed sensing matrices. Surprisingly, it is shown that the secrecy capacity of this channel is nearly equal to the capacity without any secrecy constraint provided that the channel of the eavesdropper is strictly worse than the channel of the intended receiver. In other words, the eavesdropper can see almost everything and yet learn almost nothing. This behavior, whi","authors_text":"Galen Reeves, Michael Gastpar, Naveen Goela, Nebojsa Milosavljevic","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-13T06:17:33Z","title":"A Compressed Sensing Wire-Tap Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2621","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:5548a5a8168f798a8b86c8256da133bb96dcfd78434562bebf112a9fe7d77cc5","target":"record","created_at":"2026-05-18T02:22:00Z","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":"88b5366f0e912573f796f8af63dae0760cc7f5f6eb77fb3b0eee5c034678b07f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-13T06:17:33Z","title_canon_sha256":"3731a8d54b655524fd3b7bf14a034e593c49b484c4857e4e1d6c14d99af74dc1"},"schema_version":"1.0","source":{"id":"1105.2621","kind":"arxiv","version":1}},"canonical_sha256":"880ddd2f1c628c17454a131462d232ab78d4a8432672cd34da8dccd1ce2f3d93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"880ddd2f1c628c17454a131462d232ab78d4a8432672cd34da8dccd1ce2f3d93","first_computed_at":"2026-05-18T02:22:00.296848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:00.296848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tnTvmN3dnB+3eXmwetQJkGHZkiBQmLuAT8uMJjJx4k9xaHTUTJPhR5jWv7NngJDI3iMOgGJUa1zX4PcpaFJECw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:00.297657Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.2621","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5548a5a8168f798a8b86c8256da133bb96dcfd78434562bebf112a9fe7d77cc5","sha256:d81157a5e2b6e5f5c15ea5a2137cd0f3f4ddc0dc941b26a3fc6495fb53efe102"],"state_sha256":"dc6737b2d339d9cf775c882446f652db349f2dbc7a7ea08dbebfe14c869e5c50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4wGkLFTAlk7xiXjzOHsxaRSmkF0jtPm2MEXpe0fEHqtOMZt1UVV/oTmvSzkr68xyIJ7Rl9pleQrEICJO7rIHBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:40:17.025251Z","bundle_sha256":"7a24c4315b3cc89cbe676d2a465d97c80390b8178b760585bae93b4385d2da5b"}}