{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XLKMTKR5GNEHMWD6SSEW5VUZP7","short_pith_number":"pith:XLKMTKR5","schema_version":"1.0","canonical_sha256":"bad4c9aa3d334876587e94896ed6997fc2ebcff5422baf09d698407082103aa3","source":{"kind":"arxiv","id":"1505.02098","version":1},"attestation_state":"computed","paper":{"title":"Distributed Optimization of Multi-Cell Uplink Co-operation with Backhaul Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SY","authors_text":"Khalid Zeineddine, Michael L. Honig, Shirish Nagaraj","submitted_at":"2015-05-08T16:53:25Z","abstract_excerpt":"We address the problem of uplink co-operative reception with constraints on both backhaul bandwidth and the receiver aperture, or number of antenna signals that can be processed. The problem is cast as a network utility (weighted sum rate) maximization subject to computational complexity and architectural bandwidth sharing constraints. We show that a relaxed version of the problem is convex, and can be solved via a dual-decomposition. The proposed solution is distributed in that each cell broadcasts a set of {\\em demand prices} based on the data sharing requests they receive. Given the demand "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1505.02098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-05-08T16:53:25Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"8dae403c052d44d642305027c110f7a3a4ae61a281c89ae90d3d6ed90da7ae25","abstract_canon_sha256":"c3ceef4c4ff812d27823b8acf5e69f942b1ad73f5e5d907da11e0aa922966467"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:10.806620Z","signature_b64":"weF0il4HOf3SgWJ/aFcYftjrelt1EXhPflwRUEOKCOyHw/Sik3AkUuNz+iZv3xAig+xXe1bQzJHbl1MeBIC3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bad4c9aa3d334876587e94896ed6997fc2ebcff5422baf09d698407082103aa3","last_reissued_at":"2026-05-18T00:58:10.806011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:10.806011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Optimization of Multi-Cell Uplink Co-operation with Backhaul Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.SY","authors_text":"Khalid Zeineddine, Michael L. Honig, Shirish Nagaraj","submitted_at":"2015-05-08T16:53:25Z","abstract_excerpt":"We address the problem of uplink co-operative reception with constraints on both backhaul bandwidth and the receiver aperture, or number of antenna signals that can be processed. The problem is cast as a network utility (weighted sum rate) maximization subject to computational complexity and architectural bandwidth sharing constraints. We show that a relaxed version of the problem is convex, and can be solved via a dual-decomposition. The proposed solution is distributed in that each cell broadcasts a set of {\\em demand prices} based on the data sharing requests they receive. Given the demand "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02098","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.02098","created_at":"2026-05-18T00:58:10.806096+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.02098v1","created_at":"2026-05-18T00:58:10.806096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02098","created_at":"2026-05-18T00:58:10.806096+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLKMTKR5GNEH","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLKMTKR5GNEHMWD6","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLKMTKR5","created_at":"2026-05-18T12:29:50.041715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XLKMTKR5GNEHMWD6SSEW5VUZP7","json":"https://pith.science/pith/XLKMTKR5GNEHMWD6SSEW5VUZP7.json","graph_json":"https://pith.science/api/pith-number/XLKMTKR5GNEHMWD6SSEW5VUZP7/graph.json","events_json":"https://pith.science/api/pith-number/XLKMTKR5GNEHMWD6SSEW5VUZP7/events.json","paper":"https://pith.science/paper/XLKMTKR5"},"agent_actions":{"view_html":"https://pith.science/pith/XLKMTKR5GNEHMWD6SSEW5VUZP7","download_json":"https://pith.science/pith/XLKMTKR5GNEHMWD6SSEW5VUZP7.json","view_paper":"https://pith.science/paper/XLKMTKR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.02098&json=true","fetch_graph":"https://pith.science/api/pith-number/XLKMTKR5GNEHMWD6SSEW5VUZP7/graph.json","fetch_events":"https://pith.science/api/pith-number/XLKMTKR5GNEHMWD6SSEW5VUZP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLKMTKR5GNEHMWD6SSEW5VUZP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLKMTKR5GNEHMWD6SSEW5VUZP7/action/storage_attestation","attest_author":"https://pith.science/pith/XLKMTKR5GNEHMWD6SSEW5VUZP7/action/author_attestation","sign_citation":"https://pith.science/pith/XLKMTKR5GNEHMWD6SSEW5VUZP7/action/citation_signature","submit_replication":"https://pith.science/pith/XLKMTKR5GNEHMWD6SSEW5VUZP7/action/replication_record"}},"created_at":"2026-05-18T00:58:10.806096+00:00","updated_at":"2026-05-18T00:58:10.806096+00:00"}