{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:R3LRQY6CMT5P3YX5RCCQE6LVN7","short_pith_number":"pith:R3LRQY6C","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"},"canonical_sha256":"8ed71863c264fafde2fd88850279756fed67e7c9dd15f31a4a0e6ef45d45e0de","source":{"kind":"arxiv","id":"1808.00268","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.00268","created_at":"2026-05-18T00:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"1808.00268v1","created_at":"2026-05-18T00:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00268","created_at":"2026-05-18T00:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"R3LRQY6CMT5P","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R3LRQY6CMT5P3YX5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R3LRQY6C","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:R3LRQY6CMT5P3YX5RCCQE6LVN7","target":"record","payload":{"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"},"canonical_sha256":"8ed71863c264fafde2fd88850279756fed67e7c9dd15f31a4a0e6ef45d45e0de","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"},"source_kind":"arxiv","source_id":"1808.00268","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:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yYfSZ07nhfAONbq/HIdVCtl8xcExHU3YvGPVtbpvhItF5qTWRXInyBeCNTpKc+jZDb3eVkQFuwVz6gUkfNosDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:50:32.127772Z"},"content_sha256":"487251de518b6e299945ddf1764bb563c70f6df6d4536170ddd2943cbbc6fee8","schema_version":"1.0","event_id":"sha256:487251de518b6e299945ddf1764bb563c70f6df6d4536170ddd2943cbbc6fee8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:R3LRQY6CMT5P3YX5RCCQE6LVN7","target":"graph","payload":{"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"},"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:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HFbMfnpdBqBjmZ3bsaS+lBQZ5bNCsOBH1rr40qNk4RmnTqcwZo90qxJoO9rXJyPkhQbo/GHDacwI6SJzypKrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:50:32.128167Z"},"content_sha256":"177b43d778703ff13e2bcfdee685e42ba6890ae5c0c16cda4d981a0a99f65bb5","schema_version":"1.0","event_id":"sha256:177b43d778703ff13e2bcfdee685e42ba6890ae5c0c16cda4d981a0a99f65bb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3LRQY6CMT5P3YX5RCCQE6LVN7/bundle.json","state_url":"https://pith.science/pith/R3LRQY6CMT5P3YX5RCCQE6LVN7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3LRQY6CMT5P3YX5RCCQE6LVN7/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-06-04T21:50:32Z","links":{"resolver":"https://pith.science/pith/R3LRQY6CMT5P3YX5RCCQE6LVN7","bundle":"https://pith.science/pith/R3LRQY6CMT5P3YX5RCCQE6LVN7/bundle.json","state":"https://pith.science/pith/R3LRQY6CMT5P3YX5RCCQE6LVN7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3LRQY6CMT5P3YX5RCCQE6LVN7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R3LRQY6CMT5P3YX5RCCQE6LVN7","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":"dec19367def19dea437311865b6b932765709cd36659a7f7524a40d1e32e6535","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-01T11:14:06Z","title_canon_sha256":"eef987cc0412c659f2035575cb410aec2f62e2e9108f36857593a3a0e55489e8"},"schema_version":"1.0","source":{"id":"1808.00268","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.00268","created_at":"2026-05-18T00:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"1808.00268v1","created_at":"2026-05-18T00:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00268","created_at":"2026-05-18T00:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"R3LRQY6CMT5P","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R3LRQY6CMT5P3YX5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R3LRQY6C","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:177b43d778703ff13e2bcfdee685e42ba6890ae5c0c16cda4d981a0a99f65bb5","target":"graph","created_at":"2026-05-18T00:09:06Z","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":"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","authors_text":"Alessandro Biason, Karim G. Seddik, Mariam M.N. Aboelwafa, Michele Zorzi, Mohamed A. Abd-Elmagid, Tamer ElBatt","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-01T11:14:06Z","title":"Towards Optimal Resource Allocation in Wireless Powered Communication Networks with Non-Orthogonal Multiple Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00268","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:487251de518b6e299945ddf1764bb563c70f6df6d4536170ddd2943cbbc6fee8","target":"record","created_at":"2026-05-18T00:09:06Z","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":"dec19367def19dea437311865b6b932765709cd36659a7f7524a40d1e32e6535","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-01T11:14:06Z","title_canon_sha256":"eef987cc0412c659f2035575cb410aec2f62e2e9108f36857593a3a0e55489e8"},"schema_version":"1.0","source":{"id":"1808.00268","kind":"arxiv","version":1}},"canonical_sha256":"8ed71863c264fafde2fd88850279756fed67e7c9dd15f31a4a0e6ef45d45e0de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ed71863c264fafde2fd88850279756fed67e7c9dd15f31a4a0e6ef45d45e0de","first_computed_at":"2026-05-18T00:09:06.646324Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:06.646324Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X2gEHGlS7P7H3ZflCpI840A7aUFuTf5sw6aQ7a4hvRlkqP/w9l7ithyQpmSLzL8VWTq5pupHfuCnSzrShKi8BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:06.646847Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.00268","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:487251de518b6e299945ddf1764bb563c70f6df6d4536170ddd2943cbbc6fee8","sha256:177b43d778703ff13e2bcfdee685e42ba6890ae5c0c16cda4d981a0a99f65bb5"],"state_sha256":"0c47c955dc1d173946f3d9461363491b90f166d2f168d595180a3bc4d5285aeb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ASSuGpr46Ys04BVyQlriqDwQ8sB/9gYS0Uk8wwfYr7oY8HKML6ck4aVnOsjBrFaUHsjBi/03UIyBw8V+IoL3AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:50:32.130281Z","bundle_sha256":"a3d3ab3f7cebb893ca9f4bcc381f61a5b4e8fb269916e24706a15fff7e27842d"}}