{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4IPBODYOJTOD5VA4BVR5ZV3VQ5","short_pith_number":"pith:4IPBODYO","schema_version":"1.0","canonical_sha256":"e21e170f0e4cdc3ed41c0d63dcd7758751a26cea3e590e4cdf02d1da09e2b999","source":{"kind":"arxiv","id":"1608.08313","version":1},"attestation_state":"computed","paper":{"title":"Sub-channel Assignment, Power Allocation and User Scheduling for Non-Orthogonal Multiple Access Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Boya Di, Lingyang Song, Yonghui Li","submitted_at":"2016-08-30T03:31:24Z","abstract_excerpt":"In this paper, we study the resource allocation and user scheduling problem for a downlink nonorthogonal multiple access network where the base station allocates spectrum and power resources to a set of users. We aim to jointly optimize the sub-channel assignment and power allocation to maximize the weighted total sum-rate while taking into account user fairness. We formulate the sub-channel allocation problem as equivalent to a many-to-many two-sided user-subchannel matching game in which the set of users and sub-channels are considered as two sets of players pursuing their own interests. We "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1608.08313","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-08-30T03:31:24Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7584921998f2389fcaf1ce7773b642545e8a3d3db194b0d07d5216ababfdceff","abstract_canon_sha256":"fc08bd0c7e8ccbb2fbd0f2307f7731f2bc3be83cfe7b3bf21eda26f9ab0cd725"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:28.459525Z","signature_b64":"u4y1i2uCJEY5wu5xRi5M3LSUf7OJVYCpS3x5kYhPmnG63IQ/Zk0GwMGFrjNw1MpqEbMbImizLyFHsLlHSE6UBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e21e170f0e4cdc3ed41c0d63dcd7758751a26cea3e590e4cdf02d1da09e2b999","last_reissued_at":"2026-05-18T00:58:28.458897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:28.458897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sub-channel Assignment, Power Allocation and User Scheduling for Non-Orthogonal Multiple Access Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Boya Di, Lingyang Song, Yonghui Li","submitted_at":"2016-08-30T03:31:24Z","abstract_excerpt":"In this paper, we study the resource allocation and user scheduling problem for a downlink nonorthogonal multiple access network where the base station allocates spectrum and power resources to a set of users. We aim to jointly optimize the sub-channel assignment and power allocation to maximize the weighted total sum-rate while taking into account user fairness. We formulate the sub-channel allocation problem as equivalent to a many-to-many two-sided user-subchannel matching game in which the set of users and sub-channels are considered as two sets of players pursuing their own interests. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08313","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.08313","created_at":"2026-05-18T00:58:28.458989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08313v1","created_at":"2026-05-18T00:58:28.458989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08313","created_at":"2026-05-18T00:58:28.458989+00:00"},{"alias_kind":"pith_short_12","alias_value":"4IPBODYOJTOD","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4IPBODYOJTOD5VA4","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4IPBODYO","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4IPBODYOJTOD5VA4BVR5ZV3VQ5","json":"https://pith.science/pith/4IPBODYOJTOD5VA4BVR5ZV3VQ5.json","graph_json":"https://pith.science/api/pith-number/4IPBODYOJTOD5VA4BVR5ZV3VQ5/graph.json","events_json":"https://pith.science/api/pith-number/4IPBODYOJTOD5VA4BVR5ZV3VQ5/events.json","paper":"https://pith.science/paper/4IPBODYO"},"agent_actions":{"view_html":"https://pith.science/pith/4IPBODYOJTOD5VA4BVR5ZV3VQ5","download_json":"https://pith.science/pith/4IPBODYOJTOD5VA4BVR5ZV3VQ5.json","view_paper":"https://pith.science/paper/4IPBODYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08313&json=true","fetch_graph":"https://pith.science/api/pith-number/4IPBODYOJTOD5VA4BVR5ZV3VQ5/graph.json","fetch_events":"https://pith.science/api/pith-number/4IPBODYOJTOD5VA4BVR5ZV3VQ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4IPBODYOJTOD5VA4BVR5ZV3VQ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4IPBODYOJTOD5VA4BVR5ZV3VQ5/action/storage_attestation","attest_author":"https://pith.science/pith/4IPBODYOJTOD5VA4BVR5ZV3VQ5/action/author_attestation","sign_citation":"https://pith.science/pith/4IPBODYOJTOD5VA4BVR5ZV3VQ5/action/citation_signature","submit_replication":"https://pith.science/pith/4IPBODYOJTOD5VA4BVR5ZV3VQ5/action/replication_record"}},"created_at":"2026-05-18T00:58:28.458989+00:00","updated_at":"2026-05-18T00:58:28.458989+00:00"}