{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QMR6ZTS36KTSTBFOFGEG54PL5Q","short_pith_number":"pith:QMR6ZTS3","canonical_record":{"source":{"id":"1209.3416","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-15T15:31:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8c860225700f489f5c81f9dc20d8abab68b5e143ab3b9cd428a93a1ac59634c6","abstract_canon_sha256":"4e817a24fbc04ba9df7328181087958a4a912281edfd3ef8b5e1c2c3c4f7361d"},"schema_version":"1.0"},"canonical_sha256":"8323ecce5bf2a72984ae29886ef1ebec1edc1e3965990c3f43704b0b4ebf4973","source":{"kind":"arxiv","id":"1209.3416","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3416","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3416v1","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3416","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"QMR6ZTS36KTS","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QMR6ZTS36KTSTBFO","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QMR6ZTS3","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QMR6ZTS36KTSTBFOFGEG54PL5Q","target":"record","payload":{"canonical_record":{"source":{"id":"1209.3416","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-15T15:31:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8c860225700f489f5c81f9dc20d8abab68b5e143ab3b9cd428a93a1ac59634c6","abstract_canon_sha256":"4e817a24fbc04ba9df7328181087958a4a912281edfd3ef8b5e1c2c3c4f7361d"},"schema_version":"1.0"},"canonical_sha256":"8323ecce5bf2a72984ae29886ef1ebec1edc1e3965990c3f43704b0b4ebf4973","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:31.040640Z","signature_b64":"xytMujwr5yEx91r5vlax32J7NtApXKJqI2Q6AZZ3FMEybLO+9iDS/9eiR+gnuA3N3NXo5VEeO09qY/MFFcB0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8323ecce5bf2a72984ae29886ef1ebec1edc1e3965990c3f43704b0b4ebf4973","last_reissued_at":"2026-05-18T03:45:31.039713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:31.039713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.3416","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-18T03:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5/IwcIk726jwOp1JUhXX8b3g+SC97Z85i53tl73cqiRPlJwXqL5jTCd2Wy3f7w2J+2aOooKOddR86Xc7k2yjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:09:48.126865Z"},"content_sha256":"5d3fa69f4be3a872b26eab561a3a67339f1b3bcf5a4f214c5a4e05af6164051f","schema_version":"1.0","event_id":"sha256:5d3fa69f4be3a872b26eab561a3a67339f1b3bcf5a4f214c5a4e05af6164051f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QMR6ZTS36KTSTBFOFGEG54PL5Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Resource Allocation Algorithm Design for Multi-Cell Networks Based on Advanced Decomposition Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chengwen Xing, Jingming Kuang, Shuo Li, Yiqing Zhou, Zesong Fei","submitted_at":"2012-09-15T15:31:18Z","abstract_excerpt":"In this letter, we investigate the resource allocation for downlink multi-cell coordinated OFDMA wireless networks, in which power allocation and subcarrier scheduling are jointly optimized. Aiming at maximizing the weighted sum of the minimal user rates (WSMR) of coordinated cells under individual power constraints at each base station, an effective distributed resource allocation algorithm using a modified decomposition method is proposed, which is suitable by practical implementation due to its low complexity and fast convergence speed. Simulation results demonstrate that the proposed decen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3416","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-18T03:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B10gMUjTsZiSf56uH7CgPIemsW6MGkGRoyUMkS2VHKwqZbi8tazKcwxc6QGmH/0m9Ae7hCYl7HoHlaoJ7GFgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:09:48.127248Z"},"content_sha256":"de169488c801ace990afa574596c19154a1dc95821f1f0d13f5558105f90a512","schema_version":"1.0","event_id":"sha256:de169488c801ace990afa574596c19154a1dc95821f1f0d13f5558105f90a512"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMR6ZTS36KTSTBFOFGEG54PL5Q/bundle.json","state_url":"https://pith.science/pith/QMR6ZTS36KTSTBFOFGEG54PL5Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMR6ZTS36KTSTBFOFGEG54PL5Q/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-20T14:09:48Z","links":{"resolver":"https://pith.science/pith/QMR6ZTS36KTSTBFOFGEG54PL5Q","bundle":"https://pith.science/pith/QMR6ZTS36KTSTBFOFGEG54PL5Q/bundle.json","state":"https://pith.science/pith/QMR6ZTS36KTSTBFOFGEG54PL5Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMR6ZTS36KTSTBFOFGEG54PL5Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QMR6ZTS36KTSTBFOFGEG54PL5Q","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":"4e817a24fbc04ba9df7328181087958a4a912281edfd3ef8b5e1c2c3c4f7361d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-15T15:31:18Z","title_canon_sha256":"8c860225700f489f5c81f9dc20d8abab68b5e143ab3b9cd428a93a1ac59634c6"},"schema_version":"1.0","source":{"id":"1209.3416","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3416","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3416v1","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3416","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"QMR6ZTS36KTS","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QMR6ZTS36KTSTBFO","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QMR6ZTS3","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:de169488c801ace990afa574596c19154a1dc95821f1f0d13f5558105f90a512","target":"graph","created_at":"2026-05-18T03:45:31Z","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":"In this letter, we investigate the resource allocation for downlink multi-cell coordinated OFDMA wireless networks, in which power allocation and subcarrier scheduling are jointly optimized. Aiming at maximizing the weighted sum of the minimal user rates (WSMR) of coordinated cells under individual power constraints at each base station, an effective distributed resource allocation algorithm using a modified decomposition method is proposed, which is suitable by practical implementation due to its low complexity and fast convergence speed. Simulation results demonstrate that the proposed decen","authors_text":"Chengwen Xing, Jingming Kuang, Shuo Li, Yiqing Zhou, Zesong Fei","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-15T15:31:18Z","title":"Distributed Resource Allocation Algorithm Design for Multi-Cell Networks Based on Advanced Decomposition Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3416","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:5d3fa69f4be3a872b26eab561a3a67339f1b3bcf5a4f214c5a4e05af6164051f","target":"record","created_at":"2026-05-18T03:45:31Z","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":"4e817a24fbc04ba9df7328181087958a4a912281edfd3ef8b5e1c2c3c4f7361d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-15T15:31:18Z","title_canon_sha256":"8c860225700f489f5c81f9dc20d8abab68b5e143ab3b9cd428a93a1ac59634c6"},"schema_version":"1.0","source":{"id":"1209.3416","kind":"arxiv","version":1}},"canonical_sha256":"8323ecce5bf2a72984ae29886ef1ebec1edc1e3965990c3f43704b0b4ebf4973","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8323ecce5bf2a72984ae29886ef1ebec1edc1e3965990c3f43704b0b4ebf4973","first_computed_at":"2026-05-18T03:45:31.039713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:31.039713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xytMujwr5yEx91r5vlax32J7NtApXKJqI2Q6AZZ3FMEybLO+9iDS/9eiR+gnuA3N3NXo5VEeO09qY/MFFcB0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:31.040640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.3416","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d3fa69f4be3a872b26eab561a3a67339f1b3bcf5a4f214c5a4e05af6164051f","sha256:de169488c801ace990afa574596c19154a1dc95821f1f0d13f5558105f90a512"],"state_sha256":"a8cb8c7caadfb35847b1f0f393cc1309cb4959c2ebeeaddad1994b2e4a0e7252"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IHrY7eQs73Zgqf9aQJVDqdGXjxzZlCpNoQCIzkcMM8e0Rl+UeyHwmqHoDB3Hv4ttphD+qIKFf3d6wVBYoccXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T14:09:48.129183Z","bundle_sha256":"5eb0f1b571d15c1346a99e73cc8e2c0653353dd78a528a02a5f0a0b81ffe2080"}}