{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UFKDUMKBEU3MGF6AY7KZSUDMM7","short_pith_number":"pith:UFKDUMKB","canonical_record":{"source":{"id":"1311.0433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-03T07:27:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"13fda06c13cbd681369b06b2f6fe2793e5763400777a7e93c5d3f5187fcd4228","abstract_canon_sha256":"8f6b6ddd60afd127a670dec6043f6b3ea56115bf7b388f9094f56fd766de1a39"},"schema_version":"1.0"},"canonical_sha256":"a1543a31412536c317c0c7d599506c67f19da4f03459833e8a88fdb110d73914","source":{"kind":"arxiv","id":"1311.0433","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0433","created_at":"2026-05-18T03:08:05Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0433v1","created_at":"2026-05-18T03:08:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0433","created_at":"2026-05-18T03:08:05Z"},{"alias_kind":"pith_short_12","alias_value":"UFKDUMKBEU3M","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UFKDUMKBEU3MGF6A","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UFKDUMKB","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UFKDUMKBEU3MGF6AY7KZSUDMM7","target":"record","payload":{"canonical_record":{"source":{"id":"1311.0433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-03T07:27:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"13fda06c13cbd681369b06b2f6fe2793e5763400777a7e93c5d3f5187fcd4228","abstract_canon_sha256":"8f6b6ddd60afd127a670dec6043f6b3ea56115bf7b388f9094f56fd766de1a39"},"schema_version":"1.0"},"canonical_sha256":"a1543a31412536c317c0c7d599506c67f19da4f03459833e8a88fdb110d73914","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:05.961296Z","signature_b64":"NJOM/cWXWSWpcJ7dFef1MehVmyTHMPOw0su5CY9xEjI1OyH61OOM0/CZepXlDnEzyUiNnyY4ukyY1qjvV06eDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1543a31412536c317c0c7d599506c67f19da4f03459833e8a88fdb110d73914","last_reissued_at":"2026-05-18T03:08:05.960612Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:05.960612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.0433","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-18T03:08:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MOqo1a++fzX5K/IB4Oz/aujNyQVAuHpUm0dptXrpYWTDcyoVFnZnLyW20eHlpnZAHn15c2o4/oKB/sfhUm3LBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:01:58.553864Z"},"content_sha256":"e1969204e5c94828661fd4c4629d53065c3588e7950711fe810f43a36d997c60","schema_version":"1.0","event_id":"sha256:e1969204e5c94828661fd4c4629d53065c3588e7950711fe810f43a36d997c60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UFKDUMKBEU3MGF6AY7KZSUDMM7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Iterative Geometric Mean Decomposition Algorithm for MIMO Communications Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chia-Hsiang Yang, Chiao-En Chen","submitted_at":"2013-11-03T07:27:55Z","abstract_excerpt":"This paper presents an iterative geometric mean decomposition (IGMD) algorithm for multiple-input-multiple-output (MIMO) wireless communications. In contrast to the existing GMD algorithms, the proposed IGMD does not require the explicit computation of the geometric mean of positive singular values of the channel matrix and hence is more suitable for hardware implementation. The proposed IGMD has a regular structure and can be easily adapted to solve problems with different dimensions. We show that the proposed IGMD is guaranteed to converge to the perfect GMD under certain sufficient conditio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0433","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-18T03:08:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5LOj3TDNAYJcq+83Qa1BJZIKMDwlWpPIZo5BLfSDSBmJkqaZEKX0UgdczoPExlW+jT6iJ2LoYGsi35ouo9D9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:01:58.554223Z"},"content_sha256":"8e17bc776b8032b19784c57c2daf3a7a6f600d6ed15ff8c2d1cf294f843257ba","schema_version":"1.0","event_id":"sha256:8e17bc776b8032b19784c57c2daf3a7a6f600d6ed15ff8c2d1cf294f843257ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFKDUMKBEU3MGF6AY7KZSUDMM7/bundle.json","state_url":"https://pith.science/pith/UFKDUMKBEU3MGF6AY7KZSUDMM7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFKDUMKBEU3MGF6AY7KZSUDMM7/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-26T06:01:58Z","links":{"resolver":"https://pith.science/pith/UFKDUMKBEU3MGF6AY7KZSUDMM7","bundle":"https://pith.science/pith/UFKDUMKBEU3MGF6AY7KZSUDMM7/bundle.json","state":"https://pith.science/pith/UFKDUMKBEU3MGF6AY7KZSUDMM7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFKDUMKBEU3MGF6AY7KZSUDMM7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UFKDUMKBEU3MGF6AY7KZSUDMM7","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":"8f6b6ddd60afd127a670dec6043f6b3ea56115bf7b388f9094f56fd766de1a39","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-03T07:27:55Z","title_canon_sha256":"13fda06c13cbd681369b06b2f6fe2793e5763400777a7e93c5d3f5187fcd4228"},"schema_version":"1.0","source":{"id":"1311.0433","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0433","created_at":"2026-05-18T03:08:05Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0433v1","created_at":"2026-05-18T03:08:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0433","created_at":"2026-05-18T03:08:05Z"},{"alias_kind":"pith_short_12","alias_value":"UFKDUMKBEU3M","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UFKDUMKBEU3MGF6A","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UFKDUMKB","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:8e17bc776b8032b19784c57c2daf3a7a6f600d6ed15ff8c2d1cf294f843257ba","target":"graph","created_at":"2026-05-18T03:08:05Z","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":"This paper presents an iterative geometric mean decomposition (IGMD) algorithm for multiple-input-multiple-output (MIMO) wireless communications. In contrast to the existing GMD algorithms, the proposed IGMD does not require the explicit computation of the geometric mean of positive singular values of the channel matrix and hence is more suitable for hardware implementation. The proposed IGMD has a regular structure and can be easily adapted to solve problems with different dimensions. We show that the proposed IGMD is guaranteed to converge to the perfect GMD under certain sufficient conditio","authors_text":"Chia-Hsiang Yang, Chiao-En Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-03T07:27:55Z","title":"An Iterative Geometric Mean Decomposition Algorithm for MIMO Communications Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0433","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:e1969204e5c94828661fd4c4629d53065c3588e7950711fe810f43a36d997c60","target":"record","created_at":"2026-05-18T03:08:05Z","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":"8f6b6ddd60afd127a670dec6043f6b3ea56115bf7b388f9094f56fd766de1a39","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-03T07:27:55Z","title_canon_sha256":"13fda06c13cbd681369b06b2f6fe2793e5763400777a7e93c5d3f5187fcd4228"},"schema_version":"1.0","source":{"id":"1311.0433","kind":"arxiv","version":1}},"canonical_sha256":"a1543a31412536c317c0c7d599506c67f19da4f03459833e8a88fdb110d73914","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1543a31412536c317c0c7d599506c67f19da4f03459833e8a88fdb110d73914","first_computed_at":"2026-05-18T03:08:05.960612Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:05.960612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NJOM/cWXWSWpcJ7dFef1MehVmyTHMPOw0su5CY9xEjI1OyH61OOM0/CZepXlDnEzyUiNnyY4ukyY1qjvV06eDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:05.961296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.0433","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1969204e5c94828661fd4c4629d53065c3588e7950711fe810f43a36d997c60","sha256:8e17bc776b8032b19784c57c2daf3a7a6f600d6ed15ff8c2d1cf294f843257ba"],"state_sha256":"048a2732fc4f8d9e95d0f403dad46811993538f090cc0cb6e008f10912bf2d00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AZqacXtESsyD7OrDmNTe80LcoCCWlwRZY7uGi6q5XzrRkuz5ZSbDN0FCibcH29mSi5R6dlIgKWbggdwJ2r4tBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:01:58.557539Z","bundle_sha256":"ab699a4eaf2700043181fe5d98dceb13158df2785c98a651af91da353e892c67"}}