{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IHK7HSVTBBIVLC37U2T3FSBS62","short_pith_number":"pith:IHK7HSVT","schema_version":"1.0","canonical_sha256":"41d5f3cab30851558b7fa6a7b2c832f68f1ca081557a97b52b01e331e037f49b","source":{"kind":"arxiv","id":"1806.03451","version":1},"attestation_state":"computed","paper":{"title":"Learning Oriented Cross-Entropy Approach to User Association in Load-Balanced HetNet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guo Xie, Shi Jin, Wei Xu, Xiaohu You, Xietian Huang","submitted_at":"2018-06-09T10:22:11Z","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"},"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":"1806.03451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-09T10:22:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3787ea4eafe87a8392404ea80593e53d009980283dccdb6f6ce7e17d8e4f2fe0","abstract_canon_sha256":"50431327f7bbd15a8c511da92aa4684cf4ba1affe43860551ed45ea632f5c470"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:43.353877Z","signature_b64":"/yU6gPu/ehfbPFCxXMj3Js17fUDy3Ev0S+ImLLVu3dipqj2sKMmrGdyiOg+5zWWlAId4CK2y1SnIwG9S3TbmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41d5f3cab30851558b7fa6a7b2c832f68f1ca081557a97b52b01e331e037f49b","last_reissued_at":"2026-05-18T00:13:43.353182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:43.353182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Oriented Cross-Entropy Approach to User Association in Load-Balanced HetNet","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Guo Xie, Shi Jin, Wei Xu, Xiaohu You, Xietian Huang","submitted_at":"2018-06-09T10:22:11Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03451","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":"1806.03451","created_at":"2026-05-18T00:13:43.353283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.03451v1","created_at":"2026-05-18T00:13:43.353283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03451","created_at":"2026-05-18T00:13:43.353283+00:00"},{"alias_kind":"pith_short_12","alias_value":"IHK7HSVTBBIV","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"IHK7HSVTBBIVLC37","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"IHK7HSVT","created_at":"2026-05-18T12:32:28.185984+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/IHK7HSVTBBIVLC37U2T3FSBS62","json":"https://pith.science/pith/IHK7HSVTBBIVLC37U2T3FSBS62.json","graph_json":"https://pith.science/api/pith-number/IHK7HSVTBBIVLC37U2T3FSBS62/graph.json","events_json":"https://pith.science/api/pith-number/IHK7HSVTBBIVLC37U2T3FSBS62/events.json","paper":"https://pith.science/paper/IHK7HSVT"},"agent_actions":{"view_html":"https://pith.science/pith/IHK7HSVTBBIVLC37U2T3FSBS62","download_json":"https://pith.science/pith/IHK7HSVTBBIVLC37U2T3FSBS62.json","view_paper":"https://pith.science/paper/IHK7HSVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.03451&json=true","fetch_graph":"https://pith.science/api/pith-number/IHK7HSVTBBIVLC37U2T3FSBS62/graph.json","fetch_events":"https://pith.science/api/pith-number/IHK7HSVTBBIVLC37U2T3FSBS62/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IHK7HSVTBBIVLC37U2T3FSBS62/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IHK7HSVTBBIVLC37U2T3FSBS62/action/storage_attestation","attest_author":"https://pith.science/pith/IHK7HSVTBBIVLC37U2T3FSBS62/action/author_attestation","sign_citation":"https://pith.science/pith/IHK7HSVTBBIVLC37U2T3FSBS62/action/citation_signature","submit_replication":"https://pith.science/pith/IHK7HSVTBBIVLC37U2T3FSBS62/action/replication_record"}},"created_at":"2026-05-18T00:13:43.353283+00:00","updated_at":"2026-05-18T00:13:43.353283+00:00"}