{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:E2JN2VJZBFK3CF4B3ADBZJ22YL","short_pith_number":"pith:E2JN2VJZ","canonical_record":{"source":{"id":"1705.05947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-16T22:58:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bdc03cdc9c3ffbfb07a4e5f51cec624aad17d5ccaabe2f4c906ecfbaa6f4cef8","abstract_canon_sha256":"9637b2373940d44461589617ee02a026ce95f7272894fd5f95d4585429b6ee0e"},"schema_version":"1.0"},"canonical_sha256":"2692dd55390955b11781d8061ca75ac2ebbf6208573d14f8cd438226790da3c0","source":{"kind":"arxiv","id":"1705.05947","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05947","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05947v1","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05947","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"pith_short_12","alias_value":"E2JN2VJZBFK3","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E2JN2VJZBFK3CF4B","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E2JN2VJZ","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:E2JN2VJZBFK3CF4B3ADBZJ22YL","target":"record","payload":{"canonical_record":{"source":{"id":"1705.05947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-16T22:58:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bdc03cdc9c3ffbfb07a4e5f51cec624aad17d5ccaabe2f4c906ecfbaa6f4cef8","abstract_canon_sha256":"9637b2373940d44461589617ee02a026ce95f7272894fd5f95d4585429b6ee0e"},"schema_version":"1.0"},"canonical_sha256":"2692dd55390955b11781d8061ca75ac2ebbf6208573d14f8cd438226790da3c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:19.362124Z","signature_b64":"K9ByhKhtbRLdCUEeRIRLJNd7dKbNIx1Oj28kH3aZUHRudB51U69mhATZp+RgfhQuQxw7icWRxW7yN8XPgYLmDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2692dd55390955b11781d8061ca75ac2ebbf6208573d14f8cd438226790da3c0","last_reissued_at":"2026-05-18T00:44:19.361577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:19.361577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.05947","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:44:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5V1JRtCAGXXR6HpDenu20enIJ0CrZK+9vtmwMZHxmLdk5uHyGPvZ+PnvAsVjrhFx2Wg0BFhhLLJxFhRZGaO9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:30:03.610901Z"},"content_sha256":"2ba651c27a4e88a967a71a2180fb302f425f2f9654466fdd6bd3b647da7e4bfe","schema_version":"1.0","event_id":"sha256:2ba651c27a4e88a967a71a2180fb302f425f2f9654466fdd6bd3b647da7e4bfe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:E2JN2VJZBFK3CF4B3ADBZJ22YL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Resource Allocation for Power-Efficient MC-NOMA with Imperfect Channel State Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Derrick Wing Kwan Ng, Hui-Ming Wang, Jinhong Yuan, Zhiqiang Wei","submitted_at":"2017-05-16T22:58:41Z","abstract_excerpt":"In this paper, we study power-efficient resource allocation for multicarrier non-orthogonal multiple access (MC-NOMA) systems. The resource allocation algorithm design is formulated as a non-convex optimization problem which jointly designs the power allocation, rate allocation, user scheduling, and successive interference cancellation (SIC) decoding policy for minimizing the total transmit power. The proposed framework takes into account the imperfection of channel state information at transmitter (CSIT) and quality of service (QoS) requirements of users. To facilitate the design of optimal S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05947","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:44:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJJeXRPIP/E9YBPHqQckDM8ZbAusKFLr+FW2OQ9iR55JgELg30TOW2jbiUiUAs4TG2Hv1aJXaAnPqEyh3rglDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:30:03.611305Z"},"content_sha256":"893049e003e69b4feb518f0a3623dbbc8642ac8cb88245275539acaf11f13869","schema_version":"1.0","event_id":"sha256:893049e003e69b4feb518f0a3623dbbc8642ac8cb88245275539acaf11f13869"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E2JN2VJZBFK3CF4B3ADBZJ22YL/bundle.json","state_url":"https://pith.science/pith/E2JN2VJZBFK3CF4B3ADBZJ22YL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E2JN2VJZBFK3CF4B3ADBZJ22YL/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-29T22:30:03Z","links":{"resolver":"https://pith.science/pith/E2JN2VJZBFK3CF4B3ADBZJ22YL","bundle":"https://pith.science/pith/E2JN2VJZBFK3CF4B3ADBZJ22YL/bundle.json","state":"https://pith.science/pith/E2JN2VJZBFK3CF4B3ADBZJ22YL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E2JN2VJZBFK3CF4B3ADBZJ22YL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:E2JN2VJZBFK3CF4B3ADBZJ22YL","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":"9637b2373940d44461589617ee02a026ce95f7272894fd5f95d4585429b6ee0e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-16T22:58:41Z","title_canon_sha256":"bdc03cdc9c3ffbfb07a4e5f51cec624aad17d5ccaabe2f4c906ecfbaa6f4cef8"},"schema_version":"1.0","source":{"id":"1705.05947","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05947","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05947v1","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05947","created_at":"2026-05-18T00:44:19Z"},{"alias_kind":"pith_short_12","alias_value":"E2JN2VJZBFK3","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E2JN2VJZBFK3CF4B","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E2JN2VJZ","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:893049e003e69b4feb518f0a3623dbbc8642ac8cb88245275539acaf11f13869","target":"graph","created_at":"2026-05-18T00:44:19Z","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 study power-efficient resource allocation for multicarrier non-orthogonal multiple access (MC-NOMA) systems. The resource allocation algorithm design is formulated as a non-convex optimization problem which jointly designs the power allocation, rate allocation, user scheduling, and successive interference cancellation (SIC) decoding policy for minimizing the total transmit power. The proposed framework takes into account the imperfection of channel state information at transmitter (CSIT) and quality of service (QoS) requirements of users. To facilitate the design of optimal S","authors_text":"Derrick Wing Kwan Ng, Hui-Ming Wang, Jinhong Yuan, Zhiqiang Wei","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-16T22:58:41Z","title":"Optimal Resource Allocation for Power-Efficient MC-NOMA with Imperfect Channel State Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05947","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:2ba651c27a4e88a967a71a2180fb302f425f2f9654466fdd6bd3b647da7e4bfe","target":"record","created_at":"2026-05-18T00:44:19Z","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":"9637b2373940d44461589617ee02a026ce95f7272894fd5f95d4585429b6ee0e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-16T22:58:41Z","title_canon_sha256":"bdc03cdc9c3ffbfb07a4e5f51cec624aad17d5ccaabe2f4c906ecfbaa6f4cef8"},"schema_version":"1.0","source":{"id":"1705.05947","kind":"arxiv","version":1}},"canonical_sha256":"2692dd55390955b11781d8061ca75ac2ebbf6208573d14f8cd438226790da3c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2692dd55390955b11781d8061ca75ac2ebbf6208573d14f8cd438226790da3c0","first_computed_at":"2026-05-18T00:44:19.361577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:19.361577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K9ByhKhtbRLdCUEeRIRLJNd7dKbNIx1Oj28kH3aZUHRudB51U69mhATZp+RgfhQuQxw7icWRxW7yN8XPgYLmDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:19.362124Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05947","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ba651c27a4e88a967a71a2180fb302f425f2f9654466fdd6bd3b647da7e4bfe","sha256:893049e003e69b4feb518f0a3623dbbc8642ac8cb88245275539acaf11f13869"],"state_sha256":"ebc1db009d0115943e2c5a26a89da7933409f68aae73ff46cdad3d9cb57af885"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8PGudmhEmDsE+BRY7L4NejsHdE2qRPumAtTJqNAKt8vUCAo0bTqDsBILVJFbtbvWCNWwJfe6TaHIKOX8QNEgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:30:03.615245Z","bundle_sha256":"c3f507e509e2417f23cc8ecc2b1dc276e984a69e930e641d20b4d56aa2b66ae2"}}