{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DEJKUNNRCY6OQOXLQUEUCTQKR3","short_pith_number":"pith:DEJKUNNR","canonical_record":{"source":{"id":"1506.03352","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-10T15:11:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"907e6be0f3482dd3a88d31251d48ec12c9770dd4620ed126761dce0167bca571","abstract_canon_sha256":"07e5ee3bd6bc22e6422b43165bfebdd61a8e49f0c46720a28ef10c8845f680f1"},"schema_version":"1.0"},"canonical_sha256":"1912aa35b1163ce83aeb8509414e0a8ee408307f32b107a6b8c4a26029152b20","source":{"kind":"arxiv","id":"1506.03352","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03352","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03352v2","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03352","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"DEJKUNNRCY6O","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DEJKUNNRCY6OQOXL","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DEJKUNNR","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DEJKUNNRCY6OQOXLQUEUCTQKR3","target":"record","payload":{"canonical_record":{"source":{"id":"1506.03352","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-10T15:11:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"907e6be0f3482dd3a88d31251d48ec12c9770dd4620ed126761dce0167bca571","abstract_canon_sha256":"07e5ee3bd6bc22e6422b43165bfebdd61a8e49f0c46720a28ef10c8845f680f1"},"schema_version":"1.0"},"canonical_sha256":"1912aa35b1163ce83aeb8509414e0a8ee408307f32b107a6b8c4a26029152b20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:18.596385Z","signature_b64":"7H32i7IMLbhNtd5jWlCb8+L97VUSbxsj/YjwxK7fGl2lpV/tI+pONFSQFAw6/sMqfstg7ePNUl5+s75GcCncDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1912aa35b1163ce83aeb8509414e0a8ee408307f32b107a6b8c4a26029152b20","last_reissued_at":"2026-05-18T01:37:18.595715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:18.595715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.03352","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:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4j/ieIF/SxKbZUm1R3sKvulhtq31GzN1GafpYn4hxx+xDlF9J4niH1Oy2lz31b/9VEuNnOfgiu9GHQrIfUa8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T17:39:08.933681Z"},"content_sha256":"7905481932f98a96134056f61ed6ad8feeaef2c8e7ba2aed47aa1a9ad9b5f57c","schema_version":"1.0","event_id":"sha256:7905481932f98a96134056f61ed6ad8feeaef2c8e7ba2aed47aa1a9ad9b5f57c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DEJKUNNRCY6OQOXLQUEUCTQKR3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Transceiver Optimization in Multicell MIMO Based on the Generalized Benders Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mats Bengtsson, Rami Mochaourab","submitted_at":"2015-06-10T15:11:40Z","abstract_excerpt":"We study the maximum sum rate optimization problem in the multiple-input multiple-output interfering broadcast channel. The multiple-antenna transmitters and receivers are assumed to have perfect channel state information. In this setting, finding the optimal linear transceiver design is an NP-hard problem. We show that a reformulation of the problem renders the application of generalized Benders decomposition suitable. The decomposition provides us with an optimization structure which we exploit to apply two different optimization approaches. While one approach is guaranteed to converge to a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03352","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:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3oxxg62H/YnD+ImT/niZt+1RHLiU0r9EpzN7fHdCBGRrxZacLqTATUQBRSly5WlhdL1xg2SOTP8uRZK2wLK1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T17:39:08.934008Z"},"content_sha256":"b8f403160afe7f543cd69136a07d85e34110f1de7301b1efa40fe4efc54c0b53","schema_version":"1.0","event_id":"sha256:b8f403160afe7f543cd69136a07d85e34110f1de7301b1efa40fe4efc54c0b53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DEJKUNNRCY6OQOXLQUEUCTQKR3/bundle.json","state_url":"https://pith.science/pith/DEJKUNNRCY6OQOXLQUEUCTQKR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DEJKUNNRCY6OQOXLQUEUCTQKR3/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-26T17:39:08Z","links":{"resolver":"https://pith.science/pith/DEJKUNNRCY6OQOXLQUEUCTQKR3","bundle":"https://pith.science/pith/DEJKUNNRCY6OQOXLQUEUCTQKR3/bundle.json","state":"https://pith.science/pith/DEJKUNNRCY6OQOXLQUEUCTQKR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DEJKUNNRCY6OQOXLQUEUCTQKR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DEJKUNNRCY6OQOXLQUEUCTQKR3","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":"07e5ee3bd6bc22e6422b43165bfebdd61a8e49f0c46720a28ef10c8845f680f1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-10T15:11:40Z","title_canon_sha256":"907e6be0f3482dd3a88d31251d48ec12c9770dd4620ed126761dce0167bca571"},"schema_version":"1.0","source":{"id":"1506.03352","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03352","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03352v2","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03352","created_at":"2026-05-18T01:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"DEJKUNNRCY6O","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DEJKUNNRCY6OQOXL","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DEJKUNNR","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:b8f403160afe7f543cd69136a07d85e34110f1de7301b1efa40fe4efc54c0b53","target":"graph","created_at":"2026-05-18T01:37:18Z","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 study the maximum sum rate optimization problem in the multiple-input multiple-output interfering broadcast channel. The multiple-antenna transmitters and receivers are assumed to have perfect channel state information. In this setting, finding the optimal linear transceiver design is an NP-hard problem. We show that a reformulation of the problem renders the application of generalized Benders decomposition suitable. The decomposition provides us with an optimization structure which we exploit to apply two different optimization approaches. While one approach is guaranteed to converge to a ","authors_text":"Mats Bengtsson, Rami Mochaourab","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-10T15:11:40Z","title":"Linear Transceiver Optimization in Multicell MIMO Based on the Generalized Benders Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03352","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:7905481932f98a96134056f61ed6ad8feeaef2c8e7ba2aed47aa1a9ad9b5f57c","target":"record","created_at":"2026-05-18T01:37:18Z","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":"07e5ee3bd6bc22e6422b43165bfebdd61a8e49f0c46720a28ef10c8845f680f1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-10T15:11:40Z","title_canon_sha256":"907e6be0f3482dd3a88d31251d48ec12c9770dd4620ed126761dce0167bca571"},"schema_version":"1.0","source":{"id":"1506.03352","kind":"arxiv","version":2}},"canonical_sha256":"1912aa35b1163ce83aeb8509414e0a8ee408307f32b107a6b8c4a26029152b20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1912aa35b1163ce83aeb8509414e0a8ee408307f32b107a6b8c4a26029152b20","first_computed_at":"2026-05-18T01:37:18.595715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:18.595715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7H32i7IMLbhNtd5jWlCb8+L97VUSbxsj/YjwxK7fGl2lpV/tI+pONFSQFAw6/sMqfstg7ePNUl5+s75GcCncDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:18.596385Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.03352","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7905481932f98a96134056f61ed6ad8feeaef2c8e7ba2aed47aa1a9ad9b5f57c","sha256:b8f403160afe7f543cd69136a07d85e34110f1de7301b1efa40fe4efc54c0b53"],"state_sha256":"3e3d97286d3c60d444bcb5531ede4ceafa59311d6a6d8b7a73475888581e3d8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZwKg8MLPOk4MJx4uaQxNReobyrsLihsDd9AaXN67LXU14My8WdJ5HodmzB7JrlHDw9Hdv/axwbGLx1FWj1ggDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T17:39:08.935816Z","bundle_sha256":"a1a594eaf20c7f52535bbd6d65241e3ca0068b9f85810a0e67490f79a63f52de"}}