{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3OX4ASB77VDLO4YG4RN6JI52J7","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":"fbec7e1665ff1754928b545b3925b148306cfc9d0f41eeda5b2012de86d096cf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-06T15:59:09Z","title_canon_sha256":"e135bb788be2b1520b60b23d5133bc73d10af087cf7ff0cd9bcf20758efd2fb2"},"schema_version":"1.0","source":{"id":"1707.01846","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01846","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01846v1","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01846","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"pith_short_12","alias_value":"3OX4ASB77VDL","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3OX4ASB77VDLO4YG","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3OX4ASB7","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:15ee260eb5967fb3598b365c969d13371568ff76c6c70597ea5857b29775ed0c","target":"graph","created_at":"2026-05-18T00:40:47Z","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":"User pairing in Non-Orthogonal Multiple-Access (NOMA) uplink based on channel state information is investigated considering some predefined power allocation schemes. The base station divides the set of users into disjunct pairs and assigns the available resources to these pairs. The combinatorial problem of user pairing to achieve the maximum sum rate is analyzed in the large system limit for various scenarios, and some optimum and sub-optimum algorithms with a polynomial-time complexity are proposed. In the first scenario, $2M$ users and the base station have a single-antenna and communicate ","authors_text":"Mohammad A. Sedaghat, Ralf R. M\\\"uller","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-06T15:59:09Z","title":"On User Pairing in NOMA Uplink"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01846","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:12ee1f71220eaf5a8af5003588a81734cf6b01949fd6c7a9c6c94fc069e6097a","target":"record","created_at":"2026-05-18T00:40:47Z","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":"fbec7e1665ff1754928b545b3925b148306cfc9d0f41eeda5b2012de86d096cf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-06T15:59:09Z","title_canon_sha256":"e135bb788be2b1520b60b23d5133bc73d10af087cf7ff0cd9bcf20758efd2fb2"},"schema_version":"1.0","source":{"id":"1707.01846","kind":"arxiv","version":1}},"canonical_sha256":"dbafc0483ffd46b77306e45be4a3ba4ff4fa89876a6b658bf960f5c6c1eb5739","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbafc0483ffd46b77306e45be4a3ba4ff4fa89876a6b658bf960f5c6c1eb5739","first_computed_at":"2026-05-18T00:40:47.279274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:47.279274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tvA4FxFQ+xGR8XbYsnTi7dncFcnNWmpgbsF/KB/2zkxKnw9iURG8sZVWgZywwqH5PyHKsPnc9WyL1LAgrONzCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:47.279935Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01846","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12ee1f71220eaf5a8af5003588a81734cf6b01949fd6c7a9c6c94fc069e6097a","sha256:15ee260eb5967fb3598b365c969d13371568ff76c6c70597ea5857b29775ed0c"],"state_sha256":"e92e9333533d20fa82bf5b253934406a6eafa5c9f5fa989cb445b4f43e4aa9db"}