{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AUXHAPCD4HDBYRI6626FW2I6NY","short_pith_number":"pith:AUXHAPCD","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"},"canonical_sha256":"052e703c43e1c61c451ef6bc5b691e6e3ea35d45223f3dd73befd24e61a361e4","source":{"kind":"arxiv","id":"1407.2791","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2791","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2791v1","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2791","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"AUXHAPCD4HDB","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AUXHAPCD4HDBYRI6","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AUXHAPCD","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AUXHAPCD4HDBYRI6626FW2I6NY","target":"record","payload":{"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"},"canonical_sha256":"052e703c43e1c61c451ef6bc5b691e6e3ea35d45223f3dd73befd24e61a361e4","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"},"source_kind":"arxiv","source_id":"1407.2791","source_version":1,"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:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h1y9Zf9mgRNn79QzhfXUz5ujGGvE94iaz78BV/yAgF/9+24WuOYFfd2Bfe41kOYsjnCGJfW4DgkrbfYG4YfIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:33.710102Z"},"content_sha256":"82088db880eb709d44c7ba98d24e1af0caa7e5d71a80c61d9b6650e281c45c66","schema_version":"1.0","event_id":"sha256:82088db880eb709d44c7ba98d24e1af0caa7e5d71a80c61d9b6650e281c45c66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AUXHAPCD4HDBYRI6626FW2I6NY","target":"graph","payload":{"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"},"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:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sHProNykp0yQHWxP3ZlcepMirMkjRDBAQOvMDSufx+CDnS/bsQs3jFmjxLqKo+1fD9Bh09P3v0f7oqNW75T6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:33.710644Z"},"content_sha256":"87672dc4f81090d8939f0776ad0366ea5d07127b0fb7d6b7e82dae45b9d6ce98","schema_version":"1.0","event_id":"sha256:87672dc4f81090d8939f0776ad0366ea5d07127b0fb7d6b7e82dae45b9d6ce98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AUXHAPCD4HDBYRI6626FW2I6NY/bundle.json","state_url":"https://pith.science/pith/AUXHAPCD4HDBYRI6626FW2I6NY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AUXHAPCD4HDBYRI6626FW2I6NY/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-30T12:05:33Z","links":{"resolver":"https://pith.science/pith/AUXHAPCD4HDBYRI6626FW2I6NY","bundle":"https://pith.science/pith/AUXHAPCD4HDBYRI6626FW2I6NY/bundle.json","state":"https://pith.science/pith/AUXHAPCD4HDBYRI6626FW2I6NY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AUXHAPCD4HDBYRI6626FW2I6NY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AUXHAPCD4HDBYRI6626FW2I6NY","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":"b86dd84a29fe0ed3cca0f07c3c1b7c846199f65ac8a9ac843f74a6f1fb66d582","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-10T14:00:18Z","title_canon_sha256":"bd5b8e2e47912096a746b24041ac7f8a24fbeb9eacf7569e8fbb3d261d877eab"},"schema_version":"1.0","source":{"id":"1407.2791","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2791","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2791v1","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2791","created_at":"2026-05-18T00:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"AUXHAPCD4HDB","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AUXHAPCD4HDBYRI6","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AUXHAPCD","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:87672dc4f81090d8939f0776ad0366ea5d07127b0fb7d6b7e82dae45b9d6ce98","target":"graph","created_at":"2026-05-18T00:57:51Z","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 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","authors_text":"Mingyi Hong, Ruoyu Sun, Zhi-Quan Luo","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-10T14:00:18Z","title":"Joint Downlink Base Station Association and Power Control for Max-Min Fairness: Computation and Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2791","kind":"arxiv","version":1},"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:82088db880eb709d44c7ba98d24e1af0caa7e5d71a80c61d9b6650e281c45c66","target":"record","created_at":"2026-05-18T00:57:51Z","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":"b86dd84a29fe0ed3cca0f07c3c1b7c846199f65ac8a9ac843f74a6f1fb66d582","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-07-10T14:00:18Z","title_canon_sha256":"bd5b8e2e47912096a746b24041ac7f8a24fbeb9eacf7569e8fbb3d261d877eab"},"schema_version":"1.0","source":{"id":"1407.2791","kind":"arxiv","version":1}},"canonical_sha256":"052e703c43e1c61c451ef6bc5b691e6e3ea35d45223f3dd73befd24e61a361e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"052e703c43e1c61c451ef6bc5b691e6e3ea35d45223f3dd73befd24e61a361e4","first_computed_at":"2026-05-18T00:57:51.654781Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:51.654781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ectSIUgsej04h8diZmEYAMwNHVmjBtY0waeKqXREOxjewRpo0Fi/4sGylcYbj9oz+hNl5X92zN8Rw1o/yVWVAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:51.655391Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.2791","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82088db880eb709d44c7ba98d24e1af0caa7e5d71a80c61d9b6650e281c45c66","sha256:87672dc4f81090d8939f0776ad0366ea5d07127b0fb7d6b7e82dae45b9d6ce98"],"state_sha256":"5e9af06f550f62cadb2ffc3f82db269639d79fdd0c99e40a2fdd2288dce82bed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"imR2FUcrlvT0Aamcrq94V3zbix0C+vL1Qyjjw/e1DZ6ei1E0Qf3HwXLT6Yqx9+MyxTQnXj66rUAqsNutc1RZDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:05:33.713714Z","bundle_sha256":"640ad85ba59922d2192c99281468dba45d542122364411c882d2cdbda8afe4fd"}}