{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DXQZJKGPCJLG5LM3YIOTI5O4KC","short_pith_number":"pith:DXQZJKGP","canonical_record":{"source":{"id":"1309.4034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-16T16:50:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f6dd1c5f34b7cb0c888efc2984bef250a53b8500623d8f69d7f3be3d4af558d1","abstract_canon_sha256":"ed05ce8d51dd433439785bf2212369503d3db3479dec1beee354d38f53ad2334"},"schema_version":"1.0"},"canonical_sha256":"1de194a8cf12566ead9bc21d3475dc5083c8d7c2da59b8d06c9dd5a89b018371","source":{"kind":"arxiv","id":"1309.4034","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4034","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4034v1","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4034","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"pith_short_12","alias_value":"DXQZJKGPCJLG","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DXQZJKGPCJLG5LM3","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DXQZJKGP","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DXQZJKGPCJLG5LM3YIOTI5O4KC","target":"record","payload":{"canonical_record":{"source":{"id":"1309.4034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-16T16:50:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f6dd1c5f34b7cb0c888efc2984bef250a53b8500623d8f69d7f3be3d4af558d1","abstract_canon_sha256":"ed05ce8d51dd433439785bf2212369503d3db3479dec1beee354d38f53ad2334"},"schema_version":"1.0"},"canonical_sha256":"1de194a8cf12566ead9bc21d3475dc5083c8d7c2da59b8d06c9dd5a89b018371","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:11.440405Z","signature_b64":"onRvcHEzIWKjhfwXMZ7iME/GrNYp9djY20VNB3IkZ9h97J9yn72mlFbwc1/X7GXMXldmUpSbecbecKwVhp1MAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1de194a8cf12566ead9bc21d3475dc5083c8d7c2da59b8d06c9dd5a89b018371","last_reissued_at":"2026-05-18T03:13:11.439704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:11.439704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.4034","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-18T03:13:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V5zgjnyYLqa04b4T32K81ajyx9cjmlrW1GKM1YW/XaOqitzjmbdZlDSUsyd1zvoH1XefONIFDc/0scuRXC7OBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:58:50.918039Z"},"content_sha256":"0b8f9dc11ffd8bcfd5e422018d79dbab91c832fb964b6607fea08f7f5da039be","schema_version":"1.0","event_id":"sha256:0b8f9dc11ffd8bcfd5e422018d79dbab91c832fb964b6607fea08f7f5da039be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DXQZJKGPCJLG5LM3YIOTI5O4KC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Weighted Sum Rate Maximization in MIMO Interference Networks: The Minimax Lagrangian Duality and Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lijun Chen, Seungil You","submitted_at":"2013-09-16T16:50:15Z","abstract_excerpt":"We take a new perspective on the weighted sum-rate maximization in multiple-input multiple-output (MIMO) interference networks, by formulating an equivalent max-min problem. This seemingly trivial reformulation has significant implications: the Lagrangian duality of the equivalent max-min problem provides an elegant way to establish the sum-rate duality between an interference network and its reciprocal when such a duality exists, and more importantly, suggests a novel iterative minimax algorithm for the weighted sum-rate maximization. Moreover, the design and convergence proof of the algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4034","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-18T03:13:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+pCHfzTzjdbEJb1OGkFgwFlbJQypmHDU5dry673rLEqEWW+xWf8v/LY10faMe68RToTpKCPMvpWNRn6UUJSsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:58:50.918441Z"},"content_sha256":"8bd3cd7b4d22f08957a63a5c124efa2ceff2c922063a589a817d0c39d595c5f9","schema_version":"1.0","event_id":"sha256:8bd3cd7b4d22f08957a63a5c124efa2ceff2c922063a589a817d0c39d595c5f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXQZJKGPCJLG5LM3YIOTI5O4KC/bundle.json","state_url":"https://pith.science/pith/DXQZJKGPCJLG5LM3YIOTI5O4KC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXQZJKGPCJLG5LM3YIOTI5O4KC/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:58:50Z","links":{"resolver":"https://pith.science/pith/DXQZJKGPCJLG5LM3YIOTI5O4KC","bundle":"https://pith.science/pith/DXQZJKGPCJLG5LM3YIOTI5O4KC/bundle.json","state":"https://pith.science/pith/DXQZJKGPCJLG5LM3YIOTI5O4KC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXQZJKGPCJLG5LM3YIOTI5O4KC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DXQZJKGPCJLG5LM3YIOTI5O4KC","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":"ed05ce8d51dd433439785bf2212369503d3db3479dec1beee354d38f53ad2334","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-16T16:50:15Z","title_canon_sha256":"f6dd1c5f34b7cb0c888efc2984bef250a53b8500623d8f69d7f3be3d4af558d1"},"schema_version":"1.0","source":{"id":"1309.4034","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4034","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4034v1","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4034","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"pith_short_12","alias_value":"DXQZJKGPCJLG","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DXQZJKGPCJLG5LM3","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DXQZJKGP","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:8bd3cd7b4d22f08957a63a5c124efa2ceff2c922063a589a817d0c39d595c5f9","target":"graph","created_at":"2026-05-18T03:13:11Z","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":"We take a new perspective on the weighted sum-rate maximization in multiple-input multiple-output (MIMO) interference networks, by formulating an equivalent max-min problem. This seemingly trivial reformulation has significant implications: the Lagrangian duality of the equivalent max-min problem provides an elegant way to establish the sum-rate duality between an interference network and its reciprocal when such a duality exists, and more importantly, suggests a novel iterative minimax algorithm for the weighted sum-rate maximization. Moreover, the design and convergence proof of the algorith","authors_text":"Lijun Chen, Seungil You","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-16T16:50:15Z","title":"The Weighted Sum Rate Maximization in MIMO Interference Networks: The Minimax Lagrangian Duality and Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4034","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:0b8f9dc11ffd8bcfd5e422018d79dbab91c832fb964b6607fea08f7f5da039be","target":"record","created_at":"2026-05-18T03:13:11Z","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":"ed05ce8d51dd433439785bf2212369503d3db3479dec1beee354d38f53ad2334","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-16T16:50:15Z","title_canon_sha256":"f6dd1c5f34b7cb0c888efc2984bef250a53b8500623d8f69d7f3be3d4af558d1"},"schema_version":"1.0","source":{"id":"1309.4034","kind":"arxiv","version":1}},"canonical_sha256":"1de194a8cf12566ead9bc21d3475dc5083c8d7c2da59b8d06c9dd5a89b018371","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1de194a8cf12566ead9bc21d3475dc5083c8d7c2da59b8d06c9dd5a89b018371","first_computed_at":"2026-05-18T03:13:11.439704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:11.439704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"onRvcHEzIWKjhfwXMZ7iME/GrNYp9djY20VNB3IkZ9h97J9yn72mlFbwc1/X7GXMXldmUpSbecbecKwVhp1MAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:11.440405Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.4034","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b8f9dc11ffd8bcfd5e422018d79dbab91c832fb964b6607fea08f7f5da039be","sha256:8bd3cd7b4d22f08957a63a5c124efa2ceff2c922063a589a817d0c39d595c5f9"],"state_sha256":"8470a0e4173f6bfa28c28413eb3defb8ceb1627cfb3355a8935d74f841531d21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4WZEJaDVnMoupwGUIByoq1z92hkB7/2jWJKJUt+waAlLs87xWOlM5Qqt1GsWs2AexvbOKk15SPAkxgtDLpQJBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:58:50.920516Z","bundle_sha256":"1a6c5ed450c0b55053fc2f7f66da795ce2ca579b873c6ef2d4f1875108766465"}}