{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:645GM3L4TO7EDCO2U64WZPSXJN","short_pith_number":"pith:645GM3L4","canonical_record":{"source":{"id":"1109.6269","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-28T16:54:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6de04e232828e7e454fab21182a037937904cf3b8922fa7f26c85b3f9270a124","abstract_canon_sha256":"0f514d7a80bd113c155070330cdabdb5458547af1135b1d3310c6e1ffe9cf7ce"},"schema_version":"1.0"},"canonical_sha256":"f73a666d7c9bbe4189daa7b96cbe574b604bcf2ba9761d051100f2e7ce8fb310","source":{"kind":"arxiv","id":"1109.6269","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6269","created_at":"2026-05-18T02:00:21Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6269v2","created_at":"2026-05-18T02:00:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6269","created_at":"2026-05-18T02:00:21Z"},{"alias_kind":"pith_short_12","alias_value":"645GM3L4TO7E","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"645GM3L4TO7EDCO2","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"645GM3L4","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:645GM3L4TO7EDCO2U64WZPSXJN","target":"record","payload":{"canonical_record":{"source":{"id":"1109.6269","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-28T16:54:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6de04e232828e7e454fab21182a037937904cf3b8922fa7f26c85b3f9270a124","abstract_canon_sha256":"0f514d7a80bd113c155070330cdabdb5458547af1135b1d3310c6e1ffe9cf7ce"},"schema_version":"1.0"},"canonical_sha256":"f73a666d7c9bbe4189daa7b96cbe574b604bcf2ba9761d051100f2e7ce8fb310","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:21.990323Z","signature_b64":"H1CpFVH4bePeeXT0Wf5zp/0EIHd+ww2V7Y9MxepQQXuv3ww1GUaWVMJreQFbUKzbO3MZq3iq1aSP4lFB7j63DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f73a666d7c9bbe4189daa7b96cbe574b604bcf2ba9761d051100f2e7ce8fb310","last_reissued_at":"2026-05-18T02:00:21.989903Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:21.989903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.6269","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-18T02:00:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rab3lgE3RVLBUR/aNRVYga1rlglsdSwy2ZcJfVSLJ6zrH4OsPgX7bMZWVEqR8P7RJkKbNrA/rX9+3Vx81CRRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:40:13.326283Z"},"content_sha256":"f7031741fb520f714fe42c787e98c6756115948323478bf3f4d281e862c60519","schema_version":"1.0","event_id":"sha256:f7031741fb520f714fe42c787e98c6756115948323478bf3f4d281e862c60519"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:645GM3L4TO7EDCO2U64WZPSXJN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Precoder Design for Physical Layer Multicasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hao Zhu, Narayan Prasad, Sampath Rangarajan","submitted_at":"2011-09-28T16:54:18Z","abstract_excerpt":"This paper studies the instantaneous rate maximization and the weighted sum delay minimization problems over a K-user multicast channel, where multiple antennas are available at the transmitter as well as at all the receivers. Motivated by the degree of freedom optimality and the simplicity offered by linear precoding schemes, we consider the design of linear precoders using the aforementioned two criteria. We first consider the scenario wherein the linear precoder can be any complex-valued matrix subject to rank and power constraints. We propose cyclic alternating ascent based precoder design"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6269","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-18T02:00:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y1HQXv2QMtt5F970wPRJ1ioUc+BrdDf2fmG/sqnQL3Ocwb8sElLOUsFenaSBAwAzsO0mGfcLHic/23XbSHfyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:40:13.327005Z"},"content_sha256":"8aa444db54398965967d7274b199ec9c99a489433d2eda410b3f7e678b00fea1","schema_version":"1.0","event_id":"sha256:8aa444db54398965967d7274b199ec9c99a489433d2eda410b3f7e678b00fea1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/645GM3L4TO7EDCO2U64WZPSXJN/bundle.json","state_url":"https://pith.science/pith/645GM3L4TO7EDCO2U64WZPSXJN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/645GM3L4TO7EDCO2U64WZPSXJN/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-26T11:40:13Z","links":{"resolver":"https://pith.science/pith/645GM3L4TO7EDCO2U64WZPSXJN","bundle":"https://pith.science/pith/645GM3L4TO7EDCO2U64WZPSXJN/bundle.json","state":"https://pith.science/pith/645GM3L4TO7EDCO2U64WZPSXJN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/645GM3L4TO7EDCO2U64WZPSXJN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:645GM3L4TO7EDCO2U64WZPSXJN","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":"0f514d7a80bd113c155070330cdabdb5458547af1135b1d3310c6e1ffe9cf7ce","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-28T16:54:18Z","title_canon_sha256":"6de04e232828e7e454fab21182a037937904cf3b8922fa7f26c85b3f9270a124"},"schema_version":"1.0","source":{"id":"1109.6269","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6269","created_at":"2026-05-18T02:00:21Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6269v2","created_at":"2026-05-18T02:00:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6269","created_at":"2026-05-18T02:00:21Z"},{"alias_kind":"pith_short_12","alias_value":"645GM3L4TO7E","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"645GM3L4TO7EDCO2","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"645GM3L4","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:8aa444db54398965967d7274b199ec9c99a489433d2eda410b3f7e678b00fea1","target":"graph","created_at":"2026-05-18T02:00:21Z","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 studies the instantaneous rate maximization and the weighted sum delay minimization problems over a K-user multicast channel, where multiple antennas are available at the transmitter as well as at all the receivers. Motivated by the degree of freedom optimality and the simplicity offered by linear precoding schemes, we consider the design of linear precoders using the aforementioned two criteria. We first consider the scenario wherein the linear precoder can be any complex-valued matrix subject to rank and power constraints. We propose cyclic alternating ascent based precoder design","authors_text":"Hao Zhu, Narayan Prasad, Sampath Rangarajan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-28T16:54:18Z","title":"Precoder Design for Physical Layer Multicasting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6269","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:f7031741fb520f714fe42c787e98c6756115948323478bf3f4d281e862c60519","target":"record","created_at":"2026-05-18T02:00:21Z","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":"0f514d7a80bd113c155070330cdabdb5458547af1135b1d3310c6e1ffe9cf7ce","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-28T16:54:18Z","title_canon_sha256":"6de04e232828e7e454fab21182a037937904cf3b8922fa7f26c85b3f9270a124"},"schema_version":"1.0","source":{"id":"1109.6269","kind":"arxiv","version":2}},"canonical_sha256":"f73a666d7c9bbe4189daa7b96cbe574b604bcf2ba9761d051100f2e7ce8fb310","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f73a666d7c9bbe4189daa7b96cbe574b604bcf2ba9761d051100f2e7ce8fb310","first_computed_at":"2026-05-18T02:00:21.989903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:00:21.989903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H1CpFVH4bePeeXT0Wf5zp/0EIHd+ww2V7Y9MxepQQXuv3ww1GUaWVMJreQFbUKzbO3MZq3iq1aSP4lFB7j63DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:00:21.990323Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.6269","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7031741fb520f714fe42c787e98c6756115948323478bf3f4d281e862c60519","sha256:8aa444db54398965967d7274b199ec9c99a489433d2eda410b3f7e678b00fea1"],"state_sha256":"27386804fd04ea4d3edadfdaf12ca3b1f1f1bafa0c272798635374f504e8aec0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sF/ztZYtW+lR9RQVDJi+V8KgFTcXJ+13alpU4ifJRTZfhK3q0ddXnLIMaoYyIR3g2rDVSEyye4SuvCyFBeZEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:40:13.330492Z","bundle_sha256":"6459f1f7d25b328a0dfd730575fa5a7e0658b92d1c92f23d868034994048f3f4"}}