{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WMO7CX4SIGS2Y2AABMLSMY6PWB","short_pith_number":"pith:WMO7CX4S","canonical_record":{"source":{"id":"1801.05353","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-01-12T17:09:39Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"1447e5edbe90ba9ad3de0d1b2382e4bfa50f29bd41afd01fe4258491db7b82dd","abstract_canon_sha256":"a1ad327de7f9260c7d0a9094a0fadd917769da24fcd805d5c7f64080295a75d9"},"schema_version":"1.0"},"canonical_sha256":"b31df15f9241a5ac68000b172663cfb0463a5353a3d9afca19ad2ac025194c94","source":{"kind":"arxiv","id":"1801.05353","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05353","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05353v2","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05353","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"pith_short_12","alias_value":"WMO7CX4SIGS2","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WMO7CX4SIGS2Y2AA","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WMO7CX4S","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WMO7CX4SIGS2Y2AABMLSMY6PWB","target":"record","payload":{"canonical_record":{"source":{"id":"1801.05353","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-01-12T17:09:39Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"1447e5edbe90ba9ad3de0d1b2382e4bfa50f29bd41afd01fe4258491db7b82dd","abstract_canon_sha256":"a1ad327de7f9260c7d0a9094a0fadd917769da24fcd805d5c7f64080295a75d9"},"schema_version":"1.0"},"canonical_sha256":"b31df15f9241a5ac68000b172663cfb0463a5353a3d9afca19ad2ac025194c94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:28.326008Z","signature_b64":"1KaeS7T3uhug5+rdo6Cm09srDgTp0IHbI5W9CkDhOZnF2QiH/+nDfcNXOtZcDMEqx+o61Ejj0ZoYPm0722DsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b31df15f9241a5ac68000b172663cfb0463a5353a3d9afca19ad2ac025194c94","last_reissued_at":"2026-05-17T23:54:28.325480Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:28.325480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.05353","source_version":2,"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-17T23:54:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xme5vmHudE9h4KCZpOZTSvslJRGrgvb15Z+qtZGCosI4JuVdDZhDAMHQBkQMSBt/8ANXKykuB4RP4etTYaY5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:51:30.846089Z"},"content_sha256":"3f250adf3c59bf945ec83b2037f752d3a71a9b766e8bd3e603bf864a4be1ea1d","schema_version":"1.0","event_id":"sha256:3f250adf3c59bf945ec83b2037f752d3a71a9b766e8bd3e603bf864a4be1ea1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WMO7CX4SIGS2Y2AABMLSMY6PWB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy-Efficient Power Loading for OFDM-based Cognitive Radio Systems with Channel Uncertainties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Ebrahim Bedeer, Kareem E. Baddour, Mohamed H. Ahmed, Octavia A. Dobre, Osama Amin","submitted_at":"2018-01-12T17:09:39Z","abstract_excerpt":"In this paper, we propose a novel algorithm to optimize the energy-efficiency (EE) of orthogonal frequency division multiplexing-based cognitive radio systems under channel uncertainties. We formulate an optimization problem that guarantees a minimum required rate and a specified power budget for the secondary user (SU), while restricting the interference to primary users (PUs) in a statistical manner. The optimization problem is non-convex and it is transformed to an equivalent problem using the concept of fractional programming. Unlike all related works in the literature, we consider the eff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05353","kind":"arxiv","version":2},"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-17T23:54:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UcaimRKJsjqridWKsqxAO9dPvC21sIjz7+sdPfLU7j9VfDPRm14Xi0NqKR39OrfolClwnK8OkPMEI4mKSpB7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:51:30.847079Z"},"content_sha256":"6588f9287fce4614b4e671ccd83140a1cec8c045e3b732a1067aa1773751328c","schema_version":"1.0","event_id":"sha256:6588f9287fce4614b4e671ccd83140a1cec8c045e3b732a1067aa1773751328c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WMO7CX4SIGS2Y2AABMLSMY6PWB/bundle.json","state_url":"https://pith.science/pith/WMO7CX4SIGS2Y2AABMLSMY6PWB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WMO7CX4SIGS2Y2AABMLSMY6PWB/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-31T20:51:30Z","links":{"resolver":"https://pith.science/pith/WMO7CX4SIGS2Y2AABMLSMY6PWB","bundle":"https://pith.science/pith/WMO7CX4SIGS2Y2AABMLSMY6PWB/bundle.json","state":"https://pith.science/pith/WMO7CX4SIGS2Y2AABMLSMY6PWB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WMO7CX4SIGS2Y2AABMLSMY6PWB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WMO7CX4SIGS2Y2AABMLSMY6PWB","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":"a1ad327de7f9260c7d0a9094a0fadd917769da24fcd805d5c7f64080295a75d9","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-01-12T17:09:39Z","title_canon_sha256":"1447e5edbe90ba9ad3de0d1b2382e4bfa50f29bd41afd01fe4258491db7b82dd"},"schema_version":"1.0","source":{"id":"1801.05353","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05353","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05353v2","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05353","created_at":"2026-05-17T23:54:28Z"},{"alias_kind":"pith_short_12","alias_value":"WMO7CX4SIGS2","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WMO7CX4SIGS2Y2AA","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WMO7CX4S","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:6588f9287fce4614b4e671ccd83140a1cec8c045e3b732a1067aa1773751328c","target":"graph","created_at":"2026-05-17T23:54:28Z","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 novel algorithm to optimize the energy-efficiency (EE) of orthogonal frequency division multiplexing-based cognitive radio systems under channel uncertainties. We formulate an optimization problem that guarantees a minimum required rate and a specified power budget for the secondary user (SU), while restricting the interference to primary users (PUs) in a statistical manner. The optimization problem is non-convex and it is transformed to an equivalent problem using the concept of fractional programming. Unlike all related works in the literature, we consider the eff","authors_text":"Ebrahim Bedeer, Kareem E. Baddour, Mohamed H. Ahmed, Octavia A. Dobre, Osama Amin","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-01-12T17:09:39Z","title":"Energy-Efficient Power Loading for OFDM-based Cognitive Radio Systems with Channel Uncertainties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05353","kind":"arxiv","version":2},"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:3f250adf3c59bf945ec83b2037f752d3a71a9b766e8bd3e603bf864a4be1ea1d","target":"record","created_at":"2026-05-17T23:54:28Z","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":"a1ad327de7f9260c7d0a9094a0fadd917769da24fcd805d5c7f64080295a75d9","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-01-12T17:09:39Z","title_canon_sha256":"1447e5edbe90ba9ad3de0d1b2382e4bfa50f29bd41afd01fe4258491db7b82dd"},"schema_version":"1.0","source":{"id":"1801.05353","kind":"arxiv","version":2}},"canonical_sha256":"b31df15f9241a5ac68000b172663cfb0463a5353a3d9afca19ad2ac025194c94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b31df15f9241a5ac68000b172663cfb0463a5353a3d9afca19ad2ac025194c94","first_computed_at":"2026-05-17T23:54:28.325480Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:28.325480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1KaeS7T3uhug5+rdo6Cm09srDgTp0IHbI5W9CkDhOZnF2QiH/+nDfcNXOtZcDMEqx+o61Ejj0ZoYPm0722DsBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:28.326008Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.05353","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f250adf3c59bf945ec83b2037f752d3a71a9b766e8bd3e603bf864a4be1ea1d","sha256:6588f9287fce4614b4e671ccd83140a1cec8c045e3b732a1067aa1773751328c"],"state_sha256":"93a90f117c961e640be382f97d74fd98833a938b52dbaf86281d4d68ce20122f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NWm1fAwtQo4Kv0GHQ/5LXobL4K8wbMWW4wMG4nY1XdXvj8vLO73bcmqmtlvGqKRYlR5wGI3pf6c0zn1tQzdSAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:51:30.851230Z","bundle_sha256":"d5c0edd943a2756b1763696437605507ae7c25249515c5109c1c709c54224af5"}}