{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ANYC55SGRNBHZYAQJ7A5RU34F7","short_pith_number":"pith:ANYC55SG","canonical_record":{"source":{"id":"1511.01291","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-04T11:13:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1d2ac38435a3a96169cfc376608199c376b9c71b360553d2c3d1cf3973465223","abstract_canon_sha256":"3b830f116d0aa0e2a88475ef7b520edfbc828966f852b380393181a757a5081d"},"schema_version":"1.0"},"canonical_sha256":"03702ef6468b427ce0104fc1d8d37c2fd0c5e10bd6f5a309dd979e962e689c73","source":{"kind":"arxiv","id":"1511.01291","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01291","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01291v2","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01291","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"ANYC55SGRNBH","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"ANYC55SGRNBHZYAQ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"ANYC55SG","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ANYC55SGRNBHZYAQJ7A5RU34F7","target":"record","payload":{"canonical_record":{"source":{"id":"1511.01291","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-04T11:13:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1d2ac38435a3a96169cfc376608199c376b9c71b360553d2c3d1cf3973465223","abstract_canon_sha256":"3b830f116d0aa0e2a88475ef7b520edfbc828966f852b380393181a757a5081d"},"schema_version":"1.0"},"canonical_sha256":"03702ef6468b427ce0104fc1d8d37c2fd0c5e10bd6f5a309dd979e962e689c73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:10.139956Z","signature_b64":"lm0duAtummTLDrHaqLgmKkFZ3ropOMCGFFg7epTExalpf4QInTlLkVt3kPxWUpvA5LkdZBcnNF4CtCi4VGizBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03702ef6468b427ce0104fc1d8d37c2fd0c5e10bd6f5a309dd979e962e689c73","last_reissued_at":"2026-05-18T00:58:10.139154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:10.139154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.01291","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-18T00:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+XT4owxD65J92N2yZyz5arRbFWZmZrsgMHdcrMTy1qhSHg+fLYkNfnQ+ggd9LnV71rAabklB3mY7l1IbxVcKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T09:23:22.928639Z"},"content_sha256":"533acba0dbefd3da06c478c1f5605c0c0a40d0c21818d2f0beda2090ab4e6b4c","schema_version":"1.0","event_id":"sha256:533acba0dbefd3da06c478c1f5605c0c0a40d0c21818d2f0beda2090ab4e6b4c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ANYC55SGRNBHZYAQJ7A5RU34F7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Wireless Powered Communications with Non-Orthogonal Multiple Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"George K. Karagiannidis, Koralia N. Pappi, Panagiotis D. Diamantoulakis, Zhiguo Ding","submitted_at":"2015-11-04T11:13:44Z","abstract_excerpt":"We study a wireless-powered uplink communication system with non-orthogonal multiple access (NOMA), consisting of one base station and multiple energy harvesting users. More specifically, we focus on the individual data rate optimization and fairness improvement and we show that the formulated problems can be optimally and efficiently solved by either linear programming or convex optimization. In the provided analysis, two types of decoding order strategies are considered, namely fixed decoding order and time- sharing. Furthermore, we propose an efficient greedy algorithm, which is suitable fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01291","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-18T00:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h6YV/Q3tKanzNqxEr2u3JDJIEafKPUmHMbpv/PlDK7K7KItkYoOVycMe2FewRIraQQAvVh0YiacVr9Vms1BTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T09:23:22.928991Z"},"content_sha256":"dbca5d8ef375759cf95134a839ea1aaef4c69f04ee794f6e94c126d5e537d8b8","schema_version":"1.0","event_id":"sha256:dbca5d8ef375759cf95134a839ea1aaef4c69f04ee794f6e94c126d5e537d8b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ANYC55SGRNBHZYAQJ7A5RU34F7/bundle.json","state_url":"https://pith.science/pith/ANYC55SGRNBHZYAQJ7A5RU34F7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ANYC55SGRNBHZYAQJ7A5RU34F7/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-19T09:23:22Z","links":{"resolver":"https://pith.science/pith/ANYC55SGRNBHZYAQJ7A5RU34F7","bundle":"https://pith.science/pith/ANYC55SGRNBHZYAQJ7A5RU34F7/bundle.json","state":"https://pith.science/pith/ANYC55SGRNBHZYAQJ7A5RU34F7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ANYC55SGRNBHZYAQJ7A5RU34F7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ANYC55SGRNBHZYAQJ7A5RU34F7","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":"3b830f116d0aa0e2a88475ef7b520edfbc828966f852b380393181a757a5081d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-04T11:13:44Z","title_canon_sha256":"1d2ac38435a3a96169cfc376608199c376b9c71b360553d2c3d1cf3973465223"},"schema_version":"1.0","source":{"id":"1511.01291","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01291","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01291v2","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01291","created_at":"2026-05-18T00:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"ANYC55SGRNBH","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"ANYC55SGRNBHZYAQ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"ANYC55SG","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:dbca5d8ef375759cf95134a839ea1aaef4c69f04ee794f6e94c126d5e537d8b8","target":"graph","created_at":"2026-05-18T00:58:10Z","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":"We study a wireless-powered uplink communication system with non-orthogonal multiple access (NOMA), consisting of one base station and multiple energy harvesting users. More specifically, we focus on the individual data rate optimization and fairness improvement and we show that the formulated problems can be optimally and efficiently solved by either linear programming or convex optimization. In the provided analysis, two types of decoding order strategies are considered, namely fixed decoding order and time- sharing. Furthermore, we propose an efficient greedy algorithm, which is suitable fo","authors_text":"George K. Karagiannidis, Koralia N. Pappi, Panagiotis D. Diamantoulakis, Zhiguo Ding","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-04T11:13:44Z","title":"Wireless Powered Communications with Non-Orthogonal Multiple Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01291","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:533acba0dbefd3da06c478c1f5605c0c0a40d0c21818d2f0beda2090ab4e6b4c","target":"record","created_at":"2026-05-18T00:58:10Z","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":"3b830f116d0aa0e2a88475ef7b520edfbc828966f852b380393181a757a5081d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-04T11:13:44Z","title_canon_sha256":"1d2ac38435a3a96169cfc376608199c376b9c71b360553d2c3d1cf3973465223"},"schema_version":"1.0","source":{"id":"1511.01291","kind":"arxiv","version":2}},"canonical_sha256":"03702ef6468b427ce0104fc1d8d37c2fd0c5e10bd6f5a309dd979e962e689c73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03702ef6468b427ce0104fc1d8d37c2fd0c5e10bd6f5a309dd979e962e689c73","first_computed_at":"2026-05-18T00:58:10.139154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:10.139154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lm0duAtummTLDrHaqLgmKkFZ3ropOMCGFFg7epTExalpf4QInTlLkVt3kPxWUpvA5LkdZBcnNF4CtCi4VGizBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:10.139956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01291","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:533acba0dbefd3da06c478c1f5605c0c0a40d0c21818d2f0beda2090ab4e6b4c","sha256:dbca5d8ef375759cf95134a839ea1aaef4c69f04ee794f6e94c126d5e537d8b8"],"state_sha256":"39bfd30365af99abd1e95affdc2cb0f9abd658aa6cfe4b443608db728d905a25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SvPIoSe6Vv/jjLkVvzPm01PJeMCS5RWYdRm/b0ptCmKT8OchNTVR1M51Vy/prKtO2HR/HMljbWO42rmf0jpOCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T09:23:22.931567Z","bundle_sha256":"c926ab46adcad9c0a540402b611762494adb66246048a217654a701d388d1817"}}