{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EF4KREQPFKRZEXL7CDAQEIMZMC","short_pith_number":"pith:EF4KREQP","canonical_record":{"source":{"id":"1607.04754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-16T15:49:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0ee3e308265c515a58d275b4e089ee44807a14b5db0480b966ed718842e332b5","abstract_canon_sha256":"314f79cbea744786ecb3583df718e51a5953f765791d7f92df0cff3cac9a22fa"},"schema_version":"1.0"},"canonical_sha256":"2178a8920f2aa3925d7f10c1022199608bf470589fbbb6ccc0d0b410086c3ef6","source":{"kind":"arxiv","id":"1607.04754","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04754","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04754v1","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04754","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"EF4KREQPFKRZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EF4KREQPFKRZEXL7","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EF4KREQP","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EF4KREQPFKRZEXL7CDAQEIMZMC","target":"record","payload":{"canonical_record":{"source":{"id":"1607.04754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-16T15:49:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0ee3e308265c515a58d275b4e089ee44807a14b5db0480b966ed718842e332b5","abstract_canon_sha256":"314f79cbea744786ecb3583df718e51a5953f765791d7f92df0cff3cac9a22fa"},"schema_version":"1.0"},"canonical_sha256":"2178a8920f2aa3925d7f10c1022199608bf470589fbbb6ccc0d0b410086c3ef6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:56.807119Z","signature_b64":"u4QqkGSkEodufyn54q/rn5CvJbM8U8K5V69effzlZYVE2It1No+KuoDUI7VM3ZE7tvSfrh+iQZrSmwT/6QIhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2178a8920f2aa3925d7f10c1022199608bf470589fbbb6ccc0d0b410086c3ef6","last_reissued_at":"2026-05-18T01:10:56.806651Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:56.806651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.04754","source_version":1,"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-18T01:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XANuOw7+EyK7/kzj+wOxL9RSP7kgGnLQmoDJrbEIpjC5AyGrAuxxHxCzH+O+RY1aj0GOR+TL+R+98kZ/iQZmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:57:17.965748Z"},"content_sha256":"e5e98f25d1fe34948fb5a0708f7e64e7c39b90577c3c1126d9dea7efe995123a","schema_version":"1.0","event_id":"sha256:e5e98f25d1fe34948fb5a0708f7e64e7c39b90577c3c1126d9dea7efe995123a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EF4KREQPFKRZEXL7CDAQEIMZMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint Optimization of Coverage, Capacity and Load Balancing in Self-Organizing Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniyal Amir Awan, Qi Liao, Slawomir Stanczak","submitted_at":"2016-07-16T15:49:53Z","abstract_excerpt":"This paper develops an optimization framework for self-organizing networks (SON). The objective is to ensure efficient network operation by a joint optimization of different SON functionalities, which includes capacity, coverage and load balancing. Based on the axiomatic framework of monotone and strictly subhomogeneous function, we formulate an optimization problem for the uplink and propose a two-step optimization scheme using fixed point iterations: i) per base station antenna tilt optimization and power allocation, and ii) cluster-based base station assignment of users and power allocation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04754","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"},"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-18T01:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lA60OTbvP1+CL/VcKFu3elt12RyppCGQLh2E00LbQsaDNqV/AntN2f/A6/cyBEMRbZ/4VdMF7uSacMzChnUYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:57:17.966101Z"},"content_sha256":"a2e0227c2b3ad33f52b7675e2699fb338928c898860cac37b8a139ee1b772bef","schema_version":"1.0","event_id":"sha256:a2e0227c2b3ad33f52b7675e2699fb338928c898860cac37b8a139ee1b772bef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EF4KREQPFKRZEXL7CDAQEIMZMC/bundle.json","state_url":"https://pith.science/pith/EF4KREQPFKRZEXL7CDAQEIMZMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EF4KREQPFKRZEXL7CDAQEIMZMC/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-06-02T22:57:17Z","links":{"resolver":"https://pith.science/pith/EF4KREQPFKRZEXL7CDAQEIMZMC","bundle":"https://pith.science/pith/EF4KREQPFKRZEXL7CDAQEIMZMC/bundle.json","state":"https://pith.science/pith/EF4KREQPFKRZEXL7CDAQEIMZMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EF4KREQPFKRZEXL7CDAQEIMZMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EF4KREQPFKRZEXL7CDAQEIMZMC","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":"314f79cbea744786ecb3583df718e51a5953f765791d7f92df0cff3cac9a22fa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-16T15:49:53Z","title_canon_sha256":"0ee3e308265c515a58d275b4e089ee44807a14b5db0480b966ed718842e332b5"},"schema_version":"1.0","source":{"id":"1607.04754","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04754","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04754v1","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04754","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"EF4KREQPFKRZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EF4KREQPFKRZEXL7","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EF4KREQP","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:a2e0227c2b3ad33f52b7675e2699fb338928c898860cac37b8a139ee1b772bef","target":"graph","created_at":"2026-05-18T01:10:56Z","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 paper develops an optimization framework for self-organizing networks (SON). The objective is to ensure efficient network operation by a joint optimization of different SON functionalities, which includes capacity, coverage and load balancing. Based on the axiomatic framework of monotone and strictly subhomogeneous function, we formulate an optimization problem for the uplink and propose a two-step optimization scheme using fixed point iterations: i) per base station antenna tilt optimization and power allocation, and ii) cluster-based base station assignment of users and power allocation","authors_text":"Daniyal Amir Awan, Qi Liao, Slawomir Stanczak","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-16T15:49:53Z","title":"Joint Optimization of Coverage, Capacity and Load Balancing in Self-Organizing Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04754","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:e5e98f25d1fe34948fb5a0708f7e64e7c39b90577c3c1126d9dea7efe995123a","target":"record","created_at":"2026-05-18T01:10:56Z","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":"314f79cbea744786ecb3583df718e51a5953f765791d7f92df0cff3cac9a22fa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-16T15:49:53Z","title_canon_sha256":"0ee3e308265c515a58d275b4e089ee44807a14b5db0480b966ed718842e332b5"},"schema_version":"1.0","source":{"id":"1607.04754","kind":"arxiv","version":1}},"canonical_sha256":"2178a8920f2aa3925d7f10c1022199608bf470589fbbb6ccc0d0b410086c3ef6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2178a8920f2aa3925d7f10c1022199608bf470589fbbb6ccc0d0b410086c3ef6","first_computed_at":"2026-05-18T01:10:56.806651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:56.806651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u4QqkGSkEodufyn54q/rn5CvJbM8U8K5V69effzlZYVE2It1No+KuoDUI7VM3ZE7tvSfrh+iQZrSmwT/6QIhBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:56.807119Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04754","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5e98f25d1fe34948fb5a0708f7e64e7c39b90577c3c1126d9dea7efe995123a","sha256:a2e0227c2b3ad33f52b7675e2699fb338928c898860cac37b8a139ee1b772bef"],"state_sha256":"31e10f07b648f4e68acf804e90c11953beb26f98cb6062c8c171e22426eb4d57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L+zxAPDQRbtro5xTXvXBti2GKcpE6vlu5zFbeaTt9NQsUjaE1cBDIx8tup8X+1lJYTzc58RX+JEEUag7LrqKDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:57:17.968113Z","bundle_sha256":"54347dadc45051c46a0e1518ae957c4269a65b48dfc3b3ddbf3463085c85e6b6"}}