{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:44SAXJKKEUFH4QBWKDC66OUQDQ","short_pith_number":"pith:44SAXJKK","canonical_record":{"source":{"id":"1508.01168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-04T02:16:11Z","cross_cats_sorted":["cs.NE","math.IT","math.OC"],"title_canon_sha256":"a49f0d67d53551bcba330215d2b2beb3cc3024eff9a7c304a8002708d4b1c712","abstract_canon_sha256":"f48ad0a324233a8ab58dfa87b86cde4e7621b7d5882c83778d3850a7ed0a4906"},"schema_version":"1.0"},"canonical_sha256":"e7240ba54a250a7e403650c5ef3a901c1906f5f0a4b7c531a9abbfa804671e96","source":{"kind":"arxiv","id":"1508.01168","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01168","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01168v1","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01168","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"pith_short_12","alias_value":"44SAXJKKEUFH","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"44SAXJKKEUFH4QBW","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"44SAXJKK","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:44SAXJKKEUFH4QBWKDC66OUQDQ","target":"record","payload":{"canonical_record":{"source":{"id":"1508.01168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-04T02:16:11Z","cross_cats_sorted":["cs.NE","math.IT","math.OC"],"title_canon_sha256":"a49f0d67d53551bcba330215d2b2beb3cc3024eff9a7c304a8002708d4b1c712","abstract_canon_sha256":"f48ad0a324233a8ab58dfa87b86cde4e7621b7d5882c83778d3850a7ed0a4906"},"schema_version":"1.0"},"canonical_sha256":"e7240ba54a250a7e403650c5ef3a901c1906f5f0a4b7c531a9abbfa804671e96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:43.933403Z","signature_b64":"rBOqJeYFB4ynksiCEd6wlIOLSLuPd39K6pLhMgQFKS3dd99kbOYUawq+7JmJVqOBvs6GfX47PIP5xHKaQ3xPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7240ba54a250a7e403650c5ef3a901c1906f5f0a4b7c531a9abbfa804671e96","last_reissued_at":"2026-05-18T01:35:43.932912Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:43.932912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.01168","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-18T01:35:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zr1PqaFC8q4JaN5A5R+cja5z7hFTqJvqObkuJTBoV3NXNRs+qd4RawiD8TT/FzN3C9npPKcr/xvFzZEcl4AKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:33:50.801415Z"},"content_sha256":"73186d69f237eb39ab1e626c0893a9efa97b76a4c88d79506afba2f97963741f","schema_version":"1.0","event_id":"sha256:73186d69f237eb39ab1e626c0893a9efa97b76a4c88d79506afba2f97963741f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:44SAXJKKEUFH4QBWKDC66OUQDQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Particle Swarm Optimization for Weighted Sum Rate Maximization in MIMO Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Ha Hoang Kha, Nguyen-Son Vo, Trung Q. Duong, Tung T. Vu","submitted_at":"2015-08-04T02:16:11Z","abstract_excerpt":"In this paper, we investigate the downlink multiple-input-multipleoutput (MIMO) broadcast channels in which a base transceiver station (BTS) broadcasts multiple data streams to K MIMO mobile stations (MSs) simultaneously. In order to maximize the weighted sum-rate (WSR) of the system subject to the transmitted power constraint, the design problem is to find the pre-coding matrices at BTS and the decoding matrices at MSs. However, such a design problem is typically a nonlinear and nonconvex optimization and, thus, it is quite hard to obtain the analytical solutions. To tackle with the mathemati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01168","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-18T01:35:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dj335O/bcG8a5HjESgf0HSif3pf75Gtt3h4hW1IuF0pfLG2vzyouxJm9erUdJvA8+VW/kDAIm4umpCj+OTccAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:33:50.801784Z"},"content_sha256":"a04e1bac110df9a605b448f6d06b0b890c5794e069ce258d8659d5e38ea46916","schema_version":"1.0","event_id":"sha256:a04e1bac110df9a605b448f6d06b0b890c5794e069ce258d8659d5e38ea46916"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/44SAXJKKEUFH4QBWKDC66OUQDQ/bundle.json","state_url":"https://pith.science/pith/44SAXJKKEUFH4QBWKDC66OUQDQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/44SAXJKKEUFH4QBWKDC66OUQDQ/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-27T08:33:50Z","links":{"resolver":"https://pith.science/pith/44SAXJKKEUFH4QBWKDC66OUQDQ","bundle":"https://pith.science/pith/44SAXJKKEUFH4QBWKDC66OUQDQ/bundle.json","state":"https://pith.science/pith/44SAXJKKEUFH4QBWKDC66OUQDQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/44SAXJKKEUFH4QBWKDC66OUQDQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:44SAXJKKEUFH4QBWKDC66OUQDQ","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":"f48ad0a324233a8ab58dfa87b86cde4e7621b7d5882c83778d3850a7ed0a4906","cross_cats_sorted":["cs.NE","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-04T02:16:11Z","title_canon_sha256":"a49f0d67d53551bcba330215d2b2beb3cc3024eff9a7c304a8002708d4b1c712"},"schema_version":"1.0","source":{"id":"1508.01168","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01168","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01168v1","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01168","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"pith_short_12","alias_value":"44SAXJKKEUFH","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"44SAXJKKEUFH4QBW","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"44SAXJKK","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:a04e1bac110df9a605b448f6d06b0b890c5794e069ce258d8659d5e38ea46916","target":"graph","created_at":"2026-05-18T01:35:43Z","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 paper, we investigate the downlink multiple-input-multipleoutput (MIMO) broadcast channels in which a base transceiver station (BTS) broadcasts multiple data streams to K MIMO mobile stations (MSs) simultaneously. In order to maximize the weighted sum-rate (WSR) of the system subject to the transmitted power constraint, the design problem is to find the pre-coding matrices at BTS and the decoding matrices at MSs. However, such a design problem is typically a nonlinear and nonconvex optimization and, thus, it is quite hard to obtain the analytical solutions. To tackle with the mathemati","authors_text":"Ha Hoang Kha, Nguyen-Son Vo, Trung Q. Duong, Tung T. Vu","cross_cats":["cs.NE","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-04T02:16:11Z","title":"Particle Swarm Optimization for Weighted Sum Rate Maximization in MIMO Broadcast Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01168","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:73186d69f237eb39ab1e626c0893a9efa97b76a4c88d79506afba2f97963741f","target":"record","created_at":"2026-05-18T01:35:43Z","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":"f48ad0a324233a8ab58dfa87b86cde4e7621b7d5882c83778d3850a7ed0a4906","cross_cats_sorted":["cs.NE","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-04T02:16:11Z","title_canon_sha256":"a49f0d67d53551bcba330215d2b2beb3cc3024eff9a7c304a8002708d4b1c712"},"schema_version":"1.0","source":{"id":"1508.01168","kind":"arxiv","version":1}},"canonical_sha256":"e7240ba54a250a7e403650c5ef3a901c1906f5f0a4b7c531a9abbfa804671e96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7240ba54a250a7e403650c5ef3a901c1906f5f0a4b7c531a9abbfa804671e96","first_computed_at":"2026-05-18T01:35:43.932912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:43.932912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rBOqJeYFB4ynksiCEd6wlIOLSLuPd39K6pLhMgQFKS3dd99kbOYUawq+7JmJVqOBvs6GfX47PIP5xHKaQ3xPDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:43.933403Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.01168","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73186d69f237eb39ab1e626c0893a9efa97b76a4c88d79506afba2f97963741f","sha256:a04e1bac110df9a605b448f6d06b0b890c5794e069ce258d8659d5e38ea46916"],"state_sha256":"3723a5b35cb69a131a529bc061dbacdf7dbcc6b1280a5d8850f208331bda76ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xD5FHfUwQLe25kbim+KO7HoHG706qLDG6h9HtIlIRGpTmRbDoCmF62VZzOMR3Qoi6YfV0mrmm6uOBa7tMBIvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:33:50.805003Z","bundle_sha256":"32c74886d8fe74d545b515679da71a311f49af0358aa4332aab5517c01766b93"}}