{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2JXE45QZPF3ZTTNYZJYA3DMIRW","short_pith_number":"pith:2JXE45QZ","schema_version":"1.0","canonical_sha256":"d26e4e7619797799cdb8ca700d8d888d98c203c91343718f3d89a8bf17ab5aff","source":{"kind":"arxiv","id":"1502.04488","version":2},"attestation_state":"computed","paper":{"title":"General Rank Multiuser Downlink Beamforming With Shaping Constraints Using Real-valued OSTBC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ka Lung Law, Marius Pesavento, Minh Thanh Vu, Xin Wen","submitted_at":"2015-02-16T10:41:53Z","abstract_excerpt":"In this paper we consider optimal multiuser downlink beamforming in the presence of a massive number of arbitrary quadratic shaping constraints. We combine beamforming with full-rate high dimensional real-valued orthogonal space time block coding (OSTBC) to increase the number of beamforming weight vectors and associated degrees of freedom in the beamformer design. The original multi-constraint beamforming problem is converted into a convex optimization problem using semidefinite relaxation (SDR) which can be solved efficiently. In contrast to conventional (rank-one) beamforming approaches in "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1502.04488","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-16T10:41:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"df052f5ff724971e1c3addc1806f2df10b3e6d41636dc2aa8546c96bd2577f77","abstract_canon_sha256":"8ca50a15fe7002a4f7876c3b0dfc2a88ac709137a68520ad62d8c434bda09d14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:03.249205Z","signature_b64":"Qm4/8h0h9Q/mcZrOQqahVq90eTxrybfljDKRbGB9eAcQZaFwlzNMaJEPFP6UAMGJ59B2Bi6w+/F8EgA4nZCjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d26e4e7619797799cdb8ca700d8d888d98c203c91343718f3d89a8bf17ab5aff","last_reissued_at":"2026-05-18T01:29:03.248673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:03.248673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"General Rank Multiuser Downlink Beamforming With Shaping Constraints Using Real-valued OSTBC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ka Lung Law, Marius Pesavento, Minh Thanh Vu, Xin Wen","submitted_at":"2015-02-16T10:41:53Z","abstract_excerpt":"In this paper we consider optimal multiuser downlink beamforming in the presence of a massive number of arbitrary quadratic shaping constraints. We combine beamforming with full-rate high dimensional real-valued orthogonal space time block coding (OSTBC) to increase the number of beamforming weight vectors and associated degrees of freedom in the beamformer design. The original multi-constraint beamforming problem is converted into a convex optimization problem using semidefinite relaxation (SDR) which can be solved efficiently. In contrast to conventional (rank-one) beamforming approaches in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04488","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.04488","created_at":"2026-05-18T01:29:03.248760+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.04488v2","created_at":"2026-05-18T01:29:03.248760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04488","created_at":"2026-05-18T01:29:03.248760+00:00"},{"alias_kind":"pith_short_12","alias_value":"2JXE45QZPF3Z","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2JXE45QZPF3ZTTNY","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2JXE45QZ","created_at":"2026-05-18T12:28:59.999130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2JXE45QZPF3ZTTNYZJYA3DMIRW","json":"https://pith.science/pith/2JXE45QZPF3ZTTNYZJYA3DMIRW.json","graph_json":"https://pith.science/api/pith-number/2JXE45QZPF3ZTTNYZJYA3DMIRW/graph.json","events_json":"https://pith.science/api/pith-number/2JXE45QZPF3ZTTNYZJYA3DMIRW/events.json","paper":"https://pith.science/paper/2JXE45QZ"},"agent_actions":{"view_html":"https://pith.science/pith/2JXE45QZPF3ZTTNYZJYA3DMIRW","download_json":"https://pith.science/pith/2JXE45QZPF3ZTTNYZJYA3DMIRW.json","view_paper":"https://pith.science/paper/2JXE45QZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.04488&json=true","fetch_graph":"https://pith.science/api/pith-number/2JXE45QZPF3ZTTNYZJYA3DMIRW/graph.json","fetch_events":"https://pith.science/api/pith-number/2JXE45QZPF3ZTTNYZJYA3DMIRW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2JXE45QZPF3ZTTNYZJYA3DMIRW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2JXE45QZPF3ZTTNYZJYA3DMIRW/action/storage_attestation","attest_author":"https://pith.science/pith/2JXE45QZPF3ZTTNYZJYA3DMIRW/action/author_attestation","sign_citation":"https://pith.science/pith/2JXE45QZPF3ZTTNYZJYA3DMIRW/action/citation_signature","submit_replication":"https://pith.science/pith/2JXE45QZPF3ZTTNYZJYA3DMIRW/action/replication_record"}},"created_at":"2026-05-18T01:29:03.248760+00:00","updated_at":"2026-05-18T01:29:03.248760+00:00"}