{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DB2CNN5ZTYWITR3U5YAQCEDA6G","short_pith_number":"pith:DB2CNN5Z","canonical_record":{"source":{"id":"1503.06101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-20T15:12:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5589473382c666562291cb3b466874ac38dc100f47d171980d017d2578980322","abstract_canon_sha256":"f05429f6925cf3e65ff6a97c394e2e736037a1c8691d887a5158f304cb00c5bf"},"schema_version":"1.0"},"canonical_sha256":"187426b7b99e2c89c774ee01011060f1b24c4848350d42cf5ca9ab0f661e8188","source":{"kind":"arxiv","id":"1503.06101","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06101","created_at":"2026-05-18T02:20:48Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06101v1","created_at":"2026-05-18T02:20:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06101","created_at":"2026-05-18T02:20:48Z"},{"alias_kind":"pith_short_12","alias_value":"DB2CNN5ZTYWI","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DB2CNN5ZTYWITR3U","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DB2CNN5Z","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DB2CNN5ZTYWITR3U5YAQCEDA6G","target":"record","payload":{"canonical_record":{"source":{"id":"1503.06101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-20T15:12:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5589473382c666562291cb3b466874ac38dc100f47d171980d017d2578980322","abstract_canon_sha256":"f05429f6925cf3e65ff6a97c394e2e736037a1c8691d887a5158f304cb00c5bf"},"schema_version":"1.0"},"canonical_sha256":"187426b7b99e2c89c774ee01011060f1b24c4848350d42cf5ca9ab0f661e8188","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:48.634234Z","signature_b64":"QxxUxZgdzbgaYGjSOkTSACUYkQiUCLEj1Ubb80Nq08jUutPIIL224W3BzN6EEUjDYBamlRzKZVoakaIFRjlRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"187426b7b99e2c89c774ee01011060f1b24c4848350d42cf5ca9ab0f661e8188","last_reissued_at":"2026-05-18T02:20:48.633521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:48.633521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.06101","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-18T02:20:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QghMbqSYR80JZK8pVGu8KMB1mdB4gmSO7ftcMqHLseAd192oOD9kRa6CX/y2HkklgJSOIRv4m1QgkOnFNkVdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:09:21.815310Z"},"content_sha256":"ac4ae8f7b9f847a3a2108cab8c26a9ee029a276c3236387c790c69ef2ce6883a","schema_version":"1.0","event_id":"sha256:ac4ae8f7b9f847a3a2108cab8c26a9ee029a276c3236387c790c69ef2ce6883a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DB2CNN5ZTYWITR3U5YAQCEDA6G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximizing the Sum Rate in Cellular Networks Using Multi-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anja Klein, Hussein Al-Shatri, Rakash SivaSiva Ganesan, Tobias Weber, Xiang Li","submitted_at":"2015-03-20T15:12:53Z","abstract_excerpt":"In this paper, we propose a novel algorithm to maximize the sum rate in interference-limited scenarios where each user decodes its own message with the presence of unknown interferences and noise considering the signal-to-interference-plus-noise-ratio. It is known that the problem of adapting the transmit and receive filters of the users to maximize the sum rate with a sum transmit power constraint is non-convex. Our novel approach is to formulate the sum rate maximization problem as an equivalent multi-convex optimization problem by adding two sets of auxiliary variables. An iterative algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06101","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-18T02:20:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dsZQjaCH1LOmE4DmYbdKcjeg3q8ZAs8TiQ8zY/8oWyc9Monyoaebsve6DuXhvzz2Ag/devCW7dCvmxYYMFR2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:09:21.816009Z"},"content_sha256":"07df84462fb815fe507e39a3f4edd35df3c340d348a5d8a23a0041eeeeb5e2ac","schema_version":"1.0","event_id":"sha256:07df84462fb815fe507e39a3f4edd35df3c340d348a5d8a23a0041eeeeb5e2ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DB2CNN5ZTYWITR3U5YAQCEDA6G/bundle.json","state_url":"https://pith.science/pith/DB2CNN5ZTYWITR3U5YAQCEDA6G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DB2CNN5ZTYWITR3U5YAQCEDA6G/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-27T20:09:21Z","links":{"resolver":"https://pith.science/pith/DB2CNN5ZTYWITR3U5YAQCEDA6G","bundle":"https://pith.science/pith/DB2CNN5ZTYWITR3U5YAQCEDA6G/bundle.json","state":"https://pith.science/pith/DB2CNN5ZTYWITR3U5YAQCEDA6G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DB2CNN5ZTYWITR3U5YAQCEDA6G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DB2CNN5ZTYWITR3U5YAQCEDA6G","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":"f05429f6925cf3e65ff6a97c394e2e736037a1c8691d887a5158f304cb00c5bf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-20T15:12:53Z","title_canon_sha256":"5589473382c666562291cb3b466874ac38dc100f47d171980d017d2578980322"},"schema_version":"1.0","source":{"id":"1503.06101","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06101","created_at":"2026-05-18T02:20:48Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06101v1","created_at":"2026-05-18T02:20:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06101","created_at":"2026-05-18T02:20:48Z"},{"alias_kind":"pith_short_12","alias_value":"DB2CNN5ZTYWI","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DB2CNN5ZTYWITR3U","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DB2CNN5Z","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:07df84462fb815fe507e39a3f4edd35df3c340d348a5d8a23a0041eeeeb5e2ac","target":"graph","created_at":"2026-05-18T02:20:48Z","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 propose a novel algorithm to maximize the sum rate in interference-limited scenarios where each user decodes its own message with the presence of unknown interferences and noise considering the signal-to-interference-plus-noise-ratio. It is known that the problem of adapting the transmit and receive filters of the users to maximize the sum rate with a sum transmit power constraint is non-convex. Our novel approach is to formulate the sum rate maximization problem as an equivalent multi-convex optimization problem by adding two sets of auxiliary variables. An iterative algorit","authors_text":"Anja Klein, Hussein Al-Shatri, Rakash SivaSiva Ganesan, Tobias Weber, Xiang Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-20T15:12:53Z","title":"Maximizing the Sum Rate in Cellular Networks Using Multi-Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06101","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:ac4ae8f7b9f847a3a2108cab8c26a9ee029a276c3236387c790c69ef2ce6883a","target":"record","created_at":"2026-05-18T02:20:48Z","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":"f05429f6925cf3e65ff6a97c394e2e736037a1c8691d887a5158f304cb00c5bf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-20T15:12:53Z","title_canon_sha256":"5589473382c666562291cb3b466874ac38dc100f47d171980d017d2578980322"},"schema_version":"1.0","source":{"id":"1503.06101","kind":"arxiv","version":1}},"canonical_sha256":"187426b7b99e2c89c774ee01011060f1b24c4848350d42cf5ca9ab0f661e8188","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"187426b7b99e2c89c774ee01011060f1b24c4848350d42cf5ca9ab0f661e8188","first_computed_at":"2026-05-18T02:20:48.633521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:48.633521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QxxUxZgdzbgaYGjSOkTSACUYkQiUCLEj1Ubb80Nq08jUutPIIL224W3BzN6EEUjDYBamlRzKZVoakaIFRjlRBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:48.634234Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.06101","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac4ae8f7b9f847a3a2108cab8c26a9ee029a276c3236387c790c69ef2ce6883a","sha256:07df84462fb815fe507e39a3f4edd35df3c340d348a5d8a23a0041eeeeb5e2ac"],"state_sha256":"5047831e05de9d4cb3ff1be421542efa433d3584bf3b2781cfc3426675d8b739"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fx3XLaDXvBwC83TbOW6/D2phU3i2WweyZMor5ncsOPYM8qY11EhPbM1wouhgczq8c+eemJTH3QGHYgnf6qr/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:09:21.820043Z","bundle_sha256":"22cc36e2325b9b9ebc753638657ab5d93148629528e7d4a3c5afba1f9807405e"}}