{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:C7SSRWSUFV7EB2GAA5ORZSN5GA","short_pith_number":"pith:C7SSRWSU","canonical_record":{"source":{"id":"1702.08258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-27T12:51:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2095d84b85c2efa13de1f25f3e3e233036af960587fd4b140a5639350d13dc80","abstract_canon_sha256":"6ea4df26ce9e5eb1e3ccb49fe35f8c10e4f18b232694ccb6b1842c85889740b0"},"schema_version":"1.0"},"canonical_sha256":"17e528da542d7e40e8c0075d1cc9bd302da3375750442dc37052d008fc9f204e","source":{"kind":"arxiv","id":"1702.08258","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08258","created_at":"2026-05-18T00:42:58Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08258v1","created_at":"2026-05-18T00:42:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08258","created_at":"2026-05-18T00:42:58Z"},{"alias_kind":"pith_short_12","alias_value":"C7SSRWSUFV7E","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"C7SSRWSUFV7EB2GA","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"C7SSRWSU","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:C7SSRWSUFV7EB2GAA5ORZSN5GA","target":"record","payload":{"canonical_record":{"source":{"id":"1702.08258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-27T12:51:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2095d84b85c2efa13de1f25f3e3e233036af960587fd4b140a5639350d13dc80","abstract_canon_sha256":"6ea4df26ce9e5eb1e3ccb49fe35f8c10e4f18b232694ccb6b1842c85889740b0"},"schema_version":"1.0"},"canonical_sha256":"17e528da542d7e40e8c0075d1cc9bd302da3375750442dc37052d008fc9f204e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:58.259205Z","signature_b64":"1snFELuoNB/8jlGWTDeL7dO6FYkauNrZq0mNtx9WoD3d82jN55rXA+rXKat1kagwLXAgmdVtRk+HDkUYX/ApBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17e528da542d7e40e8c0075d1cc9bd302da3375750442dc37052d008fc9f204e","last_reissued_at":"2026-05-18T00:42:58.258474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:58.258474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.08258","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:42:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ENwsrp/iuwwD8H9aeZggaI9mBJHVzmD9dVy2SU7BD+lPMCF8LtR9xUjyXl7VMdLu+KxD/se/q9WsFXBcnNS1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:22:56.353015Z"},"content_sha256":"e235e37fc3c0715f8db3b608309eec379485725dedfdca70f0bab40a113c87df","schema_version":"1.0","event_id":"sha256:e235e37fc3c0715f8db3b608309eec379485725dedfdca70f0bab40a113c87df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:C7SSRWSUFV7EB2GAA5ORZSN5GA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper and Lower Bounds for the Ergodic Capacity of MIMO Jacobi Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amor Nafkha, Remi Bonnefoi","submitted_at":"2017-02-27T12:51:46Z","abstract_excerpt":"In multi-(core/mode) optical fiber communication, the transmission channel can be modeled as a complex sub-matrix of the Haar-distributed unitary matrix (complex Jacobi unitary ensemble). In this letter, we present new analytical expressions of the upper and lower bounds for the ergodic capacity of multiple-input multiple-output Jacobi-fading channels. Recent results on the determinant of the Jacobi unitary ensemble are employed to derive a tight lower bound on the ergodic capacity. We use Jensen's inequality to provide an analytical closed-form upper bound to the ergodic capacity at any signa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08258","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:42:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N/zM974HqeyNn83x6txtXoPVI2rBzrdCJLO1yzGp5/FnNCl2okshMM2CRcESF9JYhfCQbo1ogiRUKCwmJP6RCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:22:56.353384Z"},"content_sha256":"b71540a366dacb190e47ff68e00fca2511bea3eca8c89ea93229ccdb1400de63","schema_version":"1.0","event_id":"sha256:b71540a366dacb190e47ff68e00fca2511bea3eca8c89ea93229ccdb1400de63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7SSRWSUFV7EB2GAA5ORZSN5GA/bundle.json","state_url":"https://pith.science/pith/C7SSRWSUFV7EB2GAA5ORZSN5GA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7SSRWSUFV7EB2GAA5ORZSN5GA/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-12T10:22:56Z","links":{"resolver":"https://pith.science/pith/C7SSRWSUFV7EB2GAA5ORZSN5GA","bundle":"https://pith.science/pith/C7SSRWSUFV7EB2GAA5ORZSN5GA/bundle.json","state":"https://pith.science/pith/C7SSRWSUFV7EB2GAA5ORZSN5GA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7SSRWSUFV7EB2GAA5ORZSN5GA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:C7SSRWSUFV7EB2GAA5ORZSN5GA","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":"6ea4df26ce9e5eb1e3ccb49fe35f8c10e4f18b232694ccb6b1842c85889740b0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-27T12:51:46Z","title_canon_sha256":"2095d84b85c2efa13de1f25f3e3e233036af960587fd4b140a5639350d13dc80"},"schema_version":"1.0","source":{"id":"1702.08258","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08258","created_at":"2026-05-18T00:42:58Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08258v1","created_at":"2026-05-18T00:42:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08258","created_at":"2026-05-18T00:42:58Z"},{"alias_kind":"pith_short_12","alias_value":"C7SSRWSUFV7E","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"C7SSRWSUFV7EB2GA","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"C7SSRWSU","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:b71540a366dacb190e47ff68e00fca2511bea3eca8c89ea93229ccdb1400de63","target":"graph","created_at":"2026-05-18T00:42:58Z","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 multi-(core/mode) optical fiber communication, the transmission channel can be modeled as a complex sub-matrix of the Haar-distributed unitary matrix (complex Jacobi unitary ensemble). In this letter, we present new analytical expressions of the upper and lower bounds for the ergodic capacity of multiple-input multiple-output Jacobi-fading channels. Recent results on the determinant of the Jacobi unitary ensemble are employed to derive a tight lower bound on the ergodic capacity. We use Jensen's inequality to provide an analytical closed-form upper bound to the ergodic capacity at any signa","authors_text":"Amor Nafkha, Remi Bonnefoi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-27T12:51:46Z","title":"Upper and Lower Bounds for the Ergodic Capacity of MIMO Jacobi Fading Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08258","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:e235e37fc3c0715f8db3b608309eec379485725dedfdca70f0bab40a113c87df","target":"record","created_at":"2026-05-18T00:42:58Z","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":"6ea4df26ce9e5eb1e3ccb49fe35f8c10e4f18b232694ccb6b1842c85889740b0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-27T12:51:46Z","title_canon_sha256":"2095d84b85c2efa13de1f25f3e3e233036af960587fd4b140a5639350d13dc80"},"schema_version":"1.0","source":{"id":"1702.08258","kind":"arxiv","version":1}},"canonical_sha256":"17e528da542d7e40e8c0075d1cc9bd302da3375750442dc37052d008fc9f204e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17e528da542d7e40e8c0075d1cc9bd302da3375750442dc37052d008fc9f204e","first_computed_at":"2026-05-18T00:42:58.258474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:58.258474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1snFELuoNB/8jlGWTDeL7dO6FYkauNrZq0mNtx9WoD3d82jN55rXA+rXKat1kagwLXAgmdVtRk+HDkUYX/ApBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:58.259205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08258","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e235e37fc3c0715f8db3b608309eec379485725dedfdca70f0bab40a113c87df","sha256:b71540a366dacb190e47ff68e00fca2511bea3eca8c89ea93229ccdb1400de63"],"state_sha256":"84f50d05fca66493595414a64ddb986eb73ed972a39ff5437f1dc8b8b0398022"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L+19f9/HThq44XcnRyewfeSP8sGBvmOeXK/vwdeuh5Jemtbic1Vio+RpfqVVz3JfHahsXeeqrqe6XXTjA7RWBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:22:56.355433Z","bundle_sha256":"fef6d16d908adb3dae9351ef45c09ef209d410ac425d0368a8c7040c4e4debd0"}}