{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WVX7VT5Z2ZTVRVD4OTSVZC4VGQ","short_pith_number":"pith:WVX7VT5Z","canonical_record":{"source":{"id":"1803.07772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-21T07:17:51Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a4193b5e9fa4b739983051a3d46f73b790e2bbceca2f90765a764b5ff0926e76","abstract_canon_sha256":"927f13c20def2b44ce7042deefa6ecc75f8487645c24118c5408f66f7cdddd14"},"schema_version":"1.0"},"canonical_sha256":"b56ffacfb9d66758d47c74e55c8b95343197cac2e2441a0f9417fc4ac2876235","source":{"kind":"arxiv","id":"1803.07772","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07772","created_at":"2026-05-18T00:20:29Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07772v1","created_at":"2026-05-18T00:20:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07772","created_at":"2026-05-18T00:20:29Z"},{"alias_kind":"pith_short_12","alias_value":"WVX7VT5Z2ZTV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WVX7VT5Z2ZTVRVD4","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WVX7VT5Z","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WVX7VT5Z2ZTVRVD4OTSVZC4VGQ","target":"record","payload":{"canonical_record":{"source":{"id":"1803.07772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-21T07:17:51Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a4193b5e9fa4b739983051a3d46f73b790e2bbceca2f90765a764b5ff0926e76","abstract_canon_sha256":"927f13c20def2b44ce7042deefa6ecc75f8487645c24118c5408f66f7cdddd14"},"schema_version":"1.0"},"canonical_sha256":"b56ffacfb9d66758d47c74e55c8b95343197cac2e2441a0f9417fc4ac2876235","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:29.013949Z","signature_b64":"00CW64IEMDfFnqX58Pcuc1V/D5g+kTcIIT3Zp/fTpIUCeA3O0tFQiEn3yrUNXuESapT5P73YC/vkTvLeRJIWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b56ffacfb9d66758d47c74e55c8b95343197cac2e2441a0f9417fc4ac2876235","last_reissued_at":"2026-05-18T00:20:29.013340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:29.013340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.07772","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:20:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l/pyyr95GbcKYDE0pE55/Oltn7yIjhu0IG/Av4xPioyPDfFKR9IPjy2V/CBbKopWwfBeXRMBdCPR/NXe0D3yBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:26:59.764930Z"},"content_sha256":"b254f9a31213a4e6c2e9636f75d844ed944ec688ae7586b221e94f36c221cf8b","schema_version":"1.0","event_id":"sha256:b254f9a31213a4e6c2e9636f75d844ed944ec688ae7586b221e94f36c221cf8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WVX7VT5Z2ZTVRVD4OTSVZC4VGQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cross-Layer Energy Efficient Resource Allocation in PD-NOMA based H-CRANs: Implementation via GPU","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Ali Mokdad, Mohammad Moltafet, Mohsen Ghaffari-Miab, Nader Mokari, Paeiz Azmi","submitted_at":"2018-03-21T07:17:51Z","abstract_excerpt":"In this paper, we propose a cross layer energy efficient resource allocation and remote radio head (RRH) selection algorithm for heterogeneous traffic in power domain - non-orthogonal multiple access (PD-NOMA) based heterogeneous cloud radio access networks (H-CRANs). The main aim is to maximize the EE of the elastic users subject to the average delay constraint of the streaming users and the constraints, RRH selection, subcarrier, transmit power and successive interference cancellation. The considered optimization problem is non-convex, NP-hard and intractable. To solve this problem, we trans"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07772","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:20:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zmSHoZ1Rrbn4SymTkzN+fowKgI7TEIqPAWbpxOQTA2PJjJPvpXuOgvTaBKajoDDkJ5pIkoJb1I9c8t1e3whkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:26:59.765721Z"},"content_sha256":"3f6647b2dd4e387929a0f356932512a4c8d0177aba4621636f57282425346d5d","schema_version":"1.0","event_id":"sha256:3f6647b2dd4e387929a0f356932512a4c8d0177aba4621636f57282425346d5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WVX7VT5Z2ZTVRVD4OTSVZC4VGQ/bundle.json","state_url":"https://pith.science/pith/WVX7VT5Z2ZTVRVD4OTSVZC4VGQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WVX7VT5Z2ZTVRVD4OTSVZC4VGQ/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-25T09:26:59Z","links":{"resolver":"https://pith.science/pith/WVX7VT5Z2ZTVRVD4OTSVZC4VGQ","bundle":"https://pith.science/pith/WVX7VT5Z2ZTVRVD4OTSVZC4VGQ/bundle.json","state":"https://pith.science/pith/WVX7VT5Z2ZTVRVD4OTSVZC4VGQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WVX7VT5Z2ZTVRVD4OTSVZC4VGQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WVX7VT5Z2ZTVRVD4OTSVZC4VGQ","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":"927f13c20def2b44ce7042deefa6ecc75f8487645c24118c5408f66f7cdddd14","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-21T07:17:51Z","title_canon_sha256":"a4193b5e9fa4b739983051a3d46f73b790e2bbceca2f90765a764b5ff0926e76"},"schema_version":"1.0","source":{"id":"1803.07772","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.07772","created_at":"2026-05-18T00:20:29Z"},{"alias_kind":"arxiv_version","alias_value":"1803.07772v1","created_at":"2026-05-18T00:20:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07772","created_at":"2026-05-18T00:20:29Z"},{"alias_kind":"pith_short_12","alias_value":"WVX7VT5Z2ZTV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WVX7VT5Z2ZTVRVD4","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WVX7VT5Z","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:3f6647b2dd4e387929a0f356932512a4c8d0177aba4621636f57282425346d5d","target":"graph","created_at":"2026-05-18T00:20:29Z","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 propose a cross layer energy efficient resource allocation and remote radio head (RRH) selection algorithm for heterogeneous traffic in power domain - non-orthogonal multiple access (PD-NOMA) based heterogeneous cloud radio access networks (H-CRANs). The main aim is to maximize the EE of the elastic users subject to the average delay constraint of the streaming users and the constraints, RRH selection, subcarrier, transmit power and successive interference cancellation. The considered optimization problem is non-convex, NP-hard and intractable. To solve this problem, we trans","authors_text":"Ali Mokdad, Mohammad Moltafet, Mohsen Ghaffari-Miab, Nader Mokari, Paeiz Azmi","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-21T07:17:51Z","title":"Cross-Layer Energy Efficient Resource Allocation in PD-NOMA based H-CRANs: Implementation via GPU"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07772","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:b254f9a31213a4e6c2e9636f75d844ed944ec688ae7586b221e94f36c221cf8b","target":"record","created_at":"2026-05-18T00:20:29Z","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":"927f13c20def2b44ce7042deefa6ecc75f8487645c24118c5408f66f7cdddd14","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-03-21T07:17:51Z","title_canon_sha256":"a4193b5e9fa4b739983051a3d46f73b790e2bbceca2f90765a764b5ff0926e76"},"schema_version":"1.0","source":{"id":"1803.07772","kind":"arxiv","version":1}},"canonical_sha256":"b56ffacfb9d66758d47c74e55c8b95343197cac2e2441a0f9417fc4ac2876235","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b56ffacfb9d66758d47c74e55c8b95343197cac2e2441a0f9417fc4ac2876235","first_computed_at":"2026-05-18T00:20:29.013340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:29.013340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"00CW64IEMDfFnqX58Pcuc1V/D5g+kTcIIT3Zp/fTpIUCeA3O0tFQiEn3yrUNXuESapT5P73YC/vkTvLeRJIWBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:29.013949Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.07772","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b254f9a31213a4e6c2e9636f75d844ed944ec688ae7586b221e94f36c221cf8b","sha256:3f6647b2dd4e387929a0f356932512a4c8d0177aba4621636f57282425346d5d"],"state_sha256":"4dbfc05f34663c77a715ed220fc0966e77b130647f9abec85701c4f8b6898312"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nz4H6LURMTKOHWbbEaMCsjWXtnijcyD5Pw9n8yrZG+55eAjRhIBwAFXDUFL1G1gdivb6N1H9a4Q1ijPWLyvwAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T09:26:59.769254Z","bundle_sha256":"d2963f09c126e1f1d429eb3387a723cca245224a84db4cd5bd166b4336cfa398"}}