{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:76LFW3JAJCWNLGEQ6LHBIPHR7Z","short_pith_number":"pith:76LFW3JA","canonical_record":{"source":{"id":"1010.2692","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-13T16:14:47Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"39520a8836431046628ccef8dd96743546440cf35356452abd9865947b18bc4f","abstract_canon_sha256":"cff05553c4e810d99c07e7e960598eb7fc8f265f67bb00a5a2ffd5143d1ec72a"},"schema_version":"1.0"},"canonical_sha256":"ff965b6d2048acd59890f2ce143cf1fe6c03fd8a455fa6119d7243126de3d666","source":{"kind":"arxiv","id":"1010.2692","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2692","created_at":"2026-05-18T04:12:42Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2692v5","created_at":"2026-05-18T04:12:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2692","created_at":"2026-05-18T04:12:42Z"},{"alias_kind":"pith_short_12","alias_value":"76LFW3JAJCWN","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"76LFW3JAJCWNLGEQ","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"76LFW3JA","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:76LFW3JAJCWNLGEQ6LHBIPHR7Z","target":"record","payload":{"canonical_record":{"source":{"id":"1010.2692","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-13T16:14:47Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"39520a8836431046628ccef8dd96743546440cf35356452abd9865947b18bc4f","abstract_canon_sha256":"cff05553c4e810d99c07e7e960598eb7fc8f265f67bb00a5a2ffd5143d1ec72a"},"schema_version":"1.0"},"canonical_sha256":"ff965b6d2048acd59890f2ce143cf1fe6c03fd8a455fa6119d7243126de3d666","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:42.960053Z","signature_b64":"qIamAf9aO5TeBxxUNYi8EzQCgIxgw7RyPgFTILZxFfyr951Z4bOQQFPvUjkWszf6QUe7j8jfucpwtiEalj20Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff965b6d2048acd59890f2ce143cf1fe6c03fd8a455fa6119d7243126de3d666","last_reissued_at":"2026-05-18T04:12:42.959287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:42.959287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.2692","source_version":5,"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-18T04:12:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NIFwt9q2AORsFT6+u2EvVUIIJJQQNy8fYfNXGSJugvHBEN6tG/1aEJnWig5Q+JpVmVzYIyKue38Ik+Itr5PECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:56:21.922864Z"},"content_sha256":"45b8cca62b174e62a258992fb637886b8750c61ac292294e09adc379ebda7e8e","schema_version":"1.0","event_id":"sha256:45b8cca62b174e62a258992fb637886b8750c61ac292294e09adc379ebda7e8e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:76LFW3JAJCWNLGEQ6LHBIPHR7Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource Allocation via Sum-Rate Maximization in the Uplink of Multi-Cell OFDMA Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Hina Tabassum, Mohamed Slim Alouini, Zaher Dawy","submitted_at":"2010-10-13T16:14:47Z","abstract_excerpt":"In this paper, we consider maximizing the sum-rate in the uplink of a multi-cell OFDMA network. The problem has a non-convex combinatorial structure and is known to be NP hard. Due to the inherent complexity of implementing the optimal solution, firstly, we derive an upper and lower bound to the optimal average network throughput. Moreover, we investigate the performance of a near optimal single cell resource allocation scheme in the presence of ICI which leads to another easily computable lower bound. We then develop a centralized sub-optimal scheme that is composed of a geometric programming"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2692","kind":"arxiv","version":5},"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-18T04:12:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pfyFEV4znXdR7HD7A0NPHKSwBVGOdOReJVUXY6o93kL4zrhcb06sBOYfTEkemfzqDBiJpqkdN8vNggPjR9r7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:56:21.923538Z"},"content_sha256":"60b371ca8434dd9f2a06f864f284d0f2791d2a4835e6fb735d8cffff9c7250dc","schema_version":"1.0","event_id":"sha256:60b371ca8434dd9f2a06f864f284d0f2791d2a4835e6fb735d8cffff9c7250dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76LFW3JAJCWNLGEQ6LHBIPHR7Z/bundle.json","state_url":"https://pith.science/pith/76LFW3JAJCWNLGEQ6LHBIPHR7Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76LFW3JAJCWNLGEQ6LHBIPHR7Z/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-31T07:56:21Z","links":{"resolver":"https://pith.science/pith/76LFW3JAJCWNLGEQ6LHBIPHR7Z","bundle":"https://pith.science/pith/76LFW3JAJCWNLGEQ6LHBIPHR7Z/bundle.json","state":"https://pith.science/pith/76LFW3JAJCWNLGEQ6LHBIPHR7Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76LFW3JAJCWNLGEQ6LHBIPHR7Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:76LFW3JAJCWNLGEQ6LHBIPHR7Z","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":"cff05553c4e810d99c07e7e960598eb7fc8f265f67bb00a5a2ffd5143d1ec72a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-13T16:14:47Z","title_canon_sha256":"39520a8836431046628ccef8dd96743546440cf35356452abd9865947b18bc4f"},"schema_version":"1.0","source":{"id":"1010.2692","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2692","created_at":"2026-05-18T04:12:42Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2692v5","created_at":"2026-05-18T04:12:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2692","created_at":"2026-05-18T04:12:42Z"},{"alias_kind":"pith_short_12","alias_value":"76LFW3JAJCWN","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"76LFW3JAJCWNLGEQ","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"76LFW3JA","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:60b371ca8434dd9f2a06f864f284d0f2791d2a4835e6fb735d8cffff9c7250dc","target":"graph","created_at":"2026-05-18T04:12:42Z","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 consider maximizing the sum-rate in the uplink of a multi-cell OFDMA network. The problem has a non-convex combinatorial structure and is known to be NP hard. Due to the inherent complexity of implementing the optimal solution, firstly, we derive an upper and lower bound to the optimal average network throughput. Moreover, we investigate the performance of a near optimal single cell resource allocation scheme in the presence of ICI which leads to another easily computable lower bound. We then develop a centralized sub-optimal scheme that is composed of a geometric programming","authors_text":"Hina Tabassum, Mohamed Slim Alouini, Zaher Dawy","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-13T16:14:47Z","title":"Resource Allocation via Sum-Rate Maximization in the Uplink of Multi-Cell OFDMA Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2692","kind":"arxiv","version":5},"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:45b8cca62b174e62a258992fb637886b8750c61ac292294e09adc379ebda7e8e","target":"record","created_at":"2026-05-18T04:12:42Z","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":"cff05553c4e810d99c07e7e960598eb7fc8f265f67bb00a5a2ffd5143d1ec72a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-10-13T16:14:47Z","title_canon_sha256":"39520a8836431046628ccef8dd96743546440cf35356452abd9865947b18bc4f"},"schema_version":"1.0","source":{"id":"1010.2692","kind":"arxiv","version":5}},"canonical_sha256":"ff965b6d2048acd59890f2ce143cf1fe6c03fd8a455fa6119d7243126de3d666","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff965b6d2048acd59890f2ce143cf1fe6c03fd8a455fa6119d7243126de3d666","first_computed_at":"2026-05-18T04:12:42.959287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:42.959287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qIamAf9aO5TeBxxUNYi8EzQCgIxgw7RyPgFTILZxFfyr951Z4bOQQFPvUjkWszf6QUe7j8jfucpwtiEalj20Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:42.960053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.2692","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45b8cca62b174e62a258992fb637886b8750c61ac292294e09adc379ebda7e8e","sha256:60b371ca8434dd9f2a06f864f284d0f2791d2a4835e6fb735d8cffff9c7250dc"],"state_sha256":"6d3f3a558d3547fcdef75f7b4e8b23444e3357d31db8730c9a954b37ed0ea8de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K6p6L4aEDOzar6A+PwLX1Hzn9q8mSJU8MWEky1HadWuA6tn1wpuuwi277E9KwDKXzM/EZ6n1zpQHFEiJmu8tAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:56:21.927110Z","bundle_sha256":"48de39c5b2ed7e1179e82a1b25086423fc806d395737aac26577e3798c0a6f54"}}