{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YJGPJXHMUMHWWIC2WBTM2LHDL5","short_pith_number":"pith:YJGPJXHM","canonical_record":{"source":{"id":"1309.4203","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-17T07:12:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"13a0b949a9426a5b0a4297a74b611249dbd99c2c09883d8523b091b910806d5b","abstract_canon_sha256":"cff5b8ae9cfe6e4892f832d677c6a53188099e13c47b127ebcb3fac6b1a47095"},"schema_version":"1.0"},"canonical_sha256":"c24cf4dceca30f6b205ab066cd2ce35f7f88b1a997f02d9758293a2510113981","source":{"kind":"arxiv","id":"1309.4203","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4203","created_at":"2026-05-18T01:47:36Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4203v1","created_at":"2026-05-18T01:47:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4203","created_at":"2026-05-18T01:47:36Z"},{"alias_kind":"pith_short_12","alias_value":"YJGPJXHMUMHW","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YJGPJXHMUMHWWIC2","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YJGPJXHM","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YJGPJXHMUMHWWIC2WBTM2LHDL5","target":"record","payload":{"canonical_record":{"source":{"id":"1309.4203","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-17T07:12:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"13a0b949a9426a5b0a4297a74b611249dbd99c2c09883d8523b091b910806d5b","abstract_canon_sha256":"cff5b8ae9cfe6e4892f832d677c6a53188099e13c47b127ebcb3fac6b1a47095"},"schema_version":"1.0"},"canonical_sha256":"c24cf4dceca30f6b205ab066cd2ce35f7f88b1a997f02d9758293a2510113981","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:47:36.828600Z","signature_b64":"/4kRI9qMkgIOPYPOrIORfi9JMAPGPkr0XmAi0H7k1vu4T+nYvsjgYN/l8WvnBCVovmfgX70ADzjgEePrr/PoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c24cf4dceca30f6b205ab066cd2ce35f7f88b1a997f02d9758293a2510113981","last_reissued_at":"2026-05-18T01:47:36.827925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:47:36.827925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.4203","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:47:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TPw8ta9FlyV442VQglVEPRJHBGTqTuag/zWkLrmBcnZh6+Djp68liQEYinsSoCMFt8S/oJU/96wJKUL2JKMZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:22:05.038668Z"},"content_sha256":"beeedc5a4ee8a6f7aef05308ec464f49e53ad727221951de9341a97450a2299c","schema_version":"1.0","event_id":"sha256:beeedc5a4ee8a6f7aef05308ec464f49e53ad727221951de9341a97450a2299c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YJGPJXHMUMHWWIC2WBTM2LHDL5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient algorithm for weighted sum-rate maximization in multicell downlink beamforming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hidekazu Murata, Mirza Golam Kibria","submitted_at":"2013-09-17T07:12:43Z","abstract_excerpt":"This paper considers coordinated linear precoding for rate optimization in downlink multicell, multiuser orthogonal frequency- division multiple access networks. We focus on two different design criteria. In the first, the weighted sum-rate is maximized under transmit power constraints per base station. In the second, we minimize the total transmit power satisfying the signal-to-interference-plus-noise-ratio constraints of the subcarriers per cell. Both problems are solved using standard conic optimization packages. A less complex, fast, and provably convergent algorithm that maximizes the wei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4203","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:47:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hcg9ayg8wzRNRnInNgPp5QLT6ZZHYnF54eMZmtpDdgnfW8I6hYdfwrmv/4CbrbUzaPqP9JWAebQGFammozwGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:22:05.039410Z"},"content_sha256":"1cc89082513989806758dd37ea180494fa5c84f733562ae45bf449a81a1e6de9","schema_version":"1.0","event_id":"sha256:1cc89082513989806758dd37ea180494fa5c84f733562ae45bf449a81a1e6de9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YJGPJXHMUMHWWIC2WBTM2LHDL5/bundle.json","state_url":"https://pith.science/pith/YJGPJXHMUMHWWIC2WBTM2LHDL5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YJGPJXHMUMHWWIC2WBTM2LHDL5/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-30T02:22:05Z","links":{"resolver":"https://pith.science/pith/YJGPJXHMUMHWWIC2WBTM2LHDL5","bundle":"https://pith.science/pith/YJGPJXHMUMHWWIC2WBTM2LHDL5/bundle.json","state":"https://pith.science/pith/YJGPJXHMUMHWWIC2WBTM2LHDL5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YJGPJXHMUMHWWIC2WBTM2LHDL5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YJGPJXHMUMHWWIC2WBTM2LHDL5","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":"cff5b8ae9cfe6e4892f832d677c6a53188099e13c47b127ebcb3fac6b1a47095","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-17T07:12:43Z","title_canon_sha256":"13a0b949a9426a5b0a4297a74b611249dbd99c2c09883d8523b091b910806d5b"},"schema_version":"1.0","source":{"id":"1309.4203","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4203","created_at":"2026-05-18T01:47:36Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4203v1","created_at":"2026-05-18T01:47:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4203","created_at":"2026-05-18T01:47:36Z"},{"alias_kind":"pith_short_12","alias_value":"YJGPJXHMUMHW","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YJGPJXHMUMHWWIC2","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YJGPJXHM","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:1cc89082513989806758dd37ea180494fa5c84f733562ae45bf449a81a1e6de9","target":"graph","created_at":"2026-05-18T01:47:36Z","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 considers coordinated linear precoding for rate optimization in downlink multicell, multiuser orthogonal frequency- division multiple access networks. We focus on two different design criteria. In the first, the weighted sum-rate is maximized under transmit power constraints per base station. In the second, we minimize the total transmit power satisfying the signal-to-interference-plus-noise-ratio constraints of the subcarriers per cell. Both problems are solved using standard conic optimization packages. A less complex, fast, and provably convergent algorithm that maximizes the wei","authors_text":"Hidekazu Murata, Mirza Golam Kibria","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-17T07:12:43Z","title":"An efficient algorithm for weighted sum-rate maximization in multicell downlink beamforming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4203","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:beeedc5a4ee8a6f7aef05308ec464f49e53ad727221951de9341a97450a2299c","target":"record","created_at":"2026-05-18T01:47:36Z","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":"cff5b8ae9cfe6e4892f832d677c6a53188099e13c47b127ebcb3fac6b1a47095","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-17T07:12:43Z","title_canon_sha256":"13a0b949a9426a5b0a4297a74b611249dbd99c2c09883d8523b091b910806d5b"},"schema_version":"1.0","source":{"id":"1309.4203","kind":"arxiv","version":1}},"canonical_sha256":"c24cf4dceca30f6b205ab066cd2ce35f7f88b1a997f02d9758293a2510113981","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c24cf4dceca30f6b205ab066cd2ce35f7f88b1a997f02d9758293a2510113981","first_computed_at":"2026-05-18T01:47:36.827925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:47:36.827925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/4kRI9qMkgIOPYPOrIORfi9JMAPGPkr0XmAi0H7k1vu4T+nYvsjgYN/l8WvnBCVovmfgX70ADzjgEePrr/PoAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:47:36.828600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.4203","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:beeedc5a4ee8a6f7aef05308ec464f49e53ad727221951de9341a97450a2299c","sha256:1cc89082513989806758dd37ea180494fa5c84f733562ae45bf449a81a1e6de9"],"state_sha256":"3ca04f4707a5f96777f435aada14c9bff0aff9306c314267c20c9228aa6f2d85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uDAZBqCFc9zA8iLA9Q7IGlctKQzFiMzZERL1+a2Tczv2jeZ9IBvXu22C+iB5dKhk0ZpPji26LTXUUv+rr4EdDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:22:05.043230Z","bundle_sha256":"3c9cf2269e9b29db25247d0134664e595e8adce59b6e1548e646625a0b072b92"}}