{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2JXE45QZPF3ZTTNYZJYA3DMIRW","short_pith_number":"pith:2JXE45QZ","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"},"canonical_sha256":"d26e4e7619797799cdb8ca700d8d888d98c203c91343718f3d89a8bf17ab5aff","source":{"kind":"arxiv","id":"1502.04488","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04488","created_at":"2026-05-18T01:29:03Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04488v2","created_at":"2026-05-18T01:29:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04488","created_at":"2026-05-18T01:29:03Z"},{"alias_kind":"pith_short_12","alias_value":"2JXE45QZPF3Z","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2JXE45QZPF3ZTTNY","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2JXE45QZ","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2JXE45QZPF3ZTTNYZJYA3DMIRW","target":"record","payload":{"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"},"canonical_sha256":"d26e4e7619797799cdb8ca700d8d888d98c203c91343718f3d89a8bf17ab5aff","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"},"source_kind":"arxiv","source_id":"1502.04488","source_version":2,"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:29:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t7TuZqWHa2v1giikU3fVvtjg2gTABrQMgI/z+Z4VZvU0kFczgMRJK+TTC+HqjSHPmA7f423PLeseshe0jg7RCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:03:57.447078Z"},"content_sha256":"5cdad5e3ce7a284dbe88de1071b53e7e8ce672f57a18a657fe1b48872a336e06","schema_version":"1.0","event_id":"sha256:5cdad5e3ce7a284dbe88de1071b53e7e8ce672f57a18a657fe1b48872a336e06"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2JXE45QZPF3ZTTNYZJYA3DMIRW","target":"graph","payload":{"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"},"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:29:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3PmPkKnpb0qYn2dcW9uqGlx8Dxw4RX3tyBnR4s04uD+NRChfe9/zveruLwyRNZCxarFDTmzPrEIJxowIPeuTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:03:57.447445Z"},"content_sha256":"85138a98582f2519034c8617b2e4950e012a3d5da3f0c8c2dab09b29d45a2d89","schema_version":"1.0","event_id":"sha256:85138a98582f2519034c8617b2e4950e012a3d5da3f0c8c2dab09b29d45a2d89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2JXE45QZPF3ZTTNYZJYA3DMIRW/bundle.json","state_url":"https://pith.science/pith/2JXE45QZPF3ZTTNYZJYA3DMIRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2JXE45QZPF3ZTTNYZJYA3DMIRW/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-04T19:03:57Z","links":{"resolver":"https://pith.science/pith/2JXE45QZPF3ZTTNYZJYA3DMIRW","bundle":"https://pith.science/pith/2JXE45QZPF3ZTTNYZJYA3DMIRW/bundle.json","state":"https://pith.science/pith/2JXE45QZPF3ZTTNYZJYA3DMIRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2JXE45QZPF3ZTTNYZJYA3DMIRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2JXE45QZPF3ZTTNYZJYA3DMIRW","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":"8ca50a15fe7002a4f7876c3b0dfc2a88ac709137a68520ad62d8c434bda09d14","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-16T10:41:53Z","title_canon_sha256":"df052f5ff724971e1c3addc1806f2df10b3e6d41636dc2aa8546c96bd2577f77"},"schema_version":"1.0","source":{"id":"1502.04488","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04488","created_at":"2026-05-18T01:29:03Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04488v2","created_at":"2026-05-18T01:29:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04488","created_at":"2026-05-18T01:29:03Z"},{"alias_kind":"pith_short_12","alias_value":"2JXE45QZPF3Z","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2JXE45QZPF3ZTTNY","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2JXE45QZ","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:85138a98582f2519034c8617b2e4950e012a3d5da3f0c8c2dab09b29d45a2d89","target":"graph","created_at":"2026-05-18T01:29:03Z","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 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 ","authors_text":"Ka Lung Law, Marius Pesavento, Minh Thanh Vu, Xin Wen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-16T10:41:53Z","title":"General Rank Multiuser Downlink Beamforming With Shaping Constraints Using Real-valued OSTBC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04488","kind":"arxiv","version":2},"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:5cdad5e3ce7a284dbe88de1071b53e7e8ce672f57a18a657fe1b48872a336e06","target":"record","created_at":"2026-05-18T01:29:03Z","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":"8ca50a15fe7002a4f7876c3b0dfc2a88ac709137a68520ad62d8c434bda09d14","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-16T10:41:53Z","title_canon_sha256":"df052f5ff724971e1c3addc1806f2df10b3e6d41636dc2aa8546c96bd2577f77"},"schema_version":"1.0","source":{"id":"1502.04488","kind":"arxiv","version":2}},"canonical_sha256":"d26e4e7619797799cdb8ca700d8d888d98c203c91343718f3d89a8bf17ab5aff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d26e4e7619797799cdb8ca700d8d888d98c203c91343718f3d89a8bf17ab5aff","first_computed_at":"2026-05-18T01:29:03.248673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:03.248673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qm4/8h0h9Q/mcZrOQqahVq90eTxrybfljDKRbGB9eAcQZaFwlzNMaJEPFP6UAMGJ59B2Bi6w+/F8EgA4nZCjCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:03.249205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04488","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cdad5e3ce7a284dbe88de1071b53e7e8ce672f57a18a657fe1b48872a336e06","sha256:85138a98582f2519034c8617b2e4950e012a3d5da3f0c8c2dab09b29d45a2d89"],"state_sha256":"018fd89d50aa66c57bd05916ad331ed9a854f0052b4bc050a30fb3b150b3593b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wS2r63KK2jJ6GKVHGQt94PaDb9mLe4by7gPsem6XCPO6QNqv1nVfMRrfHTNJsX+a7ATLrHBWxHVLrfVwaFhbBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:03:57.449482Z","bundle_sha256":"119dccf871c9c3388afe12cb2c7f4cb465c0800673bc025e0762ea5c4371873f"}}