{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2QWH2WPVI5WTJBF2RB7ARGT5GN","short_pith_number":"pith:2QWH2WPV","canonical_record":{"source":{"id":"1710.06587","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2017-10-18T05:17:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1b30a0479212669a6e11f31c935d09fb401b21b18cf1cf7bee35c6806184a245","abstract_canon_sha256":"5ea46e9057f893436bd0638f1b193c8c2d18e9db23e241ec4870650230607eaa"},"schema_version":"1.0"},"canonical_sha256":"d42c7d59f5476d3484ba887e089a7d3350c0802f43bb2e006876c308cb206fa3","source":{"kind":"arxiv","id":"1710.06587","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06587","created_at":"2026-05-18T00:32:33Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06587v1","created_at":"2026-05-18T00:32:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06587","created_at":"2026-05-18T00:32:33Z"},{"alias_kind":"pith_short_12","alias_value":"2QWH2WPVI5WT","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2QWH2WPVI5WTJBF2","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2QWH2WPV","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2QWH2WPVI5WTJBF2RB7ARGT5GN","target":"record","payload":{"canonical_record":{"source":{"id":"1710.06587","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2017-10-18T05:17:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1b30a0479212669a6e11f31c935d09fb401b21b18cf1cf7bee35c6806184a245","abstract_canon_sha256":"5ea46e9057f893436bd0638f1b193c8c2d18e9db23e241ec4870650230607eaa"},"schema_version":"1.0"},"canonical_sha256":"d42c7d59f5476d3484ba887e089a7d3350c0802f43bb2e006876c308cb206fa3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:33.286836Z","signature_b64":"C+i50daIU+Fvo4JLnIeiO5PQKOOsNO0QWBGedTu/78peHahedin7JVnr3pWA4DUg511HVbGzTCBIJxO00NEWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d42c7d59f5476d3484ba887e089a7d3350c0802f43bb2e006876c308cb206fa3","last_reissued_at":"2026-05-18T00:32:33.286125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:33.286125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.06587","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:32:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wpUaWqiOWlbFCpPk9aRtkeKL0v1UXzwG817NmwZX279+/L3RCBxzPFoOtOG3zXrASF83B4lMs0FkQguk1o7RCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:37:17.528517Z"},"content_sha256":"29fd63b903f47d2e7e24fdf5ccfd2572a6a6b1c4a3f8110839fd88479ad1ad53","schema_version":"1.0","event_id":"sha256:29fd63b903f47d2e7e24fdf5ccfd2572a6a6b1c4a3f8110839fd88479ad1ad53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2QWH2WPVI5WTJBF2RB7ARGT5GN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Association and Load Optimization with User Priorities in Load-Coupled Heterogeneous Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hao Xu, Jianfeng Shi, Ming Chen, Wei Xu, Zhaohui Yang","submitted_at":"2017-10-18T05:17:21Z","abstract_excerpt":"In this paper, we consider the network utility maximization problem with various user priorities via jointly optimizing user association, load distribution and power control in a load-coupled heterogeneous network. In order to tackle the nonconvexity of the problem, we first analyze the problem by obtaining the optimal resource allocation strategy in closed form and characterizing the optimal base station load distribution pattern. Both observations are shown essential in simplifying the original problem and making it possible to transform the nonconvex load distribution and power control prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06587","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:32:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hzf1yRW7H1hh5LORkhAF/c4Py4L9Ddm88ZvBFNziNWIosaIHVY0bacALfcQCVRGnyAnkX+OpCT7n5INYloLtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:37:17.529203Z"},"content_sha256":"5246f7d534747de57a10459b6f114338e77f22eb367d7a5987b531b1112a0592","schema_version":"1.0","event_id":"sha256:5246f7d534747de57a10459b6f114338e77f22eb367d7a5987b531b1112a0592"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2QWH2WPVI5WTJBF2RB7ARGT5GN/bundle.json","state_url":"https://pith.science/pith/2QWH2WPVI5WTJBF2RB7ARGT5GN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2QWH2WPVI5WTJBF2RB7ARGT5GN/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-06-07T21:37:17Z","links":{"resolver":"https://pith.science/pith/2QWH2WPVI5WTJBF2RB7ARGT5GN","bundle":"https://pith.science/pith/2QWH2WPVI5WTJBF2RB7ARGT5GN/bundle.json","state":"https://pith.science/pith/2QWH2WPVI5WTJBF2RB7ARGT5GN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2QWH2WPVI5WTJBF2RB7ARGT5GN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2QWH2WPVI5WTJBF2RB7ARGT5GN","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":"5ea46e9057f893436bd0638f1b193c8c2d18e9db23e241ec4870650230607eaa","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2017-10-18T05:17:21Z","title_canon_sha256":"1b30a0479212669a6e11f31c935d09fb401b21b18cf1cf7bee35c6806184a245"},"schema_version":"1.0","source":{"id":"1710.06587","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06587","created_at":"2026-05-18T00:32:33Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06587v1","created_at":"2026-05-18T00:32:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06587","created_at":"2026-05-18T00:32:33Z"},{"alias_kind":"pith_short_12","alias_value":"2QWH2WPVI5WT","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2QWH2WPVI5WTJBF2","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2QWH2WPV","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:5246f7d534747de57a10459b6f114338e77f22eb367d7a5987b531b1112a0592","target":"graph","created_at":"2026-05-18T00:32:33Z","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 paper, we consider the network utility maximization problem with various user priorities via jointly optimizing user association, load distribution and power control in a load-coupled heterogeneous network. In order to tackle the nonconvexity of the problem, we first analyze the problem by obtaining the optimal resource allocation strategy in closed form and characterizing the optimal base station load distribution pattern. Both observations are shown essential in simplifying the original problem and making it possible to transform the nonconvex load distribution and power control prob","authors_text":"Hao Xu, Jianfeng Shi, Ming Chen, Wei Xu, Zhaohui Yang","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2017-10-18T05:17:21Z","title":"Association and Load Optimization with User Priorities in Load-Coupled Heterogeneous Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06587","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:29fd63b903f47d2e7e24fdf5ccfd2572a6a6b1c4a3f8110839fd88479ad1ad53","target":"record","created_at":"2026-05-18T00:32:33Z","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":"5ea46e9057f893436bd0638f1b193c8c2d18e9db23e241ec4870650230607eaa","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2017-10-18T05:17:21Z","title_canon_sha256":"1b30a0479212669a6e11f31c935d09fb401b21b18cf1cf7bee35c6806184a245"},"schema_version":"1.0","source":{"id":"1710.06587","kind":"arxiv","version":1}},"canonical_sha256":"d42c7d59f5476d3484ba887e089a7d3350c0802f43bb2e006876c308cb206fa3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d42c7d59f5476d3484ba887e089a7d3350c0802f43bb2e006876c308cb206fa3","first_computed_at":"2026-05-18T00:32:33.286125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:33.286125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C+i50daIU+Fvo4JLnIeiO5PQKOOsNO0QWBGedTu/78peHahedin7JVnr3pWA4DUg511HVbGzTCBIJxO00NEWCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:33.286836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.06587","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29fd63b903f47d2e7e24fdf5ccfd2572a6a6b1c4a3f8110839fd88479ad1ad53","sha256:5246f7d534747de57a10459b6f114338e77f22eb367d7a5987b531b1112a0592"],"state_sha256":"49e1faedac3c51716d4d6ca0ec94424e6deea9fcd34e54bc1124ad6a88ae28af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nSvyC5I+Yf4/LkFrkYiDXPHSND94p1p3e5AHQ2Alr3S5sVzrwVoivQbtk5olbFdvqdV37UW+qv8y+u9Jp03kDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:37:17.532874Z","bundle_sha256":"9dbe80f52e5034bc86bbdb41bcdd98d3427e271ffa303939b604c8f12d4691a5"}}