{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MJL3LP6QFOPAEW3UT7ECSCVRVA","short_pith_number":"pith:MJL3LP6Q","canonical_record":{"source":{"id":"1801.08294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-25T07:24:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"266c5a3be8ba60f96a92830704b17e34de28a80f6237ae5a06870a78f8b4fa04","abstract_canon_sha256":"91d2c08498c4cfa4a9c326d30cf62fbcbb136f45e8bee4138131db928760311a"},"schema_version":"1.0"},"canonical_sha256":"6257b5bfd02b9e025b749fc8290ab1a80307d4d3ff4bde79767eabb9f2c59868","source":{"kind":"arxiv","id":"1801.08294","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08294","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08294v1","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08294","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"pith_short_12","alias_value":"MJL3LP6QFOPA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MJL3LP6QFOPAEW3U","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MJL3LP6Q","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MJL3LP6QFOPAEW3UT7ECSCVRVA","target":"record","payload":{"canonical_record":{"source":{"id":"1801.08294","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-25T07:24:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"266c5a3be8ba60f96a92830704b17e34de28a80f6237ae5a06870a78f8b4fa04","abstract_canon_sha256":"91d2c08498c4cfa4a9c326d30cf62fbcbb136f45e8bee4138131db928760311a"},"schema_version":"1.0"},"canonical_sha256":"6257b5bfd02b9e025b749fc8290ab1a80307d4d3ff4bde79767eabb9f2c59868","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:06.608712Z","signature_b64":"UINv3khKnmuK4KKkHe2ZlFddGZBS7HFknh7AaD6dm1Awpl/OScYvkLVaRtFCzwurqALQNEROvasLdmH6TMioBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6257b5bfd02b9e025b749fc8290ab1a80307d4d3ff4bde79767eabb9f2c59868","last_reissued_at":"2026-05-18T00:25:06.608291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:06.608291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.08294","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:25:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GKSTon+aimU2K6ryE1QFfPTCAXdz7WHQqw0vWlJFP1MceaKNuPiv5vZBhhoreTEpsGsvXR2YPxoIBIn2OrUyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:02:48.942711Z"},"content_sha256":"84437a7f61affc27ab1811d6989a81450b3d427f3a683892ffafa90b814c0b06","schema_version":"1.0","event_id":"sha256:84437a7f61affc27ab1811d6989a81450b3d427f3a683892ffafa90b814c0b06"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MJL3LP6QFOPAEW3UT7ECSCVRVA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimum Fairness for Non-Orthogonal Multiple Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ting Qi, Wei Feng, Youzheng Wang, Yunfei Chen","submitted_at":"2018-01-25T07:24:31Z","abstract_excerpt":"This paper focuses on the fairness issue in non-orthogonal multiple access (NOMA) and investigates the optimization problem that maximizes the worst user's achievable rate. Unlike previous studies, we derive a closed-form expression for the optimal value and solution, which are related to Perron-Frobenius eigenvalue and eigenvector of a defined positive matrix. On this basis, we propose an iterative algorithm to compute the optimal solution, which has linear convergence and requires only about half iterations of the classical bisection method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08294","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:25:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VKDkd/+VaUfCq7wntL0OoZt8opnMfV9dFzKDYbUbAjyICjFsj3GjslIuA1CeEEcOglX/hmB/edNYJNYKAIkbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:02:48.943060Z"},"content_sha256":"b7cd4985071805288bd22b7f13e256c19784f5813191cb9c38d3bf32efbe6276","schema_version":"1.0","event_id":"sha256:b7cd4985071805288bd22b7f13e256c19784f5813191cb9c38d3bf32efbe6276"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MJL3LP6QFOPAEW3UT7ECSCVRVA/bundle.json","state_url":"https://pith.science/pith/MJL3LP6QFOPAEW3UT7ECSCVRVA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MJL3LP6QFOPAEW3UT7ECSCVRVA/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-28T09:02:48Z","links":{"resolver":"https://pith.science/pith/MJL3LP6QFOPAEW3UT7ECSCVRVA","bundle":"https://pith.science/pith/MJL3LP6QFOPAEW3UT7ECSCVRVA/bundle.json","state":"https://pith.science/pith/MJL3LP6QFOPAEW3UT7ECSCVRVA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MJL3LP6QFOPAEW3UT7ECSCVRVA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MJL3LP6QFOPAEW3UT7ECSCVRVA","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":"91d2c08498c4cfa4a9c326d30cf62fbcbb136f45e8bee4138131db928760311a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-25T07:24:31Z","title_canon_sha256":"266c5a3be8ba60f96a92830704b17e34de28a80f6237ae5a06870a78f8b4fa04"},"schema_version":"1.0","source":{"id":"1801.08294","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08294","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08294v1","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08294","created_at":"2026-05-18T00:25:06Z"},{"alias_kind":"pith_short_12","alias_value":"MJL3LP6QFOPA","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MJL3LP6QFOPAEW3U","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MJL3LP6Q","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:b7cd4985071805288bd22b7f13e256c19784f5813191cb9c38d3bf32efbe6276","target":"graph","created_at":"2026-05-18T00:25:06Z","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 paper focuses on the fairness issue in non-orthogonal multiple access (NOMA) and investigates the optimization problem that maximizes the worst user's achievable rate. Unlike previous studies, we derive a closed-form expression for the optimal value and solution, which are related to Perron-Frobenius eigenvalue and eigenvector of a defined positive matrix. On this basis, we propose an iterative algorithm to compute the optimal solution, which has linear convergence and requires only about half iterations of the classical bisection method.","authors_text":"Ting Qi, Wei Feng, Youzheng Wang, Yunfei Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-25T07:24:31Z","title":"Optimum Fairness for Non-Orthogonal Multiple Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08294","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:84437a7f61affc27ab1811d6989a81450b3d427f3a683892ffafa90b814c0b06","target":"record","created_at":"2026-05-18T00:25:06Z","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":"91d2c08498c4cfa4a9c326d30cf62fbcbb136f45e8bee4138131db928760311a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-25T07:24:31Z","title_canon_sha256":"266c5a3be8ba60f96a92830704b17e34de28a80f6237ae5a06870a78f8b4fa04"},"schema_version":"1.0","source":{"id":"1801.08294","kind":"arxiv","version":1}},"canonical_sha256":"6257b5bfd02b9e025b749fc8290ab1a80307d4d3ff4bde79767eabb9f2c59868","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6257b5bfd02b9e025b749fc8290ab1a80307d4d3ff4bde79767eabb9f2c59868","first_computed_at":"2026-05-18T00:25:06.608291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:06.608291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UINv3khKnmuK4KKkHe2ZlFddGZBS7HFknh7AaD6dm1Awpl/OScYvkLVaRtFCzwurqALQNEROvasLdmH6TMioBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:06.608712Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.08294","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84437a7f61affc27ab1811d6989a81450b3d427f3a683892ffafa90b814c0b06","sha256:b7cd4985071805288bd22b7f13e256c19784f5813191cb9c38d3bf32efbe6276"],"state_sha256":"b9d5c3b383d88e3869660547131f730adf4f236721457406dd48434edd736a63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P/ptWBfggOdgTU63A7VkMHX50v8skpqiiQynOfdW3UqkZ68WLQ5JIe96mEwE97GdYO1fzMGHXJzl8dwv8qS7DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:02:48.945081Z","bundle_sha256":"fcdc9d51e04bb03a7f730742caca6d4bf94fa97bc50b8e0a96cc7c80207c71f0"}}