{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BURPJLWOPNIPXORCPH7IOKVV2O","short_pith_number":"pith:BURPJLWO","canonical_record":{"source":{"id":"1711.07913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-21T17:03:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f903d87475c341eebb88321122db60b1f15c41d3b3d8efd4fa5511cd2adf1fae","abstract_canon_sha256":"1a3e45177f521b5dab9b65a20deeda74b36da09767d073855ba740a16209236e"},"schema_version":"1.0"},"canonical_sha256":"0d22f4aece7b50fbba2279fe872ab5d39acb935e0dd1d43037c9df7c17bbfb4f","source":{"kind":"arxiv","id":"1711.07913","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07913","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07913v1","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07913","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"pith_short_12","alias_value":"BURPJLWOPNIP","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BURPJLWOPNIPXORC","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BURPJLWO","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BURPJLWOPNIPXORCPH7IOKVV2O","target":"record","payload":{"canonical_record":{"source":{"id":"1711.07913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-21T17:03:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f903d87475c341eebb88321122db60b1f15c41d3b3d8efd4fa5511cd2adf1fae","abstract_canon_sha256":"1a3e45177f521b5dab9b65a20deeda74b36da09767d073855ba740a16209236e"},"schema_version":"1.0"},"canonical_sha256":"0d22f4aece7b50fbba2279fe872ab5d39acb935e0dd1d43037c9df7c17bbfb4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:44.623496Z","signature_b64":"ZP23DgMDzZpT1bLWgi+1fYujaJ5UzUlxggNycccwmKq0fTeYdnr5g7WzRvg6tK31f/IF8OWExFQ1h8asB5HMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d22f4aece7b50fbba2279fe872ab5d39acb935e0dd1d43037c9df7c17bbfb4f","last_reissued_at":"2026-05-18T00:16:44.622955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:44.622955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.07913","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-18T00:16:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b1jG4cfNH0BDRxwSMTP3X+UvIEepHQhIb5YqvOqRN1JZg2dluL+ihxfdGj1ReQUzl65OdkaPE9VUECowVPvBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:44:26.575521Z"},"content_sha256":"5661131520df576d4650aeb02e47f26aaa768af35d03d344f937beb300b65d9b","schema_version":"1.0","event_id":"sha256:5661131520df576d4650aeb02e47f26aaa768af35d03d344f937beb300b65d9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BURPJLWOPNIPXORCPH7IOKVV2O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic Close To Optimal Joint Resource Allocation and Power Control in the Uplink of Two-cell Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ata Khalili, Meysam Mirzaee, Soroush Akhlaghi","submitted_at":"2017-11-21T17:03:06Z","abstract_excerpt":"In this paper, we investigate joint resource allocation and power control mechanisms for two-cell networks, where each cell has some sub-channels which should be allocated to some users. The main goal persuaded in the current work is finding the best power and sub-channel assignment strategies so that the associated sum-rate of network is maximized, while a minimum rate constraint is maintained by each user. The underlying optimization problem is a highly non-convex mixed integer and non-linear problem which does not yield a trivial solution. In this regard, to tackle the problem, using an app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07913","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-18T00:16:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V9kN1iTQD7VrUhhCh7nKON+GNAHrp63Ksffpx/nL7TdUXbU7k9BTuYccWaOqEkXvTkyL9xEeaRfyDgU3tI1TBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:44:26.576171Z"},"content_sha256":"9e1672da315cb989d7c0a30f8e84b29a7d2b1da4e27509978d7259650be18f84","schema_version":"1.0","event_id":"sha256:9e1672da315cb989d7c0a30f8e84b29a7d2b1da4e27509978d7259650be18f84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BURPJLWOPNIPXORCPH7IOKVV2O/bundle.json","state_url":"https://pith.science/pith/BURPJLWOPNIPXORCPH7IOKVV2O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BURPJLWOPNIPXORCPH7IOKVV2O/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-29T22:44:26Z","links":{"resolver":"https://pith.science/pith/BURPJLWOPNIPXORCPH7IOKVV2O","bundle":"https://pith.science/pith/BURPJLWOPNIPXORCPH7IOKVV2O/bundle.json","state":"https://pith.science/pith/BURPJLWOPNIPXORCPH7IOKVV2O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BURPJLWOPNIPXORCPH7IOKVV2O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BURPJLWOPNIPXORCPH7IOKVV2O","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":"1a3e45177f521b5dab9b65a20deeda74b36da09767d073855ba740a16209236e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-21T17:03:06Z","title_canon_sha256":"f903d87475c341eebb88321122db60b1f15c41d3b3d8efd4fa5511cd2adf1fae"},"schema_version":"1.0","source":{"id":"1711.07913","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07913","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07913v1","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07913","created_at":"2026-05-18T00:16:44Z"},{"alias_kind":"pith_short_12","alias_value":"BURPJLWOPNIP","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BURPJLWOPNIPXORC","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BURPJLWO","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:9e1672da315cb989d7c0a30f8e84b29a7d2b1da4e27509978d7259650be18f84","target":"graph","created_at":"2026-05-18T00:16:44Z","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 paper, we investigate joint resource allocation and power control mechanisms for two-cell networks, where each cell has some sub-channels which should be allocated to some users. The main goal persuaded in the current work is finding the best power and sub-channel assignment strategies so that the associated sum-rate of network is maximized, while a minimum rate constraint is maintained by each user. The underlying optimization problem is a highly non-convex mixed integer and non-linear problem which does not yield a trivial solution. In this regard, to tackle the problem, using an app","authors_text":"Ata Khalili, Meysam Mirzaee, Soroush Akhlaghi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-21T17:03:06Z","title":"Asymptotic Close To Optimal Joint Resource Allocation and Power Control in the Uplink of Two-cell Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07913","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:5661131520df576d4650aeb02e47f26aaa768af35d03d344f937beb300b65d9b","target":"record","created_at":"2026-05-18T00:16:44Z","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":"1a3e45177f521b5dab9b65a20deeda74b36da09767d073855ba740a16209236e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-21T17:03:06Z","title_canon_sha256":"f903d87475c341eebb88321122db60b1f15c41d3b3d8efd4fa5511cd2adf1fae"},"schema_version":"1.0","source":{"id":"1711.07913","kind":"arxiv","version":1}},"canonical_sha256":"0d22f4aece7b50fbba2279fe872ab5d39acb935e0dd1d43037c9df7c17bbfb4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d22f4aece7b50fbba2279fe872ab5d39acb935e0dd1d43037c9df7c17bbfb4f","first_computed_at":"2026-05-18T00:16:44.622955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:44.622955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZP23DgMDzZpT1bLWgi+1fYujaJ5UzUlxggNycccwmKq0fTeYdnr5g7WzRvg6tK31f/IF8OWExFQ1h8asB5HMBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:44.623496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07913","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5661131520df576d4650aeb02e47f26aaa768af35d03d344f937beb300b65d9b","sha256:9e1672da315cb989d7c0a30f8e84b29a7d2b1da4e27509978d7259650be18f84"],"state_sha256":"495c875b8b8fd63c984f54044d4ea8b0c5fe9c13317c03b4d934eebc0f14de45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TATWISgDNA6VN04SUxjS0ZuwxICnFGnSQZpQ0EfNk9IdVCqN+QkSvDQWnPjkN/0VIYwme28ELPWypJo1K/dbDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:44:26.579630Z","bundle_sha256":"ff53b546c5502f367a24d4e85e3b4654066393b0d084a4c96cc3f93bd504e313"}}