{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KF7W7CCFRSFOF6TKMR5PKQALP4","short_pith_number":"pith:KF7W7CCF","canonical_record":{"source":{"id":"1801.00121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-30T12:01:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1649a00b0259961e5f2d6bc70d37a88f89c216c49f9a31cf00e831298bfc858e","abstract_canon_sha256":"426b4e6fdd5a628f6aa3b29ad8d82bfcb584ddc2dd13515512f226cc6886e6a1"},"schema_version":"1.0"},"canonical_sha256":"517f6f88458c8ae2fa6a647af5400b7f19067026aba93deaf30b929054bec144","source":{"kind":"arxiv","id":"1801.00121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00121","created_at":"2026-05-18T00:26:48Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00121v1","created_at":"2026-05-18T00:26:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00121","created_at":"2026-05-18T00:26:48Z"},{"alias_kind":"pith_short_12","alias_value":"KF7W7CCFRSFO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KF7W7CCFRSFOF6TK","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KF7W7CCF","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KF7W7CCFRSFOF6TKMR5PKQALP4","target":"record","payload":{"canonical_record":{"source":{"id":"1801.00121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-30T12:01:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1649a00b0259961e5f2d6bc70d37a88f89c216c49f9a31cf00e831298bfc858e","abstract_canon_sha256":"426b4e6fdd5a628f6aa3b29ad8d82bfcb584ddc2dd13515512f226cc6886e6a1"},"schema_version":"1.0"},"canonical_sha256":"517f6f88458c8ae2fa6a647af5400b7f19067026aba93deaf30b929054bec144","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:48.857656Z","signature_b64":"84yAU7oMbiv4Emfr0LlRLjv/cEMgZNWJ8j6Pmx4fWfa4AT4eTBH0WHFhp5v6FpHwfiQWH4JrZVnI8jioTXWJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"517f6f88458c8ae2fa6a647af5400b7f19067026aba93deaf30b929054bec144","last_reissued_at":"2026-05-18T00:26:48.857086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:48.857086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.00121","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:26:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1BdGU1Fm8eDwHJ7DdWpmwFg3BFyAHIRp/CnVfoPrflcSaPZ04Ls0lbVFCVJ0qrSqgrboWuKxg/ZUT1QgI1EUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:33:38.098706Z"},"content_sha256":"760b49d366b3959962b37ae7b8020e38c5408f43cbdaf771d0d53fb7fac2daab","schema_version":"1.0","event_id":"sha256:760b49d366b3959962b37ae7b8020e38c5408f43cbdaf771d0d53fb7fac2daab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KF7W7CCFRSFOF6TKMR5PKQALP4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource Allocation for Downlink NOMA Systems: Key Techniques and Open Issues","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kyung-Sup Kwak, Ming Zeng, Octavia A. Dobre, S. M. Riazul Islam","submitted_at":"2017-12-30T12:01:50Z","abstract_excerpt":"This article presents advances in resource allocation (RA) for downlink non-orthogonal multiple access (NOMA) systems, focusing on user pairing (UP) and power allocation (PA) algorithms. The former pairs the users to obtain the high capacity gain by exploiting the channel gain difference between the users, while the later allocates power to users in each cluster to balance system throughput and user fairness. Additionally, the article introduces the concept of cluster fairness and proposes the divideand- next largest difference-based UP algorithm to distribute the capacity gain among the NOMA "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00121","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:26:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N096CBu4IJ0OFmwFHHj+cqZOUxn3MzEfCkFiCbS/6DFGYh+U+AJ4rd6MP9BI+I9GZPiCbhZ+ZBSV9Y1wCdvdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:33:38.099409Z"},"content_sha256":"6e2eb75c1248e509f8e15faeb881bc695394ed91b2b19323089f80c107153194","schema_version":"1.0","event_id":"sha256:6e2eb75c1248e509f8e15faeb881bc695394ed91b2b19323089f80c107153194"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KF7W7CCFRSFOF6TKMR5PKQALP4/bundle.json","state_url":"https://pith.science/pith/KF7W7CCFRSFOF6TKMR5PKQALP4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KF7W7CCFRSFOF6TKMR5PKQALP4/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-25T19:33:38Z","links":{"resolver":"https://pith.science/pith/KF7W7CCFRSFOF6TKMR5PKQALP4","bundle":"https://pith.science/pith/KF7W7CCFRSFOF6TKMR5PKQALP4/bundle.json","state":"https://pith.science/pith/KF7W7CCFRSFOF6TKMR5PKQALP4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KF7W7CCFRSFOF6TKMR5PKQALP4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KF7W7CCFRSFOF6TKMR5PKQALP4","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":"426b4e6fdd5a628f6aa3b29ad8d82bfcb584ddc2dd13515512f226cc6886e6a1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-30T12:01:50Z","title_canon_sha256":"1649a00b0259961e5f2d6bc70d37a88f89c216c49f9a31cf00e831298bfc858e"},"schema_version":"1.0","source":{"id":"1801.00121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.00121","created_at":"2026-05-18T00:26:48Z"},{"alias_kind":"arxiv_version","alias_value":"1801.00121v1","created_at":"2026-05-18T00:26:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00121","created_at":"2026-05-18T00:26:48Z"},{"alias_kind":"pith_short_12","alias_value":"KF7W7CCFRSFO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KF7W7CCFRSFOF6TK","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KF7W7CCF","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:6e2eb75c1248e509f8e15faeb881bc695394ed91b2b19323089f80c107153194","target":"graph","created_at":"2026-05-18T00:26:48Z","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":"This article presents advances in resource allocation (RA) for downlink non-orthogonal multiple access (NOMA) systems, focusing on user pairing (UP) and power allocation (PA) algorithms. The former pairs the users to obtain the high capacity gain by exploiting the channel gain difference between the users, while the later allocates power to users in each cluster to balance system throughput and user fairness. Additionally, the article introduces the concept of cluster fairness and proposes the divideand- next largest difference-based UP algorithm to distribute the capacity gain among the NOMA ","authors_text":"Kyung-Sup Kwak, Ming Zeng, Octavia A. Dobre, S. M. Riazul Islam","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-30T12:01:50Z","title":"Resource Allocation for Downlink NOMA Systems: Key Techniques and Open Issues"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00121","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:760b49d366b3959962b37ae7b8020e38c5408f43cbdaf771d0d53fb7fac2daab","target":"record","created_at":"2026-05-18T00:26:48Z","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":"426b4e6fdd5a628f6aa3b29ad8d82bfcb584ddc2dd13515512f226cc6886e6a1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-30T12:01:50Z","title_canon_sha256":"1649a00b0259961e5f2d6bc70d37a88f89c216c49f9a31cf00e831298bfc858e"},"schema_version":"1.0","source":{"id":"1801.00121","kind":"arxiv","version":1}},"canonical_sha256":"517f6f88458c8ae2fa6a647af5400b7f19067026aba93deaf30b929054bec144","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"517f6f88458c8ae2fa6a647af5400b7f19067026aba93deaf30b929054bec144","first_computed_at":"2026-05-18T00:26:48.857086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:48.857086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"84yAU7oMbiv4Emfr0LlRLjv/cEMgZNWJ8j6Pmx4fWfa4AT4eTBH0WHFhp5v6FpHwfiQWH4JrZVnI8jioTXWJCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:48.857656Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.00121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:760b49d366b3959962b37ae7b8020e38c5408f43cbdaf771d0d53fb7fac2daab","sha256:6e2eb75c1248e509f8e15faeb881bc695394ed91b2b19323089f80c107153194"],"state_sha256":"9a3dc1028457763948da6f42990daa82c89391282086d527520b947b694cd03b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dTenIiqn/pbouWdMXIJWk8neeMc8XqJYsW5BZ3g0O5GioeyaD4NsNG/uey1Z1p3QQOXhx04Qz/AfMfMKQ8T7DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:33:38.102998Z","bundle_sha256":"e30b65ca7680fb565f4d260430ea2f9975bb39312c0e097549e00bf0f11be680"}}