{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PD3ZMI7OSVDHGCMKKXYQVNM6MW","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":"9183dd51417b0f867e8aa16457296a55d0c038914002543da0030a677279ce72","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-11T05:40:03Z","title_canon_sha256":"41611c82079c40071dcea0cc26cdbec37da8f2a75c9863560612f1f5b415422b"},"schema_version":"1.0","source":{"id":"1501.02419","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.02419","created_at":"2026-05-18T01:30:51Z"},{"alias_kind":"arxiv_version","alias_value":"1501.02419v1","created_at":"2026-05-18T01:30:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02419","created_at":"2026-05-18T01:30:51Z"},{"alias_kind":"pith_short_12","alias_value":"PD3ZMI7OSVDH","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PD3ZMI7OSVDHGCMK","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PD3ZMI7O","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:40e8573958cfa8b19d9210670f1bc098f47b788fdf37d42a3c1d19673f1223b7","target":"graph","created_at":"2026-05-18T01:30:51Z","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 downlink delay minimization within the context of cellular user association policies that map mobile users to base stations. We note the delay minimum user association problem fits within a broader class of network utility maximization and can be posed as a non-convex quadratic program. This non-convexity motivates a split quadratic objective function that captures the original problem's inherent tradeoff: association with a station that provides the highest signal-to-interference-plus-noise ratio (SINR) vs. a station that is least congested. We find the split-term formulation is amen","authors_text":"Ali Shokoufandeh, Jeffrey Wildman, Steven Weber, Yusuf Osmanlioglu","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-11T05:40:03Z","title":"Delay Minimizing User Association in Cellular Networks via Hierarchically Well-Separated Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02419","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:ae3e88a4bf14cde7dcc7b73a090289821281a85dff79d226a2e7362f47aa8fb9","target":"record","created_at":"2026-05-18T01:30:51Z","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":"9183dd51417b0f867e8aa16457296a55d0c038914002543da0030a677279ce72","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-11T05:40:03Z","title_canon_sha256":"41611c82079c40071dcea0cc26cdbec37da8f2a75c9863560612f1f5b415422b"},"schema_version":"1.0","source":{"id":"1501.02419","kind":"arxiv","version":1}},"canonical_sha256":"78f79623ee954673098a55f10ab59e65883dbea849d47fe64907ced4b2700aec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78f79623ee954673098a55f10ab59e65883dbea849d47fe64907ced4b2700aec","first_computed_at":"2026-05-18T01:30:51.111922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:51.111922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FYJIYKIhCo3Avfy7oJUh8A3vV0+xJ+DOWJgary3VdKBmRfkQRjedQ0fqxgCsDAa3xa0pPqK0OkBB3Q6zoC18Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:51.112359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.02419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae3e88a4bf14cde7dcc7b73a090289821281a85dff79d226a2e7362f47aa8fb9","sha256:40e8573958cfa8b19d9210670f1bc098f47b788fdf37d42a3c1d19673f1223b7"],"state_sha256":"a0ed007a91ec0caee065afbabe1bcb16a502b509406565aa7c800a683b19fd92"}