{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:COZPNX723ABKCTSRTHMKT4NVZK","short_pith_number":"pith:COZPNX72","canonical_record":{"source":{"id":"1505.05735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-21T13:37:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3896ac6a49e165509bd5efbb494ff3ea4395076356ae7a573e2084964b1c4156","abstract_canon_sha256":"67d9901e503ef706cf147cb1a17d243420f0db4f0b034d8a885ec43ee0c9b232"},"schema_version":"1.0"},"canonical_sha256":"13b2f6dffad802a14e5199d8a9f1b5cab749fdd6d5cdf11e8a88514b6bf4bcb8","source":{"kind":"arxiv","id":"1505.05735","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05735","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05735v1","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05735","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"COZPNX723ABK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"COZPNX723ABKCTSR","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"COZPNX72","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:COZPNX723ABKCTSRTHMKT4NVZK","target":"record","payload":{"canonical_record":{"source":{"id":"1505.05735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-21T13:37:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3896ac6a49e165509bd5efbb494ff3ea4395076356ae7a573e2084964b1c4156","abstract_canon_sha256":"67d9901e503ef706cf147cb1a17d243420f0db4f0b034d8a885ec43ee0c9b232"},"schema_version":"1.0"},"canonical_sha256":"13b2f6dffad802a14e5199d8a9f1b5cab749fdd6d5cdf11e8a88514b6bf4bcb8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:11.832001Z","signature_b64":"C8/L5hjY576fq97Vuo93DIqkME8CjsYgmVjSyNG/Koe+Hbv8Y+DgrDiWmVvC9BmO+Q82dNCTAiXi/RDeM+hoBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13b2f6dffad802a14e5199d8a9f1b5cab749fdd6d5cdf11e8a88514b6bf4bcb8","last_reissued_at":"2026-05-18T01:25:11.831472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:11.831472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.05735","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-18T01:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PQgsIHkDBWxbFvBXOLcFe3AHeeYKrPbhNJNpRTL+V6GDocmLo3obKMuDFck21Uc4oWTyTK3NYqP6gHcgq54jBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:43:32.637599Z"},"content_sha256":"f4a833713df24aca974f714d50a7915968ef00b14b9632ea0a645f0115f98eaf","schema_version":"1.0","event_id":"sha256:f4a833713df24aca974f714d50a7915968ef00b14b9632ea0a645f0115f98eaf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:COZPNX723ABKCTSRTHMKT4NVZK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Minorization-Maximization Method for Optimizing Sum Rate in Non-Orthogonal Multiple Access Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"George K. Karagiannidis, Muhammad Fainan Hanif, Tharmalingam Ratnarajah, Zhiguo Ding","submitted_at":"2015-05-21T13:37:26Z","abstract_excerpt":"Non-orthogonal multiple access (NOMA) systems have the potential to deliver higher system throughput, compared to contemporary orthogonal multiple access techniques. For a linearly precoded multiple-input multiple-output (MISO) system, we study the downlink sum rate maximization problem, when the NOMA principles are applied. Being a non-convex and intractable optimization problem,we resort to approximate it with a minorization-maximization algorithm (MMA), which is a widely used tool in statistics. In each step of the MMA, we solve a second-order cone program, such that the feasibility set in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05735","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-18T01:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z4gsnyELvHMqvDLsofbQDLlEVq996MFeYI3IHnw6tzceFV9CERPIp5DdnsLt6ET+FudAJprin+D1atVM8UdABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:43:32.637947Z"},"content_sha256":"f5d89f93c999acf17e131484f7409bd0434ce11472da2e1481b0ed7fb941f8e2","schema_version":"1.0","event_id":"sha256:f5d89f93c999acf17e131484f7409bd0434ce11472da2e1481b0ed7fb941f8e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/COZPNX723ABKCTSRTHMKT4NVZK/bundle.json","state_url":"https://pith.science/pith/COZPNX723ABKCTSRTHMKT4NVZK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/COZPNX723ABKCTSRTHMKT4NVZK/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-04T12:43:32Z","links":{"resolver":"https://pith.science/pith/COZPNX723ABKCTSRTHMKT4NVZK","bundle":"https://pith.science/pith/COZPNX723ABKCTSRTHMKT4NVZK/bundle.json","state":"https://pith.science/pith/COZPNX723ABKCTSRTHMKT4NVZK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/COZPNX723ABKCTSRTHMKT4NVZK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:COZPNX723ABKCTSRTHMKT4NVZK","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":"67d9901e503ef706cf147cb1a17d243420f0db4f0b034d8a885ec43ee0c9b232","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-21T13:37:26Z","title_canon_sha256":"3896ac6a49e165509bd5efbb494ff3ea4395076356ae7a573e2084964b1c4156"},"schema_version":"1.0","source":{"id":"1505.05735","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05735","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05735v1","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05735","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"COZPNX723ABK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"COZPNX723ABKCTSR","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"COZPNX72","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:f5d89f93c999acf17e131484f7409bd0434ce11472da2e1481b0ed7fb941f8e2","target":"graph","created_at":"2026-05-18T01:25:11Z","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":"Non-orthogonal multiple access (NOMA) systems have the potential to deliver higher system throughput, compared to contemporary orthogonal multiple access techniques. For a linearly precoded multiple-input multiple-output (MISO) system, we study the downlink sum rate maximization problem, when the NOMA principles are applied. Being a non-convex and intractable optimization problem,we resort to approximate it with a minorization-maximization algorithm (MMA), which is a widely used tool in statistics. In each step of the MMA, we solve a second-order cone program, such that the feasibility set in ","authors_text":"George K. Karagiannidis, Muhammad Fainan Hanif, Tharmalingam Ratnarajah, Zhiguo Ding","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-21T13:37:26Z","title":"A Minorization-Maximization Method for Optimizing Sum Rate in Non-Orthogonal Multiple Access Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05735","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:f4a833713df24aca974f714d50a7915968ef00b14b9632ea0a645f0115f98eaf","target":"record","created_at":"2026-05-18T01:25:11Z","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":"67d9901e503ef706cf147cb1a17d243420f0db4f0b034d8a885ec43ee0c9b232","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-21T13:37:26Z","title_canon_sha256":"3896ac6a49e165509bd5efbb494ff3ea4395076356ae7a573e2084964b1c4156"},"schema_version":"1.0","source":{"id":"1505.05735","kind":"arxiv","version":1}},"canonical_sha256":"13b2f6dffad802a14e5199d8a9f1b5cab749fdd6d5cdf11e8a88514b6bf4bcb8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13b2f6dffad802a14e5199d8a9f1b5cab749fdd6d5cdf11e8a88514b6bf4bcb8","first_computed_at":"2026-05-18T01:25:11.831472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:11.831472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C8/L5hjY576fq97Vuo93DIqkME8CjsYgmVjSyNG/Koe+Hbv8Y+DgrDiWmVvC9BmO+Q82dNCTAiXi/RDeM+hoBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:11.832001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.05735","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4a833713df24aca974f714d50a7915968ef00b14b9632ea0a645f0115f98eaf","sha256:f5d89f93c999acf17e131484f7409bd0434ce11472da2e1481b0ed7fb941f8e2"],"state_sha256":"ed3fb27eae633217cbb3c8c39b262edbedb804c2b307b452227251adf06e8e8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lxbfLnvRFCWcDJ2E2V2UWF6gIpn2x6wRGbbLA4OCvoBYdkXaMvKBTcInxojIC7lIwGIh0MxzbzGBpSfyDcFyCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T12:43:32.639886Z","bundle_sha256":"53a086b2ad4a91bf588c5edb55910fb461c441317fceb5b7f60cf166624294e1"}}