{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DTG72WRRWBW7WK7HJLCR7NAQQD","short_pith_number":"pith:DTG72WRR","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"},"canonical_sha256":"1ccdfd5a31b06dfb2be74ac51fb41080c3139a378f13f7376cc7b1d2c7826fc5","source":{"kind":"arxiv","id":"1809.05725","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05725","created_at":"2026-05-17T23:49:52Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05725v2","created_at":"2026-05-17T23:49:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05725","created_at":"2026-05-17T23:49:52Z"},{"alias_kind":"pith_short_12","alias_value":"DTG72WRRWBW7","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DTG72WRRWBW7WK7H","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DTG72WRR","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DTG72WRRWBW7WK7HJLCR7NAQQD","target":"record","payload":{"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"},"canonical_sha256":"1ccdfd5a31b06dfb2be74ac51fb41080c3139a378f13f7376cc7b1d2c7826fc5","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"},"source_kind":"arxiv","source_id":"1809.05725","source_version":2,"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-17T23:49:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"39VltMCApXIknRSokgAhnUSOqbwZUqLRi/gSIojjN2q9zmwIJ230eCHjhXHVCVOZDCMtm34iG3oZrovH8bwiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:07:00.095834Z"},"content_sha256":"a9274ff282f04c5e05a7efe495354a774c06c80c020ef53e14d525da1a8228d0","schema_version":"1.0","event_id":"sha256:a9274ff282f04c5e05a7efe495354a774c06c80c020ef53e14d525da1a8228d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DTG72WRRWBW7WK7HJLCR7NAQQD","target":"graph","payload":{"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"},"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-17T23:49:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+0jbK9A/4hzqUKEyu8GtuTFYVxSjagEyHe0uT5AKPDZ8TersR0evgjhxLxOWBaJvdnEa/egJj9WlV2NwIo8ECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:07:00.096541Z"},"content_sha256":"e9230cfaf323eb9501558f240ac6c6c2efc8a1f8cdd523eef513a1b0776efdf4","schema_version":"1.0","event_id":"sha256:e9230cfaf323eb9501558f240ac6c6c2efc8a1f8cdd523eef513a1b0776efdf4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTG72WRRWBW7WK7HJLCR7NAQQD/bundle.json","state_url":"https://pith.science/pith/DTG72WRRWBW7WK7HJLCR7NAQQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTG72WRRWBW7WK7HJLCR7NAQQD/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-05-30T09:07:00Z","links":{"resolver":"https://pith.science/pith/DTG72WRRWBW7WK7HJLCR7NAQQD","bundle":"https://pith.science/pith/DTG72WRRWBW7WK7HJLCR7NAQQD/bundle.json","state":"https://pith.science/pith/DTG72WRRWBW7WK7HJLCR7NAQQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTG72WRRWBW7WK7HJLCR7NAQQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DTG72WRRWBW7WK7HJLCR7NAQQD","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":"8c2ebf721962bbe28072776d8ed7f0f17b2851d1cbae7a5b426f22a5aab8687e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-09-15T14:48:01Z","title_canon_sha256":"a8d0d6ab12651d84188c190afb15b413d4df87ca440e6c704b3dbb4885cf003c"},"schema_version":"1.0","source":{"id":"1809.05725","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05725","created_at":"2026-05-17T23:49:52Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05725v2","created_at":"2026-05-17T23:49:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05725","created_at":"2026-05-17T23:49:52Z"},{"alias_kind":"pith_short_12","alias_value":"DTG72WRRWBW7","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DTG72WRRWBW7WK7H","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DTG72WRR","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:e9230cfaf323eb9501558f240ac6c6c2efc8a1f8cdd523eef513a1b0776efdf4","target":"graph","created_at":"2026-05-17T23:49:52Z","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":"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$","authors_text":"K. P. Naveen, S. Ramakrishnan, Venkatesh Ramaiyan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-09-15T14:48:01Z","title":"Completely Uncoupled User Association Algorithms for State Dependent Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05725","kind":"arxiv","version":2},"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:a9274ff282f04c5e05a7efe495354a774c06c80c020ef53e14d525da1a8228d0","target":"record","created_at":"2026-05-17T23:49:52Z","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":"8c2ebf721962bbe28072776d8ed7f0f17b2851d1cbae7a5b426f22a5aab8687e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-09-15T14:48:01Z","title_canon_sha256":"a8d0d6ab12651d84188c190afb15b413d4df87ca440e6c704b3dbb4885cf003c"},"schema_version":"1.0","source":{"id":"1809.05725","kind":"arxiv","version":2}},"canonical_sha256":"1ccdfd5a31b06dfb2be74ac51fb41080c3139a378f13f7376cc7b1d2c7826fc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ccdfd5a31b06dfb2be74ac51fb41080c3139a378f13f7376cc7b1d2c7826fc5","first_computed_at":"2026-05-17T23:49:52.534077Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:52.534077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5/YcPw+zvzuoHyqkuGXotwj0mz4Uz79EMLyDt37wZjI/sbRfVg5zxSdWFlVSNkJI9Af0i7geXSLAyA+LJhnSAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:52.534574Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.05725","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9274ff282f04c5e05a7efe495354a774c06c80c020ef53e14d525da1a8228d0","sha256:e9230cfaf323eb9501558f240ac6c6c2efc8a1f8cdd523eef513a1b0776efdf4"],"state_sha256":"0c65c8fe9f4be457a53a46e906681b744a1345e81a5c924a243ee7671a5a3954"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yRwMtG9j4HFvBYXWMZ3i4+LqT8jUOOHdjhvj/iqS+N8URh3If8+6Ngi7zhj+qlV2zbwXXW+RlDYQReq/48GoBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:07:00.100285Z","bundle_sha256":"55240def385489afc922e8b5ce144d7741fa843d8a0b71185cb7e2813d4ddc64"}}