{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:R3LRQY6CMT5P3YX5RCCQE6LVN7","short_pith_number":"pith:R3LRQY6C","schema_version":"1.0","canonical_sha256":"8ed71863c264fafde2fd88850279756fed67e7c9dd15f31a4a0e6ef45d45e0de","source":{"kind":"arxiv","id":"1808.00268","version":1},"attestation_state":"computed","paper":{"title":"Towards Optimal Resource Allocation in Wireless Powered Communication Networks with Non-Orthogonal Multiple Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Alessandro Biason, Karim G. Seddik, Mariam M.N. Aboelwafa, Michele Zorzi, Mohamed A. Abd-Elmagid, Tamer ElBatt","submitted_at":"2018-08-01T11:14:06Z","abstract_excerpt":"The optimal allocation of time and energy resources is characterized in a Wireless Powered Communication Network (WPCN) with non-Orthogonal Multiple Access (NOMA). We consider two different formulations; in the first one (max-sum), the sum-throughput of all users is maximized. In the second one (max-min), and targeting fairness among users, we consider maximizing the min-throughput of all users. Under the above two formulations, two NOMA decoding schemes are studied, namely, low complexity decoding (LCD) and successive interference cancellation decoding (SICD). Due to the non-convexity of thre"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1808.00268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-01T11:14:06Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"eef987cc0412c659f2035575cb410aec2f62e2e9108f36857593a3a0e55489e8","abstract_canon_sha256":"dec19367def19dea437311865b6b932765709cd36659a7f7524a40d1e32e6535"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:06.646847Z","signature_b64":"X2gEHGlS7P7H3ZflCpI840A7aUFuTf5sw6aQ7a4hvRlkqP/w9l7ithyQpmSLzL8VWTq5pupHfuCnSzrShKi8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ed71863c264fafde2fd88850279756fed67e7c9dd15f31a4a0e6ef45d45e0de","last_reissued_at":"2026-05-18T00:09:06.646324Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:06.646324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Optimal Resource Allocation in Wireless Powered Communication Networks with Non-Orthogonal Multiple Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Alessandro Biason, Karim G. Seddik, Mariam M.N. Aboelwafa, Michele Zorzi, Mohamed A. Abd-Elmagid, Tamer ElBatt","submitted_at":"2018-08-01T11:14:06Z","abstract_excerpt":"The optimal allocation of time and energy resources is characterized in a Wireless Powered Communication Network (WPCN) with non-Orthogonal Multiple Access (NOMA). We consider two different formulations; in the first one (max-sum), the sum-throughput of all users is maximized. In the second one (max-min), and targeting fairness among users, we consider maximizing the min-throughput of all users. Under the above two formulations, two NOMA decoding schemes are studied, namely, low complexity decoding (LCD) and successive interference cancellation decoding (SICD). Due to the non-convexity of thre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00268","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.00268","created_at":"2026-05-18T00:09:06.646416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.00268v1","created_at":"2026-05-18T00:09:06.646416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00268","created_at":"2026-05-18T00:09:06.646416+00:00"},{"alias_kind":"pith_short_12","alias_value":"R3LRQY6CMT5P","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"R3LRQY6CMT5P3YX5","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"R3LRQY6C","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R3LRQY6CMT5P3YX5RCCQE6LVN7","json":"https://pith.science/pith/R3LRQY6CMT5P3YX5RCCQE6LVN7.json","graph_json":"https://pith.science/api/pith-number/R3LRQY6CMT5P3YX5RCCQE6LVN7/graph.json","events_json":"https://pith.science/api/pith-number/R3LRQY6CMT5P3YX5RCCQE6LVN7/events.json","paper":"https://pith.science/paper/R3LRQY6C"},"agent_actions":{"view_html":"https://pith.science/pith/R3LRQY6CMT5P3YX5RCCQE6LVN7","download_json":"https://pith.science/pith/R3LRQY6CMT5P3YX5RCCQE6LVN7.json","view_paper":"https://pith.science/paper/R3LRQY6C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.00268&json=true","fetch_graph":"https://pith.science/api/pith-number/R3LRQY6CMT5P3YX5RCCQE6LVN7/graph.json","fetch_events":"https://pith.science/api/pith-number/R3LRQY6CMT5P3YX5RCCQE6LVN7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R3LRQY6CMT5P3YX5RCCQE6LVN7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R3LRQY6CMT5P3YX5RCCQE6LVN7/action/storage_attestation","attest_author":"https://pith.science/pith/R3LRQY6CMT5P3YX5RCCQE6LVN7/action/author_attestation","sign_citation":"https://pith.science/pith/R3LRQY6CMT5P3YX5RCCQE6LVN7/action/citation_signature","submit_replication":"https://pith.science/pith/R3LRQY6CMT5P3YX5RCCQE6LVN7/action/replication_record"}},"created_at":"2026-05-18T00:09:06.646416+00:00","updated_at":"2026-05-18T00:09:06.646416+00:00"}