{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HGIGDFPETRTNLIA36COWQFUGNV","short_pith_number":"pith:HGIGDFPE","schema_version":"1.0","canonical_sha256":"39906195e49c66d5a01bf09d6816866d584c4c85f113fb6bb0ae93add04c8751","source":{"kind":"arxiv","id":"1606.08401","version":2},"attestation_state":"computed","paper":{"title":"User Assignment in C-RAN Systems: Algorithms and Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christer Qvarfordt, Hadi Ghauch, James Gross, Mikael Skoglund, Muhammad Mahboob Ur Rahman, Sahar Imtiaz","submitted_at":"2016-06-27T18:33:50Z","abstract_excerpt":"In this work, we investigate the problem of mitigating interference between so called antenna domains of a cloud radio access network (C-RAN). In contrast to previous work, we turn to an approach utilizing primarily the optimal assignment of users to central processors in a C-RAN deployment. We formulate this user assignment problem as an integer optimization problem, and propose an iterative algorithm for obtaining a solution. Motivated by the lack of optimality guarantees on such solutions, we opt to find lower bounds on the problem, and the resulting interference leakage in the network. We "},"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":"1606.08401","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-27T18:33:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b7c2491551e40527e720af56a570da2d3843f54c7d59a5c62078c42ad08fd401","abstract_canon_sha256":"f45b6ac786bcc6452692a959c6d871e35d9666fce9f8f759e91ef5eea6f2da2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:16.442185Z","signature_b64":"hS01ZT0U8himT2xHdWyQoFq9VpOJ3fopmHEmOm1XdMQNTLy1T1GXHn7czAZf5YnK0AgO7mHJJyt1xan7JJlYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39906195e49c66d5a01bf09d6816866d584c4c85f113fb6bb0ae93add04c8751","last_reissued_at":"2026-05-18T00:22:16.441672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:16.441672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"User Assignment in C-RAN Systems: Algorithms and Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christer Qvarfordt, Hadi Ghauch, James Gross, Mikael Skoglund, Muhammad Mahboob Ur Rahman, Sahar Imtiaz","submitted_at":"2016-06-27T18:33:50Z","abstract_excerpt":"In this work, we investigate the problem of mitigating interference between so called antenna domains of a cloud radio access network (C-RAN). In contrast to previous work, we turn to an approach utilizing primarily the optimal assignment of users to central processors in a C-RAN deployment. We formulate this user assignment problem as an integer optimization problem, and propose an iterative algorithm for obtaining a solution. Motivated by the lack of optimality guarantees on such solutions, we opt to find lower bounds on the problem, and the resulting interference leakage in the network. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08401","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.08401","created_at":"2026-05-18T00:22:16.441750+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.08401v2","created_at":"2026-05-18T00:22:16.441750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08401","created_at":"2026-05-18T00:22:16.441750+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGIGDFPETRTN","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGIGDFPETRTNLIA3","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGIGDFPE","created_at":"2026-05-18T12:30:19.053100+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/HGIGDFPETRTNLIA36COWQFUGNV","json":"https://pith.science/pith/HGIGDFPETRTNLIA36COWQFUGNV.json","graph_json":"https://pith.science/api/pith-number/HGIGDFPETRTNLIA36COWQFUGNV/graph.json","events_json":"https://pith.science/api/pith-number/HGIGDFPETRTNLIA36COWQFUGNV/events.json","paper":"https://pith.science/paper/HGIGDFPE"},"agent_actions":{"view_html":"https://pith.science/pith/HGIGDFPETRTNLIA36COWQFUGNV","download_json":"https://pith.science/pith/HGIGDFPETRTNLIA36COWQFUGNV.json","view_paper":"https://pith.science/paper/HGIGDFPE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.08401&json=true","fetch_graph":"https://pith.science/api/pith-number/HGIGDFPETRTNLIA36COWQFUGNV/graph.json","fetch_events":"https://pith.science/api/pith-number/HGIGDFPETRTNLIA36COWQFUGNV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGIGDFPETRTNLIA36COWQFUGNV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGIGDFPETRTNLIA36COWQFUGNV/action/storage_attestation","attest_author":"https://pith.science/pith/HGIGDFPETRTNLIA36COWQFUGNV/action/author_attestation","sign_citation":"https://pith.science/pith/HGIGDFPETRTNLIA36COWQFUGNV/action/citation_signature","submit_replication":"https://pith.science/pith/HGIGDFPETRTNLIA36COWQFUGNV/action/replication_record"}},"created_at":"2026-05-18T00:22:16.441750+00:00","updated_at":"2026-05-18T00:22:16.441750+00:00"}