{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IHK7HSVTBBIVLC37U2T3FSBS62","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":"50431327f7bbd15a8c511da92aa4684cf4ba1affe43860551ed45ea632f5c470","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-09T10:22:11Z","title_canon_sha256":"3787ea4eafe87a8392404ea80593e53d009980283dccdb6f6ce7e17d8e4f2fe0"},"schema_version":"1.0","source":{"id":"1806.03451","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03451","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03451v1","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03451","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"pith_short_12","alias_value":"IHK7HSVTBBIV","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IHK7HSVTBBIVLC37","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IHK7HSVT","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:0fbe256411b9ef2b3e31e138cbe131d01ed55d0bfe6a75616c626fb1615e9a50","target":"graph","created_at":"2026-05-18T00:13:43Z","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":"This letter considers optimizing user association in a heterogeneous network via utility maximization, which is a combinatorial optimization problem due to integer constraints. Different from existing solutions based on convex optimization, we alternatively propose a cross-entropy (CE)-based algorithm inspired by a sampling approach developed in machine learning. Adopting a probabilistic model, we first reformulate the original problem as a CE minimization problem which aims to learn the probability distribution of variables in the optimal association. An efficient solution by stochastic sampl","authors_text":"Guo Xie, Shi Jin, Wei Xu, Xiaohu You, Xietian Huang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-09T10:22:11Z","title":"Learning Oriented Cross-Entropy Approach to User Association in Load-Balanced HetNet"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03451","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:e4c35f47a0f81f94f575c5de0024c394bb7f3b8f458d922cd3e594290625d5e1","target":"record","created_at":"2026-05-18T00:13:43Z","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":"50431327f7bbd15a8c511da92aa4684cf4ba1affe43860551ed45ea632f5c470","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-09T10:22:11Z","title_canon_sha256":"3787ea4eafe87a8392404ea80593e53d009980283dccdb6f6ce7e17d8e4f2fe0"},"schema_version":"1.0","source":{"id":"1806.03451","kind":"arxiv","version":1}},"canonical_sha256":"41d5f3cab30851558b7fa6a7b2c832f68f1ca081557a97b52b01e331e037f49b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41d5f3cab30851558b7fa6a7b2c832f68f1ca081557a97b52b01e331e037f49b","first_computed_at":"2026-05-18T00:13:43.353182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:43.353182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/yU6gPu/ehfbPFCxXMj3Js17fUDy3Ev0S+ImLLVu3dipqj2sKMmrGdyiOg+5zWWlAId4CK2y1SnIwG9S3TbmCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:43.353877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03451","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4c35f47a0f81f94f575c5de0024c394bb7f3b8f458d922cd3e594290625d5e1","sha256:0fbe256411b9ef2b3e31e138cbe131d01ed55d0bfe6a75616c626fb1615e9a50"],"state_sha256":"eb6900ececc6f669605bef73e6450a0cd876a962c825955b7d556e7c3ea1cd7c"}