{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DTG72WRRWBW7WK7HJLCR7NAQQD","short_pith_number":"pith:DTG72WRR","schema_version":"1.0","canonical_sha256":"1ccdfd5a31b06dfb2be74ac51fb41080c3139a378f13f7376cc7b1d2c7826fc5","source":{"kind":"arxiv","id":"1809.05725","version":2},"attestation_state":"computed","paper":{"title":"Completely Uncoupled User Association Algorithms for State Dependent Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"K. P. Naveen, S. Ramakrishnan, Venkatesh Ramaiyan","submitted_at":"2018-09-15T14:48:01Z","abstract_excerpt":"We study a distributed user association algorithm for a heterogeneous wireless network with the objective of maximizing the sum of the utilities (on the received throughput of wireless users). We consider a state dependent wireless network, where the rate achieved by the users are a function of their user associations as well as the state of the system. We consider three different scenarios depending on the state evolution and the users$\\text{'}$ knowledge of the system state. In this context, we present completely uncoupled user association algorithms for utility maximization where the users$"},"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":"1809.05725","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-09-15T14:48:01Z","cross_cats_sorted":[],"title_canon_sha256":"a8d0d6ab12651d84188c190afb15b413d4df87ca440e6c704b3dbb4885cf003c","abstract_canon_sha256":"8c2ebf721962bbe28072776d8ed7f0f17b2851d1cbae7a5b426f22a5aab8687e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:52.534574Z","signature_b64":"5/YcPw+zvzuoHyqkuGXotwj0mz4Uz79EMLyDt37wZjI/sbRfVg5zxSdWFlVSNkJI9Af0i7geXSLAyA+LJhnSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ccdfd5a31b06dfb2be74ac51fb41080c3139a378f13f7376cc7b1d2c7826fc5","last_reissued_at":"2026-05-17T23:49:52.534077Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:52.534077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Completely Uncoupled User Association Algorithms for State Dependent Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"K. P. Naveen, S. Ramakrishnan, Venkatesh Ramaiyan","submitted_at":"2018-09-15T14:48:01Z","abstract_excerpt":"We study a distributed user association algorithm for a heterogeneous wireless network with the objective of maximizing the sum of the utilities (on the received throughput of wireless users). We consider a state dependent wireless network, where the rate achieved by the users are a function of their user associations as well as the state of the system. We consider three different scenarios depending on the state evolution and the users$\\text{'}$ knowledge of the system state. In this context, we present completely uncoupled user association algorithms for utility maximization where the users$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05725","kind":"arxiv","version":2},"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":"1809.05725","created_at":"2026-05-17T23:49:52.534153+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.05725v2","created_at":"2026-05-17T23:49:52.534153+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05725","created_at":"2026-05-17T23:49:52.534153+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTG72WRRWBW7","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTG72WRRWBW7WK7H","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTG72WRR","created_at":"2026-05-18T12:32:19.392346+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/DTG72WRRWBW7WK7HJLCR7NAQQD","json":"https://pith.science/pith/DTG72WRRWBW7WK7HJLCR7NAQQD.json","graph_json":"https://pith.science/api/pith-number/DTG72WRRWBW7WK7HJLCR7NAQQD/graph.json","events_json":"https://pith.science/api/pith-number/DTG72WRRWBW7WK7HJLCR7NAQQD/events.json","paper":"https://pith.science/paper/DTG72WRR"},"agent_actions":{"view_html":"https://pith.science/pith/DTG72WRRWBW7WK7HJLCR7NAQQD","download_json":"https://pith.science/pith/DTG72WRRWBW7WK7HJLCR7NAQQD.json","view_paper":"https://pith.science/paper/DTG72WRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.05725&json=true","fetch_graph":"https://pith.science/api/pith-number/DTG72WRRWBW7WK7HJLCR7NAQQD/graph.json","fetch_events":"https://pith.science/api/pith-number/DTG72WRRWBW7WK7HJLCR7NAQQD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTG72WRRWBW7WK7HJLCR7NAQQD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTG72WRRWBW7WK7HJLCR7NAQQD/action/storage_attestation","attest_author":"https://pith.science/pith/DTG72WRRWBW7WK7HJLCR7NAQQD/action/author_attestation","sign_citation":"https://pith.science/pith/DTG72WRRWBW7WK7HJLCR7NAQQD/action/citation_signature","submit_replication":"https://pith.science/pith/DTG72WRRWBW7WK7HJLCR7NAQQD/action/replication_record"}},"created_at":"2026-05-17T23:49:52.534153+00:00","updated_at":"2026-05-17T23:49:52.534153+00:00"}