{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AUXHAPCD4HDBYRI6626FW2I6NY","short_pith_number":"pith:AUXHAPCD","schema_version":"1.0","canonical_sha256":"052e703c43e1c61c451ef6bc5b691e6e3ea35d45223f3dd73befd24e61a361e4","source":{"kind":"arxiv","id":"1407.2791","version":1},"attestation_state":"computed","paper":{"title":"Joint Downlink Base Station Association and Power Control for Max-Min Fairness: Computation and Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mingyi Hong, Ruoyu Sun, Zhi-Quan Luo","submitted_at":"2014-07-10T14:00:18Z","abstract_excerpt":"In a heterogeneous network (HetNet) with a large number of low power base stations (BSs), proper user-BS association and power control is crucial to achieving desirable system performance. In this paper, we systematically study the joint BS association and power allocation problem for a downlink cellular network under the max-min fairness criterion. First, we show that this problem is NP-hard. Second, we show that the upper bound of the optimal value can be easily computed, and propose a two-stage algorithm to find a high-quality suboptimal solution. Simulation results show that the proposed a"},"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":"1407.2791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-10T14:00:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bd5b8e2e47912096a746b24041ac7f8a24fbeb9eacf7569e8fbb3d261d877eab","abstract_canon_sha256":"b86dd84a29fe0ed3cca0f07c3c1b7c846199f65ac8a9ac843f74a6f1fb66d582"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:51.655391Z","signature_b64":"ectSIUgsej04h8diZmEYAMwNHVmjBtY0waeKqXREOxjewRpo0Fi/4sGylcYbj9oz+hNl5X92zN8Rw1o/yVWVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"052e703c43e1c61c451ef6bc5b691e6e3ea35d45223f3dd73befd24e61a361e4","last_reissued_at":"2026-05-18T00:57:51.654781Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:51.654781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint Downlink Base Station Association and Power Control for Max-Min Fairness: Computation and Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mingyi Hong, Ruoyu Sun, Zhi-Quan Luo","submitted_at":"2014-07-10T14:00:18Z","abstract_excerpt":"In a heterogeneous network (HetNet) with a large number of low power base stations (BSs), proper user-BS association and power control is crucial to achieving desirable system performance. In this paper, we systematically study the joint BS association and power allocation problem for a downlink cellular network under the max-min fairness criterion. First, we show that this problem is NP-hard. Second, we show that the upper bound of the optimal value can be easily computed, and propose a two-stage algorithm to find a high-quality suboptimal solution. Simulation results show that the proposed a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2791","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":"1407.2791","created_at":"2026-05-18T00:57:51.654889+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.2791v1","created_at":"2026-05-18T00:57:51.654889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2791","created_at":"2026-05-18T00:57:51.654889+00:00"},{"alias_kind":"pith_short_12","alias_value":"AUXHAPCD4HDB","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AUXHAPCD4HDBYRI6","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AUXHAPCD","created_at":"2026-05-18T12:28:19.803747+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/AUXHAPCD4HDBYRI6626FW2I6NY","json":"https://pith.science/pith/AUXHAPCD4HDBYRI6626FW2I6NY.json","graph_json":"https://pith.science/api/pith-number/AUXHAPCD4HDBYRI6626FW2I6NY/graph.json","events_json":"https://pith.science/api/pith-number/AUXHAPCD4HDBYRI6626FW2I6NY/events.json","paper":"https://pith.science/paper/AUXHAPCD"},"agent_actions":{"view_html":"https://pith.science/pith/AUXHAPCD4HDBYRI6626FW2I6NY","download_json":"https://pith.science/pith/AUXHAPCD4HDBYRI6626FW2I6NY.json","view_paper":"https://pith.science/paper/AUXHAPCD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.2791&json=true","fetch_graph":"https://pith.science/api/pith-number/AUXHAPCD4HDBYRI6626FW2I6NY/graph.json","fetch_events":"https://pith.science/api/pith-number/AUXHAPCD4HDBYRI6626FW2I6NY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AUXHAPCD4HDBYRI6626FW2I6NY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AUXHAPCD4HDBYRI6626FW2I6NY/action/storage_attestation","attest_author":"https://pith.science/pith/AUXHAPCD4HDBYRI6626FW2I6NY/action/author_attestation","sign_citation":"https://pith.science/pith/AUXHAPCD4HDBYRI6626FW2I6NY/action/citation_signature","submit_replication":"https://pith.science/pith/AUXHAPCD4HDBYRI6626FW2I6NY/action/replication_record"}},"created_at":"2026-05-18T00:57:51.654889+00:00","updated_at":"2026-05-18T00:57:51.654889+00:00"}