{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OX65PWP2ICR3BQXKJ4UT4V3KCA","short_pith_number":"pith:OX65PWP2","canonical_record":{"source":{"id":"1602.07255","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-23T18:21:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"347228b3095ffe2b78158245cccef77c6d84ddaea7a5fa8dcb4eccf2bb50ed41","abstract_canon_sha256":"111c8480fa4d625a727be7ce5b96f9c7e7f721607c2a7f15d30d545ba5779b08"},"schema_version":"1.0"},"canonical_sha256":"75fdd7d9fa40a3b0c2ea4f293e576a101ca2ad2aa3b2cdbfae0980216a0f7e1e","source":{"kind":"arxiv","id":"1602.07255","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07255","created_at":"2026-05-18T00:41:51Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07255v4","created_at":"2026-05-18T00:41:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07255","created_at":"2026-05-18T00:41:51Z"},{"alias_kind":"pith_short_12","alias_value":"OX65PWP2ICR3","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OX65PWP2ICR3BQXK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OX65PWP2","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OX65PWP2ICR3BQXKJ4UT4V3KCA","target":"record","payload":{"canonical_record":{"source":{"id":"1602.07255","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-23T18:21:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"347228b3095ffe2b78158245cccef77c6d84ddaea7a5fa8dcb4eccf2bb50ed41","abstract_canon_sha256":"111c8480fa4d625a727be7ce5b96f9c7e7f721607c2a7f15d30d545ba5779b08"},"schema_version":"1.0"},"canonical_sha256":"75fdd7d9fa40a3b0c2ea4f293e576a101ca2ad2aa3b2cdbfae0980216a0f7e1e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:51.486649Z","signature_b64":"7UDoWviTsugqkRuHXlOOS6eFlopcSQBJ0F7Vw0io79ybqCO7FzX5xDG4uM3vabIa+ZH2I7YgRvKoLXlX4sjXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75fdd7d9fa40a3b0c2ea4f293e576a101ca2ad2aa3b2cdbfae0980216a0f7e1e","last_reissued_at":"2026-05-18T00:41:51.486038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:51.486038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.07255","source_version":4,"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-18T00:41:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UlEjpATfknF9zEOA8/Nks3ENKpecp8X08lOnmi/wgU3eeBTQfRDxt0VNps4j9OOa5L78TbhPesP5NZZ7BjCwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:31:41.131135Z"},"content_sha256":"12249dc8ca7cbe29783070edff178bc6e5267edfd196352cf56f0395fad57858","schema_version":"1.0","event_id":"sha256:12249dc8ca7cbe29783070edff178bc6e5267edfd196352cf56f0395fad57858"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OX65PWP2ICR3BQXKJ4UT4V3KCA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Load Optimization with User Association in Cooperative and Load-Coupled LTE Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Di Yuan, Lei You","submitted_at":"2016-02-23T18:21:06Z","abstract_excerpt":"We extend the problem of optimizing user association for load balancing in cellular networks along two dimensions. First, we consider joint transmission (JT), which is one of the coordinated multipoint (CoMP) techniques, with which a user may be simultaneously served by multiple base stations. Second, we account for, mathematically, the coupling relation between the base stations' load levels that are dependent on each other due to inter-cell interference. We formulate two optimization problems, sum load minimization (MinSumL) and maximum load minimization (MinMaxL). We prove that both MinSumL"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07255","kind":"arxiv","version":4},"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-18T00:41:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0nrUzTgOP031R7pYlLPPtX8tft1Ua6dTK9gQlWF6xMsiEBEWWRe1JBR6rkjntSmYmucsOqO1/8zcGXr8Hs7rDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:31:41.131780Z"},"content_sha256":"3f871c8e216c4d820fa4b400f6a815b32979691894dfa78fe8859f96a4e3741d","schema_version":"1.0","event_id":"sha256:3f871c8e216c4d820fa4b400f6a815b32979691894dfa78fe8859f96a4e3741d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OX65PWP2ICR3BQXKJ4UT4V3KCA/bundle.json","state_url":"https://pith.science/pith/OX65PWP2ICR3BQXKJ4UT4V3KCA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OX65PWP2ICR3BQXKJ4UT4V3KCA/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-04T08:31:41Z","links":{"resolver":"https://pith.science/pith/OX65PWP2ICR3BQXKJ4UT4V3KCA","bundle":"https://pith.science/pith/OX65PWP2ICR3BQXKJ4UT4V3KCA/bundle.json","state":"https://pith.science/pith/OX65PWP2ICR3BQXKJ4UT4V3KCA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OX65PWP2ICR3BQXKJ4UT4V3KCA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OX65PWP2ICR3BQXKJ4UT4V3KCA","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":"111c8480fa4d625a727be7ce5b96f9c7e7f721607c2a7f15d30d545ba5779b08","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-23T18:21:06Z","title_canon_sha256":"347228b3095ffe2b78158245cccef77c6d84ddaea7a5fa8dcb4eccf2bb50ed41"},"schema_version":"1.0","source":{"id":"1602.07255","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07255","created_at":"2026-05-18T00:41:51Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07255v4","created_at":"2026-05-18T00:41:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07255","created_at":"2026-05-18T00:41:51Z"},{"alias_kind":"pith_short_12","alias_value":"OX65PWP2ICR3","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OX65PWP2ICR3BQXK","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OX65PWP2","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:3f871c8e216c4d820fa4b400f6a815b32979691894dfa78fe8859f96a4e3741d","target":"graph","created_at":"2026-05-18T00:41: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 extend the problem of optimizing user association for load balancing in cellular networks along two dimensions. First, we consider joint transmission (JT), which is one of the coordinated multipoint (CoMP) techniques, with which a user may be simultaneously served by multiple base stations. Second, we account for, mathematically, the coupling relation between the base stations' load levels that are dependent on each other due to inter-cell interference. We formulate two optimization problems, sum load minimization (MinSumL) and maximum load minimization (MinMaxL). We prove that both MinSumL","authors_text":"Di Yuan, Lei You","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-23T18:21:06Z","title":"Load Optimization with User Association in Cooperative and Load-Coupled LTE Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07255","kind":"arxiv","version":4},"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:12249dc8ca7cbe29783070edff178bc6e5267edfd196352cf56f0395fad57858","target":"record","created_at":"2026-05-18T00:41: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":"111c8480fa4d625a727be7ce5b96f9c7e7f721607c2a7f15d30d545ba5779b08","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-23T18:21:06Z","title_canon_sha256":"347228b3095ffe2b78158245cccef77c6d84ddaea7a5fa8dcb4eccf2bb50ed41"},"schema_version":"1.0","source":{"id":"1602.07255","kind":"arxiv","version":4}},"canonical_sha256":"75fdd7d9fa40a3b0c2ea4f293e576a101ca2ad2aa3b2cdbfae0980216a0f7e1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75fdd7d9fa40a3b0c2ea4f293e576a101ca2ad2aa3b2cdbfae0980216a0f7e1e","first_computed_at":"2026-05-18T00:41:51.486038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:51.486038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7UDoWviTsugqkRuHXlOOS6eFlopcSQBJ0F7Vw0io79ybqCO7FzX5xDG4uM3vabIa+ZH2I7YgRvKoLXlX4sjXAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:51.486649Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07255","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12249dc8ca7cbe29783070edff178bc6e5267edfd196352cf56f0395fad57858","sha256:3f871c8e216c4d820fa4b400f6a815b32979691894dfa78fe8859f96a4e3741d"],"state_sha256":"d81a3da3f4a55a502baa396019d56a8784e2cd8056f97f6a9412367d3fe4a33f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SunpQ2/tbOlOxGPl58DtQkpOYU/do8Ap5Vdn2BYKeO/jxPoW/tCqsUHZckUe1Ck9HOMvs0oAv5XhogWJegigDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T08:31:41.134960Z","bundle_sha256":"157965832bd1474d99319705316281cd6f7c34ef252b95db035d75639600f040"}}