{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BURPJLWOPNIPXORCPH7IOKVV2O","short_pith_number":"pith:BURPJLWO","schema_version":"1.0","canonical_sha256":"0d22f4aece7b50fbba2279fe872ab5d39acb935e0dd1d43037c9df7c17bbfb4f","source":{"kind":"arxiv","id":"1711.07913","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic Close To Optimal Joint Resource Allocation and Power Control in the Uplink of Two-cell Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ata Khalili, Meysam Mirzaee, Soroush Akhlaghi","submitted_at":"2017-11-21T17:03:06Z","abstract_excerpt":"In this paper, we investigate joint resource allocation and power control mechanisms for two-cell networks, where each cell has some sub-channels which should be allocated to some users. The main goal persuaded in the current work is finding the best power and sub-channel assignment strategies so that the associated sum-rate of network is maximized, while a minimum rate constraint is maintained by each user. The underlying optimization problem is a highly non-convex mixed integer and non-linear problem which does not yield a trivial solution. In this regard, to tackle the problem, using an app"},"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":"1711.07913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-21T17:03:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f903d87475c341eebb88321122db60b1f15c41d3b3d8efd4fa5511cd2adf1fae","abstract_canon_sha256":"1a3e45177f521b5dab9b65a20deeda74b36da09767d073855ba740a16209236e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:44.623496Z","signature_b64":"ZP23DgMDzZpT1bLWgi+1fYujaJ5UzUlxggNycccwmKq0fTeYdnr5g7WzRvg6tK31f/IF8OWExFQ1h8asB5HMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d22f4aece7b50fbba2279fe872ab5d39acb935e0dd1d43037c9df7c17bbfb4f","last_reissued_at":"2026-05-18T00:16:44.622955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:44.622955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Close To Optimal Joint Resource Allocation and Power Control in the Uplink of Two-cell Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ata Khalili, Meysam Mirzaee, Soroush Akhlaghi","submitted_at":"2017-11-21T17:03:06Z","abstract_excerpt":"In this paper, we investigate joint resource allocation and power control mechanisms for two-cell networks, where each cell has some sub-channels which should be allocated to some users. The main goal persuaded in the current work is finding the best power and sub-channel assignment strategies so that the associated sum-rate of network is maximized, while a minimum rate constraint is maintained by each user. The underlying optimization problem is a highly non-convex mixed integer and non-linear problem which does not yield a trivial solution. In this regard, to tackle the problem, using an app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07913","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":"1711.07913","created_at":"2026-05-18T00:16:44.623034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.07913v1","created_at":"2026-05-18T00:16:44.623034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07913","created_at":"2026-05-18T00:16:44.623034+00:00"},{"alias_kind":"pith_short_12","alias_value":"BURPJLWOPNIP","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BURPJLWOPNIPXORC","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BURPJLWO","created_at":"2026-05-18T12:31:08.081275+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/BURPJLWOPNIPXORCPH7IOKVV2O","json":"https://pith.science/pith/BURPJLWOPNIPXORCPH7IOKVV2O.json","graph_json":"https://pith.science/api/pith-number/BURPJLWOPNIPXORCPH7IOKVV2O/graph.json","events_json":"https://pith.science/api/pith-number/BURPJLWOPNIPXORCPH7IOKVV2O/events.json","paper":"https://pith.science/paper/BURPJLWO"},"agent_actions":{"view_html":"https://pith.science/pith/BURPJLWOPNIPXORCPH7IOKVV2O","download_json":"https://pith.science/pith/BURPJLWOPNIPXORCPH7IOKVV2O.json","view_paper":"https://pith.science/paper/BURPJLWO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.07913&json=true","fetch_graph":"https://pith.science/api/pith-number/BURPJLWOPNIPXORCPH7IOKVV2O/graph.json","fetch_events":"https://pith.science/api/pith-number/BURPJLWOPNIPXORCPH7IOKVV2O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BURPJLWOPNIPXORCPH7IOKVV2O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BURPJLWOPNIPXORCPH7IOKVV2O/action/storage_attestation","attest_author":"https://pith.science/pith/BURPJLWOPNIPXORCPH7IOKVV2O/action/author_attestation","sign_citation":"https://pith.science/pith/BURPJLWOPNIPXORCPH7IOKVV2O/action/citation_signature","submit_replication":"https://pith.science/pith/BURPJLWOPNIPXORCPH7IOKVV2O/action/replication_record"}},"created_at":"2026-05-18T00:16:44.623034+00:00","updated_at":"2026-05-18T00:16:44.623034+00:00"}