{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PYHLT7QFZSK3CVU5J7B4TDAXAS","short_pith_number":"pith:PYHLT7QF","schema_version":"1.0","canonical_sha256":"7e0eb9fe05cc95b1569d4fc3c98c1704889efe8d2af252f4edb30e27f1ba7b32","source":{"kind":"arxiv","id":"1709.00509","version":1},"attestation_state":"computed","paper":{"title":"Uplink Non-Orthogonal Multiple Access with Finite-Alphabet Inputs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Branka Vucetic, He Chen, Jian-Kang Zhang, Lei Huang, Zheng Dong","submitted_at":"2017-09-02T00:24:45Z","abstract_excerpt":"This paper focuses on the non-orthogonal multiple access (NOMA) design for a classical two-user multiple access channel (MAC) with finite-alphabet inputs. We consider practical quadrature amplitude modulation (QAM) constellations at both transmitters, the sizes of which are assumed to be not necessarily identical. We propose to maximize the minimum Euclidean distance of the received sum-constellation with a maximum likelihood (ML) detector by adjusting the scaling factors (i.e., instantaneous transmitted powers and phases) of both users. The formulated problem is a mixed continuous-discrete op"},"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":"1709.00509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-02T00:24:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"417ff6e9ff9918995e531ec96bb96737f4d97420e2ed6eedec56e3d46942995d","abstract_canon_sha256":"856ad1ce902196c5be36c8b66c3a5a223a0963baedc3e1c1b9bd507632bc3d13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:07.878352Z","signature_b64":"B5s10sB3nkmxkWtZn4HkoONswtbg7uG38/BudKd78VlgYrT6mzZEGhMzOzCcOWb77NN+cuKC8yEp1tqMsQojDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e0eb9fe05cc95b1569d4fc3c98c1704889efe8d2af252f4edb30e27f1ba7b32","last_reissued_at":"2026-05-18T00:36:07.877545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:07.877545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uplink Non-Orthogonal Multiple Access with Finite-Alphabet Inputs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Branka Vucetic, He Chen, Jian-Kang Zhang, Lei Huang, Zheng Dong","submitted_at":"2017-09-02T00:24:45Z","abstract_excerpt":"This paper focuses on the non-orthogonal multiple access (NOMA) design for a classical two-user multiple access channel (MAC) with finite-alphabet inputs. We consider practical quadrature amplitude modulation (QAM) constellations at both transmitters, the sizes of which are assumed to be not necessarily identical. We propose to maximize the minimum Euclidean distance of the received sum-constellation with a maximum likelihood (ML) detector by adjusting the scaling factors (i.e., instantaneous transmitted powers and phases) of both users. The formulated problem is a mixed continuous-discrete op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00509","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":"1709.00509","created_at":"2026-05-18T00:36:07.877682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.00509v1","created_at":"2026-05-18T00:36:07.877682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00509","created_at":"2026-05-18T00:36:07.877682+00:00"},{"alias_kind":"pith_short_12","alias_value":"PYHLT7QFZSK3","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PYHLT7QFZSK3CVU5","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PYHLT7QF","created_at":"2026-05-18T12:31:37.085036+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/PYHLT7QFZSK3CVU5J7B4TDAXAS","json":"https://pith.science/pith/PYHLT7QFZSK3CVU5J7B4TDAXAS.json","graph_json":"https://pith.science/api/pith-number/PYHLT7QFZSK3CVU5J7B4TDAXAS/graph.json","events_json":"https://pith.science/api/pith-number/PYHLT7QFZSK3CVU5J7B4TDAXAS/events.json","paper":"https://pith.science/paper/PYHLT7QF"},"agent_actions":{"view_html":"https://pith.science/pith/PYHLT7QFZSK3CVU5J7B4TDAXAS","download_json":"https://pith.science/pith/PYHLT7QFZSK3CVU5J7B4TDAXAS.json","view_paper":"https://pith.science/paper/PYHLT7QF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.00509&json=true","fetch_graph":"https://pith.science/api/pith-number/PYHLT7QFZSK3CVU5J7B4TDAXAS/graph.json","fetch_events":"https://pith.science/api/pith-number/PYHLT7QFZSK3CVU5J7B4TDAXAS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PYHLT7QFZSK3CVU5J7B4TDAXAS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PYHLT7QFZSK3CVU5J7B4TDAXAS/action/storage_attestation","attest_author":"https://pith.science/pith/PYHLT7QFZSK3CVU5J7B4TDAXAS/action/author_attestation","sign_citation":"https://pith.science/pith/PYHLT7QFZSK3CVU5J7B4TDAXAS/action/citation_signature","submit_replication":"https://pith.science/pith/PYHLT7QFZSK3CVU5J7B4TDAXAS/action/replication_record"}},"created_at":"2026-05-18T00:36:07.877682+00:00","updated_at":"2026-05-18T00:36:07.877682+00:00"}