{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KNXS4WDRPNAOATWHVI3IWVPGSX","short_pith_number":"pith:KNXS4WDR","canonical_record":{"source":{"id":"1701.00904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-01-04T05:54:42Z","cross_cats_sorted":[],"title_canon_sha256":"7ffb26c6b39e78ed4f360ea40126572140e2f24518a3022e23612f624d5e105c","abstract_canon_sha256":"1f2a7fef8d1582538fa36d51ad444b1a3637efac69749a11b914a022338750aa"},"schema_version":"1.0"},"canonical_sha256":"536f2e58717b40e04ec7aa368b55e695e2f48822240ce9bf0b87dc7c7d31f6be","source":{"kind":"arxiv","id":"1701.00904","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00904","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00904v1","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00904","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"pith_short_12","alias_value":"KNXS4WDRPNAO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KNXS4WDRPNAOATWH","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KNXS4WDR","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KNXS4WDRPNAOATWHVI3IWVPGSX","target":"record","payload":{"canonical_record":{"source":{"id":"1701.00904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-01-04T05:54:42Z","cross_cats_sorted":[],"title_canon_sha256":"7ffb26c6b39e78ed4f360ea40126572140e2f24518a3022e23612f624d5e105c","abstract_canon_sha256":"1f2a7fef8d1582538fa36d51ad444b1a3637efac69749a11b914a022338750aa"},"schema_version":"1.0"},"canonical_sha256":"536f2e58717b40e04ec7aa368b55e695e2f48822240ce9bf0b87dc7c7d31f6be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:21.920723Z","signature_b64":"CP2USg5A15FVo+gInefOTQkCBof6yWn6LLPBa+mia1XrAdZh0kvRK3gHepc8SZj4y97Da9sDyvQtWQJW4G89Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"536f2e58717b40e04ec7aa368b55e695e2f48822240ce9bf0b87dc7c7d31f6be","last_reissued_at":"2026-05-18T00:53:21.920107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:21.920107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.00904","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:53:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8dDLwTNGo89HYC0t3TyExgpd/KHtkoP0LxRtFaArmB9hXTsC2WxnjUWJN0K5G4d2AVliOdO8f3OIhjO5IWpcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:08:09.383397Z"},"content_sha256":"9b9b0490cbf94ce7a88d97237924e7e0e6ed592c595c400a9d18845e859287db","schema_version":"1.0","event_id":"sha256:9b9b0490cbf94ce7a88d97237924e7e0e6ed592c595c400a9d18845e859287db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KNXS4WDRPNAOATWHVI3IWVPGSX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Delay-Optimal Biased User Association in Heterogeneous Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Fancheng Kong, Hongbo Zhu, Victor C. M. Leung, Xinghua Sun","submitted_at":"2017-01-04T05:54:42Z","abstract_excerpt":"In heterogeneous networks (HetNets), load balancing among different tiers can be effectively achieved by a biased user association scheme with which each user chooses to associate with one base station (BS) based on the biased received power. In contrast to previous studies where a BS always has packets to transmit, we assume in this paper that incoming packets intended for all the associated users form a queue in the BS. In order to find the delay limit of the network to support real-time service, we focus on the delay optimization problem by properly tuning the biasing factor of each tier. B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00904","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:53:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dZnXX2YS1PZEDhbBDNuijuhAnO8hNEreOkAXBZj6Pwg6oa4l1e5lHgzVfWtPWoW9Ad9quLGeOGINsiZ9RfQXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:08:09.384036Z"},"content_sha256":"118fa29a92b99301a6a6559efbd901a4043bbacefd5bfddc4e19637702e0b23d","schema_version":"1.0","event_id":"sha256:118fa29a92b99301a6a6559efbd901a4043bbacefd5bfddc4e19637702e0b23d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KNXS4WDRPNAOATWHVI3IWVPGSX/bundle.json","state_url":"https://pith.science/pith/KNXS4WDRPNAOATWHVI3IWVPGSX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KNXS4WDRPNAOATWHVI3IWVPGSX/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-08T18:08:09Z","links":{"resolver":"https://pith.science/pith/KNXS4WDRPNAOATWHVI3IWVPGSX","bundle":"https://pith.science/pith/KNXS4WDRPNAOATWHVI3IWVPGSX/bundle.json","state":"https://pith.science/pith/KNXS4WDRPNAOATWHVI3IWVPGSX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KNXS4WDRPNAOATWHVI3IWVPGSX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KNXS4WDRPNAOATWHVI3IWVPGSX","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":"1f2a7fef8d1582538fa36d51ad444b1a3637efac69749a11b914a022338750aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-01-04T05:54:42Z","title_canon_sha256":"7ffb26c6b39e78ed4f360ea40126572140e2f24518a3022e23612f624d5e105c"},"schema_version":"1.0","source":{"id":"1701.00904","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00904","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00904v1","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00904","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"pith_short_12","alias_value":"KNXS4WDRPNAO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KNXS4WDRPNAOATWH","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KNXS4WDR","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:118fa29a92b99301a6a6559efbd901a4043bbacefd5bfddc4e19637702e0b23d","target":"graph","created_at":"2026-05-18T00:53:21Z","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 heterogeneous networks (HetNets), load balancing among different tiers can be effectively achieved by a biased user association scheme with which each user chooses to associate with one base station (BS) based on the biased received power. In contrast to previous studies where a BS always has packets to transmit, we assume in this paper that incoming packets intended for all the associated users form a queue in the BS. In order to find the delay limit of the network to support real-time service, we focus on the delay optimization problem by properly tuning the biasing factor of each tier. B","authors_text":"Fancheng Kong, Hongbo Zhu, Victor C. M. Leung, Xinghua Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-01-04T05:54:42Z","title":"Delay-Optimal Biased User Association in Heterogeneous Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00904","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:9b9b0490cbf94ce7a88d97237924e7e0e6ed592c595c400a9d18845e859287db","target":"record","created_at":"2026-05-18T00:53:21Z","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":"1f2a7fef8d1582538fa36d51ad444b1a3637efac69749a11b914a022338750aa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-01-04T05:54:42Z","title_canon_sha256":"7ffb26c6b39e78ed4f360ea40126572140e2f24518a3022e23612f624d5e105c"},"schema_version":"1.0","source":{"id":"1701.00904","kind":"arxiv","version":1}},"canonical_sha256":"536f2e58717b40e04ec7aa368b55e695e2f48822240ce9bf0b87dc7c7d31f6be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"536f2e58717b40e04ec7aa368b55e695e2f48822240ce9bf0b87dc7c7d31f6be","first_computed_at":"2026-05-18T00:53:21.920107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:21.920107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CP2USg5A15FVo+gInefOTQkCBof6yWn6LLPBa+mia1XrAdZh0kvRK3gHepc8SZj4y97Da9sDyvQtWQJW4G89Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:21.920723Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.00904","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b9b0490cbf94ce7a88d97237924e7e0e6ed592c595c400a9d18845e859287db","sha256:118fa29a92b99301a6a6559efbd901a4043bbacefd5bfddc4e19637702e0b23d"],"state_sha256":"a315121d25f8558e27d273c0bd576376383f915b9fed2344a6316ec600020934"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SGkJWyVOiQJmVUPscBWf1TCPJfUWQq4UWDFhTJkaSFqInq1TFSMq8A/OnhBF8HehOmtODnwh+LD9phXfuNKaAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:08:09.387202Z","bundle_sha256":"2c4d1471fe9e68f0c6a92fd9a43c6f9b7804299949a142afc184236c08f9d34d"}}