{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QYQA5J4AZPZKOKCLXCZMQ34GM3","short_pith_number":"pith:QYQA5J4A","canonical_record":{"source":{"id":"1705.06959","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T12:32:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5912fe8e1d188f23b2de7ec4d356214de31db139b910313e96516b77e7dd7d45","abstract_canon_sha256":"16fa95be4c1fa72b64ea0071218842ea151b5a6c6290c76a0202abdcfe1a0f3b"},"schema_version":"1.0"},"canonical_sha256":"86200ea780cbf2a7284bb8b2c86f8666dfd3c25827e1340ff7c8f4430e66c49e","source":{"kind":"arxiv","id":"1705.06959","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06959","created_at":"2026-05-18T00:16:32Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06959v1","created_at":"2026-05-18T00:16:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06959","created_at":"2026-05-18T00:16:32Z"},{"alias_kind":"pith_short_12","alias_value":"QYQA5J4AZPZK","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QYQA5J4AZPZKOKCL","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QYQA5J4A","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QYQA5J4AZPZKOKCLXCZMQ34GM3","target":"record","payload":{"canonical_record":{"source":{"id":"1705.06959","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T12:32:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5912fe8e1d188f23b2de7ec4d356214de31db139b910313e96516b77e7dd7d45","abstract_canon_sha256":"16fa95be4c1fa72b64ea0071218842ea151b5a6c6290c76a0202abdcfe1a0f3b"},"schema_version":"1.0"},"canonical_sha256":"86200ea780cbf2a7284bb8b2c86f8666dfd3c25827e1340ff7c8f4430e66c49e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:32.160911Z","signature_b64":"Z1kLjb52gZtx3VtLpuWO53aKqKLnO+8jrCaYfyydlI3SHZeSP1yo3y++QJVOHQAnbp5S6Js5OLcONA9Gjj6QCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86200ea780cbf2a7284bb8b2c86f8666dfd3c25827e1340ff7c8f4430e66c49e","last_reissued_at":"2026-05-18T00:16:32.160137Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:32.160137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.06959","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:16:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iPEJ4bRHB65Dy8Za1KRAqlzzykNX6A+N5WYlcfZcNepI0z60LjtTvXNFhi7dqUX60rcvV3lQPMt7VNALw3VnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T12:52:19.662574Z"},"content_sha256":"80462f71b6f41559b5d32a3c68c7124698808c29307e7e097f9c5881cb73cde2","schema_version":"1.0","event_id":"sha256:80462f71b6f41559b5d32a3c68c7124698808c29307e7e097f9c5881cb73cde2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QYQA5J4AZPZKOKCLXCZMQ34GM3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beam Design and User Scheduling for Non-Orthogonal Multiple Access with Multiple Antennas Based on Pareto-Optimality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Junyeong Seo, Youngchul Sung","submitted_at":"2017-05-19T12:32:54Z","abstract_excerpt":"In this paper, an efficient transmit beam design and user scheduling method is proposed for multi-user (MU) multiple-input single-output (MISO) non-orthogonal multiple access (NOMA) downlink, based on Pareto-optimality. The proposed beam design and user scheduling method groups simultaneously-served users into multiple clusters with practical two users in each cluster, and then applies spatical zeroforcing (ZF) across clusters to control inter-cluster interference (ICI) and Pareto-optimal beam design with successive interference cancellation (SIC) to two users in each cluster to remove interfe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06959","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:16:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1tLmPo2Q1H0pk1HtJh+CRtiUFMTGw2X96T8LBNMh9mvuTVQgExNdQOvSpNZyx6bU7Ly1JJXzncLlUwQ0FrdmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T12:52:19.662923Z"},"content_sha256":"9bed6977aaffed6e8db1f95e91b6563f366aecca7e6cbab839dc398708a38c29","schema_version":"1.0","event_id":"sha256:9bed6977aaffed6e8db1f95e91b6563f366aecca7e6cbab839dc398708a38c29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QYQA5J4AZPZKOKCLXCZMQ34GM3/bundle.json","state_url":"https://pith.science/pith/QYQA5J4AZPZKOKCLXCZMQ34GM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QYQA5J4AZPZKOKCLXCZMQ34GM3/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-06-21T12:52:19Z","links":{"resolver":"https://pith.science/pith/QYQA5J4AZPZKOKCLXCZMQ34GM3","bundle":"https://pith.science/pith/QYQA5J4AZPZKOKCLXCZMQ34GM3/bundle.json","state":"https://pith.science/pith/QYQA5J4AZPZKOKCLXCZMQ34GM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QYQA5J4AZPZKOKCLXCZMQ34GM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QYQA5J4AZPZKOKCLXCZMQ34GM3","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":"16fa95be4c1fa72b64ea0071218842ea151b5a6c6290c76a0202abdcfe1a0f3b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T12:32:54Z","title_canon_sha256":"5912fe8e1d188f23b2de7ec4d356214de31db139b910313e96516b77e7dd7d45"},"schema_version":"1.0","source":{"id":"1705.06959","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.06959","created_at":"2026-05-18T00:16:32Z"},{"alias_kind":"arxiv_version","alias_value":"1705.06959v1","created_at":"2026-05-18T00:16:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06959","created_at":"2026-05-18T00:16:32Z"},{"alias_kind":"pith_short_12","alias_value":"QYQA5J4AZPZK","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QYQA5J4AZPZKOKCL","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QYQA5J4A","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:9bed6977aaffed6e8db1f95e91b6563f366aecca7e6cbab839dc398708a38c29","target":"graph","created_at":"2026-05-18T00:16:32Z","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, an efficient transmit beam design and user scheduling method is proposed for multi-user (MU) multiple-input single-output (MISO) non-orthogonal multiple access (NOMA) downlink, based on Pareto-optimality. The proposed beam design and user scheduling method groups simultaneously-served users into multiple clusters with practical two users in each cluster, and then applies spatical zeroforcing (ZF) across clusters to control inter-cluster interference (ICI) and Pareto-optimal beam design with successive interference cancellation (SIC) to two users in each cluster to remove interfe","authors_text":"Junyeong Seo, Youngchul Sung","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T12:32:54Z","title":"Beam Design and User Scheduling for Non-Orthogonal Multiple Access with Multiple Antennas Based on Pareto-Optimality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06959","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:80462f71b6f41559b5d32a3c68c7124698808c29307e7e097f9c5881cb73cde2","target":"record","created_at":"2026-05-18T00:16:32Z","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":"16fa95be4c1fa72b64ea0071218842ea151b5a6c6290c76a0202abdcfe1a0f3b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-19T12:32:54Z","title_canon_sha256":"5912fe8e1d188f23b2de7ec4d356214de31db139b910313e96516b77e7dd7d45"},"schema_version":"1.0","source":{"id":"1705.06959","kind":"arxiv","version":1}},"canonical_sha256":"86200ea780cbf2a7284bb8b2c86f8666dfd3c25827e1340ff7c8f4430e66c49e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86200ea780cbf2a7284bb8b2c86f8666dfd3c25827e1340ff7c8f4430e66c49e","first_computed_at":"2026-05-18T00:16:32.160137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:32.160137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z1kLjb52gZtx3VtLpuWO53aKqKLnO+8jrCaYfyydlI3SHZeSP1yo3y++QJVOHQAnbp5S6Js5OLcONA9Gjj6QCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:32.160911Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.06959","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80462f71b6f41559b5d32a3c68c7124698808c29307e7e097f9c5881cb73cde2","sha256:9bed6977aaffed6e8db1f95e91b6563f366aecca7e6cbab839dc398708a38c29"],"state_sha256":"22b9d9922e01e74e8ef101149d542f3caeaa5f69956cbe57dbcf58bf590ff0d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PHGg3fih3X4JZSO+J4XZLGJfmtSnp1MIYFFQaHFzxfoVRQVP+dp/cJ55L9FAsGlfBibZE3Xv3H1jktsk8hbIBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T12:52:19.664912Z","bundle_sha256":"10b78a4ce49f3e3e5a5744df6dead2f9fc3e0367174f5e8f44748f28a4ef6be1"}}