{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QPVSJ4SQPVUKNIRST7O4YSYZ5K","short_pith_number":"pith:QPVSJ4SQ","canonical_record":{"source":{"id":"1608.01081","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-03T06:00:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d728cb1a460ec7911fb616ca028a7a7004d0109359432266fa488a8dc26eaf06","abstract_canon_sha256":"d563b4750c9c5fe810759b08b20617e0f21cdbecb33723a9aa22317c1011593e"},"schema_version":"1.0"},"canonical_sha256":"83eb24f2507d68a6a2329fddcc4b19ea90302eef34997542c3a6e0fdf64c9a3d","source":{"kind":"arxiv","id":"1608.01081","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01081","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01081v1","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01081","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"QPVSJ4SQPVUK","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QPVSJ4SQPVUKNIRS","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QPVSJ4SQ","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QPVSJ4SQPVUKNIRST7O4YSYZ5K","target":"record","payload":{"canonical_record":{"source":{"id":"1608.01081","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-03T06:00:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d728cb1a460ec7911fb616ca028a7a7004d0109359432266fa488a8dc26eaf06","abstract_canon_sha256":"d563b4750c9c5fe810759b08b20617e0f21cdbecb33723a9aa22317c1011593e"},"schema_version":"1.0"},"canonical_sha256":"83eb24f2507d68a6a2329fddcc4b19ea90302eef34997542c3a6e0fdf64c9a3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:56.686453Z","signature_b64":"JHGAhW79QIJoYlFcaNc1ClcYFBdjG0yuJU+GNMZcZef5x95sFKTOjygLLwd8Y7LDYT3ICrS5X/4JHrueZ51wDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83eb24f2507d68a6a2329fddcc4b19ea90302eef34997542c3a6e0fdf64c9a3d","last_reissued_at":"2026-05-18T01:09:56.685691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:56.685691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.01081","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:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wFo7VixFfFXrvY5HBPhgZAIX2uVYWA/Xi/Ctdu1nLzKiVy0KWdi4UdcYpcCuSoLMmpbdtpFRB3z5fAN6DZq/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:14:34.693247Z"},"content_sha256":"79fb49e9cedb73358bc89aa259fb3ead55e340bf189f1cc179afc1d104d5fe10","schema_version":"1.0","event_id":"sha256:79fb49e9cedb73358bc89aa259fb3ead55e340bf189f1cc179afc1d104d5fe10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QPVSJ4SQPVUKNIRST7O4YSYZ5K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic User Clustering and Power Allocation for Uplink and Downlink Non-Orthogonal Multiple Access (NOMA) Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ekram Hossain, Hina Tabassum, Md Shipon Ali","submitted_at":"2016-08-03T06:00:30Z","abstract_excerpt":"In this paper, first we briefly describe the differences in the working principles of uplink and downlink NOMA transmissions. Then, for both uplink and downlink NOMA, we formulate a sum-throughput maximization problem in a cell such that the user clustering (i.e., grouping users into a single cluster or multiple clusters) and power allocations in NOMA cluster(s) can be optimized under transmission power constraints, minimum rate requirements of the users, and SIC constraints. Due to the combinatorial nature of the formulated mixed integer non-linear programming (MINLP) problem, we solve the pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01081","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:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SLNa+iBENvBgcZfPGy72efssceZ/h4IFnG549wly4T/DZLcB4xFhOS3xTPgI0KqPH9MJ93bMMrlAbgZLqrK+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:14:34.693920Z"},"content_sha256":"34447d6d94b0584904a77691c56e91fa48ba46d3507774b06d1a1c292257670b","schema_version":"1.0","event_id":"sha256:34447d6d94b0584904a77691c56e91fa48ba46d3507774b06d1a1c292257670b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QPVSJ4SQPVUKNIRST7O4YSYZ5K/bundle.json","state_url":"https://pith.science/pith/QPVSJ4SQPVUKNIRST7O4YSYZ5K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QPVSJ4SQPVUKNIRST7O4YSYZ5K/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-31T06:14:34Z","links":{"resolver":"https://pith.science/pith/QPVSJ4SQPVUKNIRST7O4YSYZ5K","bundle":"https://pith.science/pith/QPVSJ4SQPVUKNIRST7O4YSYZ5K/bundle.json","state":"https://pith.science/pith/QPVSJ4SQPVUKNIRST7O4YSYZ5K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QPVSJ4SQPVUKNIRST7O4YSYZ5K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QPVSJ4SQPVUKNIRST7O4YSYZ5K","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":"d563b4750c9c5fe810759b08b20617e0f21cdbecb33723a9aa22317c1011593e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-03T06:00:30Z","title_canon_sha256":"d728cb1a460ec7911fb616ca028a7a7004d0109359432266fa488a8dc26eaf06"},"schema_version":"1.0","source":{"id":"1608.01081","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01081","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01081v1","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01081","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"QPVSJ4SQPVUK","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QPVSJ4SQPVUKNIRS","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QPVSJ4SQ","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:34447d6d94b0584904a77691c56e91fa48ba46d3507774b06d1a1c292257670b","target":"graph","created_at":"2026-05-18T01:09:56Z","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, first we briefly describe the differences in the working principles of uplink and downlink NOMA transmissions. Then, for both uplink and downlink NOMA, we formulate a sum-throughput maximization problem in a cell such that the user clustering (i.e., grouping users into a single cluster or multiple clusters) and power allocations in NOMA cluster(s) can be optimized under transmission power constraints, minimum rate requirements of the users, and SIC constraints. Due to the combinatorial nature of the formulated mixed integer non-linear programming (MINLP) problem, we solve the pr","authors_text":"Ekram Hossain, Hina Tabassum, Md Shipon Ali","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-03T06:00:30Z","title":"Dynamic User Clustering and Power Allocation for Uplink and Downlink Non-Orthogonal Multiple Access (NOMA) Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01081","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:79fb49e9cedb73358bc89aa259fb3ead55e340bf189f1cc179afc1d104d5fe10","target":"record","created_at":"2026-05-18T01:09:56Z","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":"d563b4750c9c5fe810759b08b20617e0f21cdbecb33723a9aa22317c1011593e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-03T06:00:30Z","title_canon_sha256":"d728cb1a460ec7911fb616ca028a7a7004d0109359432266fa488a8dc26eaf06"},"schema_version":"1.0","source":{"id":"1608.01081","kind":"arxiv","version":1}},"canonical_sha256":"83eb24f2507d68a6a2329fddcc4b19ea90302eef34997542c3a6e0fdf64c9a3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83eb24f2507d68a6a2329fddcc4b19ea90302eef34997542c3a6e0fdf64c9a3d","first_computed_at":"2026-05-18T01:09:56.685691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:56.685691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JHGAhW79QIJoYlFcaNc1ClcYFBdjG0yuJU+GNMZcZef5x95sFKTOjygLLwd8Y7LDYT3ICrS5X/4JHrueZ51wDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:56.686453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01081","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79fb49e9cedb73358bc89aa259fb3ead55e340bf189f1cc179afc1d104d5fe10","sha256:34447d6d94b0584904a77691c56e91fa48ba46d3507774b06d1a1c292257670b"],"state_sha256":"3a85c5a0c0b8a6b036ab09f40f45d27e5defc1c24f1923070cf64a29d1be0a97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0WMwqZQbS4rjNFBtncjp2/USOBWSFn9aFA6ps4rABRyisEUYM1hb+2CQRd8W9RZRzDZEl8n8berFCNDPev3QCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:14:34.696513Z","bundle_sha256":"268b8e2a8d73cb9f3ce708457101a02efdcf70790887cc22980bbfe77e803b62"}}