{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FBHR674LY6BDJYHBPW6MLG7J7E","short_pith_number":"pith:FBHR674L","canonical_record":{"source":{"id":"1302.5975","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-25T01:57:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0eb7239e23371b76bc8d57bfb6ad73dd5dd2296f143d931ca03bd127ab5096b4","abstract_canon_sha256":"008846294331158c52d16bdc60d47f5af9408356ad8dd726f71e917161413b12"},"schema_version":"1.0"},"canonical_sha256":"284f1f7f8bc78234e0e17dbcc59be9f920ddf0a21635ce49d6b815ea2f0e85c8","source":{"kind":"arxiv","id":"1302.5975","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5975","created_at":"2026-05-18T03:32:33Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5975v1","created_at":"2026-05-18T03:32:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5975","created_at":"2026-05-18T03:32:33Z"},{"alias_kind":"pith_short_12","alias_value":"FBHR674LY6BD","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FBHR674LY6BDJYHB","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FBHR674L","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FBHR674LY6BDJYHBPW6MLG7J7E","target":"record","payload":{"canonical_record":{"source":{"id":"1302.5975","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-25T01:57:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0eb7239e23371b76bc8d57bfb6ad73dd5dd2296f143d931ca03bd127ab5096b4","abstract_canon_sha256":"008846294331158c52d16bdc60d47f5af9408356ad8dd726f71e917161413b12"},"schema_version":"1.0"},"canonical_sha256":"284f1f7f8bc78234e0e17dbcc59be9f920ddf0a21635ce49d6b815ea2f0e85c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:33.008132Z","signature_b64":"Bsc2PhwRI0CbiFd7fTJOEUopHJa5g57MvRDjsUBQBiNbVZKO2iBJwSz/S8cw59R8vLVI/+dSh+oOVj564rxyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"284f1f7f8bc78234e0e17dbcc59be9f920ddf0a21635ce49d6b815ea2f0e85c8","last_reissued_at":"2026-05-18T03:32:33.007430Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:33.007430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.5975","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:32:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a1sOWOKhLpciW3IwGUN20t6AeqWodR4FEIIlaHY+hleE6ZFzO/RUVdHNqT7VokGTdukoiaUPOgK0oDhx9lbaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:25:58.506478Z"},"content_sha256":"ff468438fa4f1bf608cf0762dfbdd37ef27a34cbb69ccd2d3c017c58879e1674","schema_version":"1.0","event_id":"sha256:ff468438fa4f1bf608cf0762dfbdd37ef27a34cbb69ccd2d3c017c58879e1674"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FBHR674LY6BDJYHBPW6MLG7J7E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Complexity Algorithm for Worst-Case Utility Maximization in Multiuser MISO Downlink","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chong-Yung Chi, Haining Wang, Kun-Yu Wang, Zhi Ding","submitted_at":"2013-02-25T01:57:53Z","abstract_excerpt":"This work considers worst-case utility maximization (WCUM) problem for a downlink wireless system where a multiantenna base station communicates with multiple single-antenna users. Specifically, we jointly design transmit covariance matrices for each user to robustly maximize the worst-case (i.e., minimum) system utility function under channel estimation errors bounded within a spherical region. This problem has been shown to be NP-hard, and so any algorithms for finding the optimal solution may suffer from prohibitively high complexity. In view of this, we seek an efficient and more accurate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5975","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:32:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WSRj7ezWaVj9TUs4IsgH1X4VmWEdOSar0PDGTvy68Mnp6Ocvsa71lWWqTdGO9SfO6qYXcqDlcCjpUZOKYW7OBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:25:58.506818Z"},"content_sha256":"3be9c34de7af4f03fc20a98a59785c758606bb88d7f5a63b30c496dabdb4801a","schema_version":"1.0","event_id":"sha256:3be9c34de7af4f03fc20a98a59785c758606bb88d7f5a63b30c496dabdb4801a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FBHR674LY6BDJYHBPW6MLG7J7E/bundle.json","state_url":"https://pith.science/pith/FBHR674LY6BDJYHBPW6MLG7J7E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FBHR674LY6BDJYHBPW6MLG7J7E/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-03T11:25:58Z","links":{"resolver":"https://pith.science/pith/FBHR674LY6BDJYHBPW6MLG7J7E","bundle":"https://pith.science/pith/FBHR674LY6BDJYHBPW6MLG7J7E/bundle.json","state":"https://pith.science/pith/FBHR674LY6BDJYHBPW6MLG7J7E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FBHR674LY6BDJYHBPW6MLG7J7E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FBHR674LY6BDJYHBPW6MLG7J7E","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":"008846294331158c52d16bdc60d47f5af9408356ad8dd726f71e917161413b12","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-25T01:57:53Z","title_canon_sha256":"0eb7239e23371b76bc8d57bfb6ad73dd5dd2296f143d931ca03bd127ab5096b4"},"schema_version":"1.0","source":{"id":"1302.5975","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5975","created_at":"2026-05-18T03:32:33Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5975v1","created_at":"2026-05-18T03:32:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5975","created_at":"2026-05-18T03:32:33Z"},{"alias_kind":"pith_short_12","alias_value":"FBHR674LY6BD","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FBHR674LY6BDJYHB","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FBHR674L","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:3be9c34de7af4f03fc20a98a59785c758606bb88d7f5a63b30c496dabdb4801a","target":"graph","created_at":"2026-05-18T03:32:33Z","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 work considers worst-case utility maximization (WCUM) problem for a downlink wireless system where a multiantenna base station communicates with multiple single-antenna users. Specifically, we jointly design transmit covariance matrices for each user to robustly maximize the worst-case (i.e., minimum) system utility function under channel estimation errors bounded within a spherical region. This problem has been shown to be NP-hard, and so any algorithms for finding the optimal solution may suffer from prohibitively high complexity. In view of this, we seek an efficient and more accurate ","authors_text":"Chong-Yung Chi, Haining Wang, Kun-Yu Wang, Zhi Ding","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-25T01:57:53Z","title":"Low-Complexity Algorithm for Worst-Case Utility Maximization in Multiuser MISO Downlink"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5975","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:ff468438fa4f1bf608cf0762dfbdd37ef27a34cbb69ccd2d3c017c58879e1674","target":"record","created_at":"2026-05-18T03:32:33Z","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":"008846294331158c52d16bdc60d47f5af9408356ad8dd726f71e917161413b12","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-25T01:57:53Z","title_canon_sha256":"0eb7239e23371b76bc8d57bfb6ad73dd5dd2296f143d931ca03bd127ab5096b4"},"schema_version":"1.0","source":{"id":"1302.5975","kind":"arxiv","version":1}},"canonical_sha256":"284f1f7f8bc78234e0e17dbcc59be9f920ddf0a21635ce49d6b815ea2f0e85c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"284f1f7f8bc78234e0e17dbcc59be9f920ddf0a21635ce49d6b815ea2f0e85c8","first_computed_at":"2026-05-18T03:32:33.007430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:33.007430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bsc2PhwRI0CbiFd7fTJOEUopHJa5g57MvRDjsUBQBiNbVZKO2iBJwSz/S8cw59R8vLVI/+dSh+oOVj564rxyCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:33.008132Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.5975","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff468438fa4f1bf608cf0762dfbdd37ef27a34cbb69ccd2d3c017c58879e1674","sha256:3be9c34de7af4f03fc20a98a59785c758606bb88d7f5a63b30c496dabdb4801a"],"state_sha256":"1d41275467c77a45c0318e8da352be365833ea42771eda9b7f3c01a6681bc8a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uzV2bPV1p2VGQrrbXo12H4mVQthNo9zwzFuiVPb5Z6NHYXhzGaKcSJ6iCTXqLFC2/g2dQuAozSrWZyYFLwkxAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T11:25:58.508801Z","bundle_sha256":"6178e45fb49293afedc768144c965ab55d7e38d4e57d27ed7608b954d14797e4"}}