{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HGIGDFPETRTNLIA36COWQFUGNV","short_pith_number":"pith:HGIGDFPE","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"},"canonical_sha256":"39906195e49c66d5a01bf09d6816866d584c4c85f113fb6bb0ae93add04c8751","source":{"kind":"arxiv","id":"1606.08401","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08401","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08401v2","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08401","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"HGIGDFPETRTN","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HGIGDFPETRTNLIA3","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HGIGDFPE","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HGIGDFPETRTNLIA36COWQFUGNV","target":"record","payload":{"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"},"canonical_sha256":"39906195e49c66d5a01bf09d6816866d584c4c85f113fb6bb0ae93add04c8751","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"},"source_kind":"arxiv","source_id":"1606.08401","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-18T00:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+HTNEhKo0SbIufqv5QuEeqBcwOKb8jHK0ANQKfde73f0sXwdfqo2GfDH9u/sUxHljIVBcFWyb/nyresP68e/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:34:27.092502Z"},"content_sha256":"6fc59aa5c578bfd307a1b88ef77650062f139c25825561eec9f3936444c72ca7","schema_version":"1.0","event_id":"sha256:6fc59aa5c578bfd307a1b88ef77650062f139c25825561eec9f3936444c72ca7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HGIGDFPETRTNLIA36COWQFUGNV","target":"graph","payload":{"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"},"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-18T00:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ceAQ4ECYiCdWJTCHB2UgLBFRDqNpCqIbrJI14gzUFp+ae0dwYG8lQw05WRv9OnJiWqQXX6Ax+Zh4S6kuTLosDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:34:27.093114Z"},"content_sha256":"bac9d8388059e6454dc833c7d0e97e14c54f13cea84ae7c8c151edde294d8a31","schema_version":"1.0","event_id":"sha256:bac9d8388059e6454dc833c7d0e97e14c54f13cea84ae7c8c151edde294d8a31"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGIGDFPETRTNLIA36COWQFUGNV/bundle.json","state_url":"https://pith.science/pith/HGIGDFPETRTNLIA36COWQFUGNV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGIGDFPETRTNLIA36COWQFUGNV/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-26T12:34:27Z","links":{"resolver":"https://pith.science/pith/HGIGDFPETRTNLIA36COWQFUGNV","bundle":"https://pith.science/pith/HGIGDFPETRTNLIA36COWQFUGNV/bundle.json","state":"https://pith.science/pith/HGIGDFPETRTNLIA36COWQFUGNV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGIGDFPETRTNLIA36COWQFUGNV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HGIGDFPETRTNLIA36COWQFUGNV","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":"f45b6ac786bcc6452692a959c6d871e35d9666fce9f8f759e91ef5eea6f2da2d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-27T18:33:50Z","title_canon_sha256":"b7c2491551e40527e720af56a570da2d3843f54c7d59a5c62078c42ad08fd401"},"schema_version":"1.0","source":{"id":"1606.08401","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08401","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08401v2","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08401","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"HGIGDFPETRTN","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HGIGDFPETRTNLIA3","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HGIGDFPE","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:bac9d8388059e6454dc833c7d0e97e14c54f13cea84ae7c8c151edde294d8a31","target":"graph","created_at":"2026-05-18T00:22:16Z","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 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 ","authors_text":"Christer Qvarfordt, Hadi Ghauch, James Gross, Mikael Skoglund, Muhammad Mahboob Ur Rahman, Sahar Imtiaz","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-27T18:33:50Z","title":"User Assignment in C-RAN Systems: Algorithms and Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08401","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:6fc59aa5c578bfd307a1b88ef77650062f139c25825561eec9f3936444c72ca7","target":"record","created_at":"2026-05-18T00:22:16Z","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":"f45b6ac786bcc6452692a959c6d871e35d9666fce9f8f759e91ef5eea6f2da2d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-27T18:33:50Z","title_canon_sha256":"b7c2491551e40527e720af56a570da2d3843f54c7d59a5c62078c42ad08fd401"},"schema_version":"1.0","source":{"id":"1606.08401","kind":"arxiv","version":2}},"canonical_sha256":"39906195e49c66d5a01bf09d6816866d584c4c85f113fb6bb0ae93add04c8751","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39906195e49c66d5a01bf09d6816866d584c4c85f113fb6bb0ae93add04c8751","first_computed_at":"2026-05-18T00:22:16.441672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:16.441672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hS01ZT0U8himT2xHdWyQoFq9VpOJ3fopmHEmOm1XdMQNTLy1T1GXHn7czAZf5YnK0AgO7mHJJyt1xan7JJlYAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:16.442185Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.08401","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fc59aa5c578bfd307a1b88ef77650062f139c25825561eec9f3936444c72ca7","sha256:bac9d8388059e6454dc833c7d0e97e14c54f13cea84ae7c8c151edde294d8a31"],"state_sha256":"2d4c5dea0f8b7f5e1797facf998952e595498ab1b40f57e6d24315a9a0a1e74a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JxR4+zSaDx99487uTurxU99JOe5LkBWwHG4xZTxDcHfi+0QORMYIyTcmu3endHimvWYUya7NCCNowuvL6oJdCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:34:27.096499Z","bundle_sha256":"5784453455d94580afdef99945fbf54d21a9e8516b83b3c7357d4c30d2a443fb"}}