{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:67CFK67BC2DPHGJHZNS4RE35I2","short_pith_number":"pith:67CFK67B","canonical_record":{"source":{"id":"1703.09394","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-28T04:05:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d589b9e0c5ef156a9d228ebd049d0cc7df6b0ca0f770e777773cdcef198fee09","abstract_canon_sha256":"dbd5f09ead3a716db11f883d670a3d128c56284c03012bb24b44ce350665d22f"},"schema_version":"1.0"},"canonical_sha256":"f7c4557be11686f39927cb65c8937d46a270af4c34414045d85fb51f17a92dea","source":{"kind":"arxiv","id":"1703.09394","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09394","created_at":"2026-05-18T00:45:38Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09394v2","created_at":"2026-05-18T00:45:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09394","created_at":"2026-05-18T00:45:38Z"},{"alias_kind":"pith_short_12","alias_value":"67CFK67BC2DP","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"67CFK67BC2DPHGJH","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"67CFK67B","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:67CFK67BC2DPHGJHZNS4RE35I2","target":"record","payload":{"canonical_record":{"source":{"id":"1703.09394","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-28T04:05:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d589b9e0c5ef156a9d228ebd049d0cc7df6b0ca0f770e777773cdcef198fee09","abstract_canon_sha256":"dbd5f09ead3a716db11f883d670a3d128c56284c03012bb24b44ce350665d22f"},"schema_version":"1.0"},"canonical_sha256":"f7c4557be11686f39927cb65c8937d46a270af4c34414045d85fb51f17a92dea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:38.951136Z","signature_b64":"NmHuEx1p32pkJhj6ZcYczdukPok16s5A2Ld25pGEMks5/ctJq4hzcnNK4v1BUpsb+kayyKEWeG9VvWgeoLr9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7c4557be11686f39927cb65c8937d46a270af4c34414045d85fb51f17a92dea","last_reissued_at":"2026-05-18T00:45:38.950347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:38.950347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.09394","source_version":2,"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:45:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/r1WYYsnV7MTpCNMHEuilH+YOC52qN5Gp7yswr9qD3GKfr9B4rJR6dIYQHSd5GrROoO22VmUq0dgmjeO/5ZHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T19:07:41.558849Z"},"content_sha256":"1fa01a0ead38a95992ba93c3812acf7ce50edc67caf0d79da57e164816a67f34","schema_version":"1.0","event_id":"sha256:1fa01a0ead38a95992ba93c3812acf7ce50edc67caf0d79da57e164816a67f34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:67CFK67BC2DPHGJHZNS4RE35I2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fair Power Allocation Approach to NOMA in Multi-user SISO Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamid R. Sadjadpour, Jose Armando Oviedo","submitted_at":"2017-03-28T04:05:29Z","abstract_excerpt":"A non-orthogonal multiple access (NOMA) approach that always outperforms orthogonal multiple access (OMA) called Fair-NOMA is introduced. In Fair-NOMA, each mobile user is allocated its share of the transmit power such that its capacity is always greater than or equal to the capacity that can be achieved using OMA. For any slow-fading channel gains of the two users, the set of possible power allocation coefficients are derived. For the infimum and supremum of this set, the individual capacity gains and the sum-rate capacity gain are derived. It is shown that the ergodic sum-rate capacity gain "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09394","kind":"arxiv","version":2},"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:45:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FJgQJUbJwOaaPzM779zB7Evq4IZmy/Cp+dl3fIqy1YgzWViX0TXqghABsBJZWEJABaGDvjMpuGS5H4DGtIKwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T19:07:41.559506Z"},"content_sha256":"a80a1f5e05153f1baf8f372afb8a061560dca01ac7f648f43c1d8edb0634d39a","schema_version":"1.0","event_id":"sha256:a80a1f5e05153f1baf8f372afb8a061560dca01ac7f648f43c1d8edb0634d39a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/67CFK67BC2DPHGJHZNS4RE35I2/bundle.json","state_url":"https://pith.science/pith/67CFK67BC2DPHGJHZNS4RE35I2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/67CFK67BC2DPHGJHZNS4RE35I2/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-07T19:07:41Z","links":{"resolver":"https://pith.science/pith/67CFK67BC2DPHGJHZNS4RE35I2","bundle":"https://pith.science/pith/67CFK67BC2DPHGJHZNS4RE35I2/bundle.json","state":"https://pith.science/pith/67CFK67BC2DPHGJHZNS4RE35I2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/67CFK67BC2DPHGJHZNS4RE35I2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:67CFK67BC2DPHGJHZNS4RE35I2","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":"dbd5f09ead3a716db11f883d670a3d128c56284c03012bb24b44ce350665d22f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-28T04:05:29Z","title_canon_sha256":"d589b9e0c5ef156a9d228ebd049d0cc7df6b0ca0f770e777773cdcef198fee09"},"schema_version":"1.0","source":{"id":"1703.09394","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09394","created_at":"2026-05-18T00:45:38Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09394v2","created_at":"2026-05-18T00:45:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09394","created_at":"2026-05-18T00:45:38Z"},{"alias_kind":"pith_short_12","alias_value":"67CFK67BC2DP","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"67CFK67BC2DPHGJH","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"67CFK67B","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:a80a1f5e05153f1baf8f372afb8a061560dca01ac7f648f43c1d8edb0634d39a","target":"graph","created_at":"2026-05-18T00:45:38Z","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":"A non-orthogonal multiple access (NOMA) approach that always outperforms orthogonal multiple access (OMA) called Fair-NOMA is introduced. In Fair-NOMA, each mobile user is allocated its share of the transmit power such that its capacity is always greater than or equal to the capacity that can be achieved using OMA. For any slow-fading channel gains of the two users, the set of possible power allocation coefficients are derived. For the infimum and supremum of this set, the individual capacity gains and the sum-rate capacity gain are derived. It is shown that the ergodic sum-rate capacity gain ","authors_text":"Hamid R. Sadjadpour, Jose Armando Oviedo","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-28T04:05:29Z","title":"A Fair Power Allocation Approach to NOMA in Multi-user SISO Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09394","kind":"arxiv","version":2},"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:1fa01a0ead38a95992ba93c3812acf7ce50edc67caf0d79da57e164816a67f34","target":"record","created_at":"2026-05-18T00:45:38Z","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":"dbd5f09ead3a716db11f883d670a3d128c56284c03012bb24b44ce350665d22f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-28T04:05:29Z","title_canon_sha256":"d589b9e0c5ef156a9d228ebd049d0cc7df6b0ca0f770e777773cdcef198fee09"},"schema_version":"1.0","source":{"id":"1703.09394","kind":"arxiv","version":2}},"canonical_sha256":"f7c4557be11686f39927cb65c8937d46a270af4c34414045d85fb51f17a92dea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7c4557be11686f39927cb65c8937d46a270af4c34414045d85fb51f17a92dea","first_computed_at":"2026-05-18T00:45:38.950347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:38.950347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NmHuEx1p32pkJhj6ZcYczdukPok16s5A2Ld25pGEMks5/ctJq4hzcnNK4v1BUpsb+kayyKEWeG9VvWgeoLr9BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:38.951136Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.09394","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fa01a0ead38a95992ba93c3812acf7ce50edc67caf0d79da57e164816a67f34","sha256:a80a1f5e05153f1baf8f372afb8a061560dca01ac7f648f43c1d8edb0634d39a"],"state_sha256":"d02f2ba0581935135dde6ca5e6aa79a5694820b4591cf82fded5f3a5d3e203ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"InvC37J9HHZejVkX1xt7VmNZyfX+uTyQmtrXsWG2JDhtXtOJ+aFFzxouAriVx0f/6qxfgeThM56mkrvgPRcSBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T19:07:41.562845Z","bundle_sha256":"a94769b6b326c00a83646d7dfb41ccde3bee13aaf035035332952a39f077c298"}}