{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:J4OSFQMGC5JFRWBEP3M2FAZ2TX","short_pith_number":"pith:J4OSFQMG","canonical_record":{"source":{"id":"1708.09517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-31T01:07:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"67d976eb6d560a971141d9ded217748c799642b635cc3c25466c30adfebdbce6","abstract_canon_sha256":"3bf8e26f87e5aaada09ee0121a7e3e5cef88f3949802ca9d8fbdc56ebd098429"},"schema_version":"1.0"},"canonical_sha256":"4f1d22c186175258d8247ed9a2833a9df806b91a4a5326d660e1e54d5aa0e396","source":{"kind":"arxiv","id":"1708.09517","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09517","created_at":"2026-05-18T00:36:18Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09517v1","created_at":"2026-05-18T00:36:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09517","created_at":"2026-05-18T00:36:18Z"},{"alias_kind":"pith_short_12","alias_value":"J4OSFQMGC5JF","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J4OSFQMGC5JFRWBE","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J4OSFQMG","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:J4OSFQMGC5JFRWBEP3M2FAZ2TX","target":"record","payload":{"canonical_record":{"source":{"id":"1708.09517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-31T01:07:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"67d976eb6d560a971141d9ded217748c799642b635cc3c25466c30adfebdbce6","abstract_canon_sha256":"3bf8e26f87e5aaada09ee0121a7e3e5cef88f3949802ca9d8fbdc56ebd098429"},"schema_version":"1.0"},"canonical_sha256":"4f1d22c186175258d8247ed9a2833a9df806b91a4a5326d660e1e54d5aa0e396","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:18.528813Z","signature_b64":"AWC50eXJlZtzlgiQ4sGey6HNGVog9wjVuY2Wuqo92PYCNQLQbyHCi8vm719IylG9NH8a8vU/tARlOK5YAOCIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f1d22c186175258d8247ed9a2833a9df806b91a4a5326d660e1e54d5aa0e396","last_reissued_at":"2026-05-18T00:36:18.528166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:18.528166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.09517","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-18T00:36:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P0B5dtZM+G8wCsGXcN1weYgoT0hV4VffS7AgToE9yWWnT6QWnw8kRn+ab4S+zV7u71M/5n6bd5H7VgcIvrskBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T03:16:51.903514Z"},"content_sha256":"bb8b55b483578bd966018e5844a7d80c02d07d82587462fb192537120c86e48c","schema_version":"1.0","event_id":"sha256:bb8b55b483578bd966018e5844a7d80c02d07d82587462fb192537120c86e48c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:J4OSFQMGC5JFRWBEP3M2FAZ2TX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper and Lower Bounds on the Capacity of Amplitude-Constrained MIMO Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Dytso, H. Vincent Poor, Mario Goldenbaum, Shlomo Shamai (Shitz)","submitted_at":"2017-08-31T01:07:21Z","abstract_excerpt":"In this work, novel upper and lower bounds for the capacity of channels with arbitrary constraints on the support of the channel input symbols are derived. As an immediate practical application, the case of multiple-input multiple-output channels with amplitude constraints is considered. The bounds are shown to be within a constant gap if the channel matrix is invertible and are tight in the high amplitude regime for arbitrary channel matrices. Moreover, in the high amplitude regime, it is shown that the capacity scales linearly with the minimum between the number of transmit and receive anten"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09517","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-18T00:36:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UjCurMDH2REZIJAx4099E6yYs2i0lh2mr+Mcs8dlLTQVD0TlF91I4jUE+UDCNrbRnZwCkt+3q7uApP/qaIz/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T03:16:51.903894Z"},"content_sha256":"b56befcde7fc49f115fb91ff486c200cbd449a6e3d238e90984f470eac27ade7","schema_version":"1.0","event_id":"sha256:b56befcde7fc49f115fb91ff486c200cbd449a6e3d238e90984f470eac27ade7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J4OSFQMGC5JFRWBEP3M2FAZ2TX/bundle.json","state_url":"https://pith.science/pith/J4OSFQMGC5JFRWBEP3M2FAZ2TX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J4OSFQMGC5JFRWBEP3M2FAZ2TX/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-23T03:16:51Z","links":{"resolver":"https://pith.science/pith/J4OSFQMGC5JFRWBEP3M2FAZ2TX","bundle":"https://pith.science/pith/J4OSFQMGC5JFRWBEP3M2FAZ2TX/bundle.json","state":"https://pith.science/pith/J4OSFQMGC5JFRWBEP3M2FAZ2TX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J4OSFQMGC5JFRWBEP3M2FAZ2TX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:J4OSFQMGC5JFRWBEP3M2FAZ2TX","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":"3bf8e26f87e5aaada09ee0121a7e3e5cef88f3949802ca9d8fbdc56ebd098429","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-31T01:07:21Z","title_canon_sha256":"67d976eb6d560a971141d9ded217748c799642b635cc3c25466c30adfebdbce6"},"schema_version":"1.0","source":{"id":"1708.09517","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09517","created_at":"2026-05-18T00:36:18Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09517v1","created_at":"2026-05-18T00:36:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09517","created_at":"2026-05-18T00:36:18Z"},{"alias_kind":"pith_short_12","alias_value":"J4OSFQMGC5JF","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J4OSFQMGC5JFRWBE","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J4OSFQMG","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:b56befcde7fc49f115fb91ff486c200cbd449a6e3d238e90984f470eac27ade7","target":"graph","created_at":"2026-05-18T00:36:18Z","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, novel upper and lower bounds for the capacity of channels with arbitrary constraints on the support of the channel input symbols are derived. As an immediate practical application, the case of multiple-input multiple-output channels with amplitude constraints is considered. The bounds are shown to be within a constant gap if the channel matrix is invertible and are tight in the high amplitude regime for arbitrary channel matrices. Moreover, in the high amplitude regime, it is shown that the capacity scales linearly with the minimum between the number of transmit and receive anten","authors_text":"Alex Dytso, H. Vincent Poor, Mario Goldenbaum, Shlomo Shamai (Shitz)","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-31T01:07:21Z","title":"Upper and Lower Bounds on the Capacity of Amplitude-Constrained MIMO Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09517","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:bb8b55b483578bd966018e5844a7d80c02d07d82587462fb192537120c86e48c","target":"record","created_at":"2026-05-18T00:36:18Z","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":"3bf8e26f87e5aaada09ee0121a7e3e5cef88f3949802ca9d8fbdc56ebd098429","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-31T01:07:21Z","title_canon_sha256":"67d976eb6d560a971141d9ded217748c799642b635cc3c25466c30adfebdbce6"},"schema_version":"1.0","source":{"id":"1708.09517","kind":"arxiv","version":1}},"canonical_sha256":"4f1d22c186175258d8247ed9a2833a9df806b91a4a5326d660e1e54d5aa0e396","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f1d22c186175258d8247ed9a2833a9df806b91a4a5326d660e1e54d5aa0e396","first_computed_at":"2026-05-18T00:36:18.528166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:18.528166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AWC50eXJlZtzlgiQ4sGey6HNGVog9wjVuY2Wuqo92PYCNQLQbyHCi8vm719IylG9NH8a8vU/tARlOK5YAOCIDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:18.528813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09517","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb8b55b483578bd966018e5844a7d80c02d07d82587462fb192537120c86e48c","sha256:b56befcde7fc49f115fb91ff486c200cbd449a6e3d238e90984f470eac27ade7"],"state_sha256":"885fde0475eefa8106cc1cf94900b60d6c1376990e8675818f98e850275cd5af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lV0VRkBQCzoP6yG2UntuFtCdQhv/r1j/AB3ftK6IVwssSYfr+4WoVUixLgcBkEwlGddZRP59rnSehFU2hS5YDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T03:16:51.905852Z","bundle_sha256":"e94e5b9c7b65624d250606491693894e7454211268b63113f78e8a452eec3ca1"}}