{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TD57UPPWUA6LWJJAKZSMQDX7YR","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":"e7d6010351b61f7331592af43fd6fa86164dbca59058a3fa87c036d6e9783152","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-26T18:23:54Z","title_canon_sha256":"168a40f254c59f1d5528a117d0ca91efa40f600ac607fd09858fe77efdada945"},"schema_version":"1.0","source":{"id":"1603.08132","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08132","created_at":"2026-05-18T01:18:13Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08132v1","created_at":"2026-05-18T01:18:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08132","created_at":"2026-05-18T01:18:13Z"},{"alias_kind":"pith_short_12","alias_value":"TD57UPPWUA6L","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TD57UPPWUA6LWJJA","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TD57UPPW","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:51afa8a64acb67ca449e7c746b4ee8b20a9882b122d4a205fbd428e85822d98b","target":"graph","created_at":"2026-05-18T01:18:13Z","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 investigate the resource allocation algorithm design for multicarrier non-orthogonal multiple access (MC-NOMA) systems. The proposed algorithm is obtained from the solution of a non-convex optimization problem for the maximization of the weighted system throughput. We employ monotonic optimization to develop the optimal joint power and subcarrier allocation policy. The optimal resource allocation policy serves as a performance benchmark due to its high complexity. Furthermore, to strike a balance between computational complexity and optimality, a suboptimal scheme with low co","authors_text":"Derrick Wing Kwan Ng, Robert Schober, Yan Sun, Zhiguo Ding","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-26T18:23:54Z","title":"Optimal Joint Power and Subcarrier Allocation for MC-NOMA Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08132","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:536266d405dfafae7231f9f9bef31a665a46c008abb1ef786507673937b42478","target":"record","created_at":"2026-05-18T01:18:13Z","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":"e7d6010351b61f7331592af43fd6fa86164dbca59058a3fa87c036d6e9783152","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-26T18:23:54Z","title_canon_sha256":"168a40f254c59f1d5528a117d0ca91efa40f600ac607fd09858fe77efdada945"},"schema_version":"1.0","source":{"id":"1603.08132","kind":"arxiv","version":1}},"canonical_sha256":"98fbfa3df6a03cbb25205664c80effc4605090c30699c5473006776d26980184","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98fbfa3df6a03cbb25205664c80effc4605090c30699c5473006776d26980184","first_computed_at":"2026-05-18T01:18:13.161379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:13.161379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/olt1ood9RX/D659XOlAKzTqT0QbtiKpd9KB7zSapk/6MET19iZIwKNm+MOFhfEYE/cz+TEBFV9LgsinEzlYDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:13.162083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.08132","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:536266d405dfafae7231f9f9bef31a665a46c008abb1ef786507673937b42478","sha256:51afa8a64acb67ca449e7c746b4ee8b20a9882b122d4a205fbd428e85822d98b"],"state_sha256":"712e3360e2b2b2cf5fc3c7f8253c920b2442e25a69d03cbfae22fa9ef6591841"}