{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JBQQT6XH2V7727JR7AW3VFWQEU","short_pith_number":"pith:JBQQT6XH","canonical_record":{"source":{"id":"1701.02882","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T08:17:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"37852a034766ee4e80d9e5a4a936b1e5a2339aa55501a668bf62ccf626d96d5f","abstract_canon_sha256":"c2751511746d10f2e4dffdb7a45a228d32a175ef2bffc382ec521dd760abff1e"},"schema_version":"1.0"},"canonical_sha256":"486109fae7d57ffd7d31f82dba96d0253065396b575b966dbd71e14524f2df34","source":{"kind":"arxiv","id":"1701.02882","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02882","created_at":"2026-05-18T00:52:22Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02882v2","created_at":"2026-05-18T00:52:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02882","created_at":"2026-05-18T00:52:22Z"},{"alias_kind":"pith_short_12","alias_value":"JBQQT6XH2V77","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JBQQT6XH2V7727JR","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JBQQT6XH","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JBQQT6XH2V7727JR7AW3VFWQEU","target":"record","payload":{"canonical_record":{"source":{"id":"1701.02882","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T08:17:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"37852a034766ee4e80d9e5a4a936b1e5a2339aa55501a668bf62ccf626d96d5f","abstract_canon_sha256":"c2751511746d10f2e4dffdb7a45a228d32a175ef2bffc382ec521dd760abff1e"},"schema_version":"1.0"},"canonical_sha256":"486109fae7d57ffd7d31f82dba96d0253065396b575b966dbd71e14524f2df34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:22.253787Z","signature_b64":"tWAd0h8PnRzkM1nZ4DBptL7fuHVrmsakYLTazk40Z9EUi1LCmC87VBnJ8GVv7EUDXlSOIqYaJUotkTjOwaobCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"486109fae7d57ffd7d31f82dba96d0253065396b575b966dbd71e14524f2df34","last_reissued_at":"2026-05-18T00:52:22.252853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:22.252853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.02882","source_version":2,"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-18T00:52:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+osqSwx5jTQ6LQ3BHg/4t1jj+52BwAKn3KmfW62u8vAIeVLacqNP6LfN+cLXUD8xRvDRePjpNF4ZI8ZvFKpzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:20:35.492862Z"},"content_sha256":"8253dabe95f4b725c23fb62a463377530369fa90116d3e07960bb87e3ce687c0","schema_version":"1.0","event_id":"sha256:8253dabe95f4b725c23fb62a463377530369fa90116d3e07960bb87e3ce687c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JBQQT6XH2V7727JR7AW3VFWQEU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Secrecy Capacity of Gaussian MIMO Channels with Finite Memory - Full Version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniel Zahavi, Nir Shlezinger, Ron Dabora, Yonathan Murin","submitted_at":"2017-01-11T08:17:37Z","abstract_excerpt":"In this work we study the secrecy capacity of Gaussian multiple-input multiple-output (MIMO) wiretap channels (WTCs) with a finite memory, subject to a per-symbol average power constraint on the MIMO channel input. MIMO channels with finite memory are very common in wireless communications as well as in wireline communications (e.g., in communications over power lines). To derive the secrecy capacity of the Gaussian MIMO WTC with finite memory we first construct an asymptotically-equivalent block-memoryless MIMO WTC, which is then transformed into a set of parallel, independent, memoryless MIM"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02882","kind":"arxiv","version":2},"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-18T00:52:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YihJtTpyHGOh4Oyc2BABKDqi8z8jvGyRq+BrCRIfSFKwDVWW805t/7sHvAa5kiF6Qg7R7NFr8qx9wLsOUZGtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:20:35.493523Z"},"content_sha256":"cd5d1fbfc1142922ae313044fc5e3c0611e1ca2a8037ee0b16d8ecd5dec69035","schema_version":"1.0","event_id":"sha256:cd5d1fbfc1142922ae313044fc5e3c0611e1ca2a8037ee0b16d8ecd5dec69035"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JBQQT6XH2V7727JR7AW3VFWQEU/bundle.json","state_url":"https://pith.science/pith/JBQQT6XH2V7727JR7AW3VFWQEU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JBQQT6XH2V7727JR7AW3VFWQEU/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-25T18:20:35Z","links":{"resolver":"https://pith.science/pith/JBQQT6XH2V7727JR7AW3VFWQEU","bundle":"https://pith.science/pith/JBQQT6XH2V7727JR7AW3VFWQEU/bundle.json","state":"https://pith.science/pith/JBQQT6XH2V7727JR7AW3VFWQEU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JBQQT6XH2V7727JR7AW3VFWQEU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JBQQT6XH2V7727JR7AW3VFWQEU","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":"c2751511746d10f2e4dffdb7a45a228d32a175ef2bffc382ec521dd760abff1e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T08:17:37Z","title_canon_sha256":"37852a034766ee4e80d9e5a4a936b1e5a2339aa55501a668bf62ccf626d96d5f"},"schema_version":"1.0","source":{"id":"1701.02882","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02882","created_at":"2026-05-18T00:52:22Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02882v2","created_at":"2026-05-18T00:52:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02882","created_at":"2026-05-18T00:52:22Z"},{"alias_kind":"pith_short_12","alias_value":"JBQQT6XH2V77","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JBQQT6XH2V7727JR","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JBQQT6XH","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:cd5d1fbfc1142922ae313044fc5e3c0611e1ca2a8037ee0b16d8ecd5dec69035","target":"graph","created_at":"2026-05-18T00:52:22Z","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":"In this work we study the secrecy capacity of Gaussian multiple-input multiple-output (MIMO) wiretap channels (WTCs) with a finite memory, subject to a per-symbol average power constraint on the MIMO channel input. MIMO channels with finite memory are very common in wireless communications as well as in wireline communications (e.g., in communications over power lines). To derive the secrecy capacity of the Gaussian MIMO WTC with finite memory we first construct an asymptotically-equivalent block-memoryless MIMO WTC, which is then transformed into a set of parallel, independent, memoryless MIM","authors_text":"Daniel Zahavi, Nir Shlezinger, Ron Dabora, Yonathan Murin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T08:17:37Z","title":"The Secrecy Capacity of Gaussian MIMO Channels with Finite Memory - Full Version"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02882","kind":"arxiv","version":2},"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:8253dabe95f4b725c23fb62a463377530369fa90116d3e07960bb87e3ce687c0","target":"record","created_at":"2026-05-18T00:52:22Z","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":"c2751511746d10f2e4dffdb7a45a228d32a175ef2bffc382ec521dd760abff1e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-11T08:17:37Z","title_canon_sha256":"37852a034766ee4e80d9e5a4a936b1e5a2339aa55501a668bf62ccf626d96d5f"},"schema_version":"1.0","source":{"id":"1701.02882","kind":"arxiv","version":2}},"canonical_sha256":"486109fae7d57ffd7d31f82dba96d0253065396b575b966dbd71e14524f2df34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"486109fae7d57ffd7d31f82dba96d0253065396b575b966dbd71e14524f2df34","first_computed_at":"2026-05-18T00:52:22.252853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:22.252853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tWAd0h8PnRzkM1nZ4DBptL7fuHVrmsakYLTazk40Z9EUi1LCmC87VBnJ8GVv7EUDXlSOIqYaJUotkTjOwaobCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:22.253787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02882","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8253dabe95f4b725c23fb62a463377530369fa90116d3e07960bb87e3ce687c0","sha256:cd5d1fbfc1142922ae313044fc5e3c0611e1ca2a8037ee0b16d8ecd5dec69035"],"state_sha256":"0c86b49c6cf965a86f614aaf232a2dbc8c878896a370e1b818d867c1d975ec68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oBEib39fX6LGqjFvoJeomh0ZivQsyLHPFlrjXPHabrRLtcZ8Lq6DMKx+i8gqIsdFjYY4Z3PubWjWZdR1gzgTAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:20:35.497485Z","bundle_sha256":"37a16552993ae068a74fa401fa34a48842ab48040f50e8aaa6122583b2e5a1e7"}}