{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XVRDR3B6AAQD6K3ZMUK2TUG2GQ","short_pith_number":"pith:XVRDR3B6","canonical_record":{"source":{"id":"1812.11490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-30T08:38:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e361b84100c0c71108999eeacf255ce09e115ba14bac96500488fd93f5941456","abstract_canon_sha256":"2bf9d8a62548ff0577e8ccd9fd316879e979463e4547e1b0cbec60537f241dcf"},"schema_version":"1.0"},"canonical_sha256":"bd6238ec3e00203f2b796515a9d0da3438ed28041e8e1088d434267377aabf86","source":{"kind":"arxiv","id":"1812.11490","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11490","created_at":"2026-05-17T23:57:11Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11490v1","created_at":"2026-05-17T23:57:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11490","created_at":"2026-05-17T23:57:11Z"},{"alias_kind":"pith_short_12","alias_value":"XVRDR3B6AAQD","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XVRDR3B6AAQD6K3Z","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XVRDR3B6","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XVRDR3B6AAQD6K3ZMUK2TUG2GQ","target":"record","payload":{"canonical_record":{"source":{"id":"1812.11490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-30T08:38:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e361b84100c0c71108999eeacf255ce09e115ba14bac96500488fd93f5941456","abstract_canon_sha256":"2bf9d8a62548ff0577e8ccd9fd316879e979463e4547e1b0cbec60537f241dcf"},"schema_version":"1.0"},"canonical_sha256":"bd6238ec3e00203f2b796515a9d0da3438ed28041e8e1088d434267377aabf86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:11.821529Z","signature_b64":"0GXPlPZ+LT1yhAO/sj4tB8zOR8saY5yTJpgWKbWZzlAXo/JG945NvSHTocus/uPUCGXuhZA5Cfs4mQpEo5HADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd6238ec3e00203f2b796515a9d0da3438ed28041e8e1088d434267377aabf86","last_reissued_at":"2026-05-17T23:57:11.821149Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:11.821149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.11490","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-17T23:57:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nkEk8y2PtCSBWR1B/G2bIPeeG6blWgM2mkk74B/KS2WGrAkjgAOvrYGYPvb+aGtnT2HgAqYXSV5hZ0uNkGM6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T08:30:33.364420Z"},"content_sha256":"b4403e6dc37f179fe2d1f939f0b996111ced253062b8df0e84db7eed672d608e","schema_version":"1.0","event_id":"sha256:b4403e6dc37f179fe2d1f939f0b996111ced253062b8df0e84db7eed672d608e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XVRDR3B6AAQD6K3ZMUK2TUG2GQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal User Pairing for Achieving Rate Fairness in Downlink NOMA Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hieu V. Nguyen, Oh-Soon Shin, Phu X. Nguyen, Van-Dinh Nguyen, Van-Phuc Bui","submitted_at":"2018-12-30T08:38:09Z","abstract_excerpt":"In this paper, a downlink non-orthogonal multiple access (NOMA) network is studied. We investigate the problem of jointly optimizing user pairing and beamforming design to maximize the minimum rate among all users. The considered problem belongs to a difficult class of mixed-integer nonconvex optimization programming. We first relax the binary constraints and adopt sequential convex approximation method to solve the relaxed problem, which is guaranteed to converge at least to a locally optimal solution. Numerical results show that the proposed method attains higher rate fairness among users, c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11490","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-17T23:57:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W1zxzu55W+5ZyPM+dEEISDx6YpvBtv7PWls1OxD82LGxzL30iqLEcZL5SZDI4Y1SCxEr/IN2OfiEAepk8vaFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T08:30:33.364784Z"},"content_sha256":"1590589b9d58f5c617df5f9e8ebbf09c8bd4923491292d76eda00341e1f7b32b","schema_version":"1.0","event_id":"sha256:1590589b9d58f5c617df5f9e8ebbf09c8bd4923491292d76eda00341e1f7b32b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XVRDR3B6AAQD6K3ZMUK2TUG2GQ/bundle.json","state_url":"https://pith.science/pith/XVRDR3B6AAQD6K3ZMUK2TUG2GQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XVRDR3B6AAQD6K3ZMUK2TUG2GQ/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-07-01T08:30:33Z","links":{"resolver":"https://pith.science/pith/XVRDR3B6AAQD6K3ZMUK2TUG2GQ","bundle":"https://pith.science/pith/XVRDR3B6AAQD6K3ZMUK2TUG2GQ/bundle.json","state":"https://pith.science/pith/XVRDR3B6AAQD6K3ZMUK2TUG2GQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XVRDR3B6AAQD6K3ZMUK2TUG2GQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XVRDR3B6AAQD6K3ZMUK2TUG2GQ","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":"2bf9d8a62548ff0577e8ccd9fd316879e979463e4547e1b0cbec60537f241dcf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-30T08:38:09Z","title_canon_sha256":"e361b84100c0c71108999eeacf255ce09e115ba14bac96500488fd93f5941456"},"schema_version":"1.0","source":{"id":"1812.11490","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.11490","created_at":"2026-05-17T23:57:11Z"},{"alias_kind":"arxiv_version","alias_value":"1812.11490v1","created_at":"2026-05-17T23:57:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.11490","created_at":"2026-05-17T23:57:11Z"},{"alias_kind":"pith_short_12","alias_value":"XVRDR3B6AAQD","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XVRDR3B6AAQD6K3Z","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XVRDR3B6","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:1590589b9d58f5c617df5f9e8ebbf09c8bd4923491292d76eda00341e1f7b32b","target":"graph","created_at":"2026-05-17T23:57: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":"In this paper, a downlink non-orthogonal multiple access (NOMA) network is studied. We investigate the problem of jointly optimizing user pairing and beamforming design to maximize the minimum rate among all users. The considered problem belongs to a difficult class of mixed-integer nonconvex optimization programming. We first relax the binary constraints and adopt sequential convex approximation method to solve the relaxed problem, which is guaranteed to converge at least to a locally optimal solution. Numerical results show that the proposed method attains higher rate fairness among users, c","authors_text":"Hieu V. Nguyen, Oh-Soon Shin, Phu X. Nguyen, Van-Dinh Nguyen, Van-Phuc Bui","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-30T08:38:09Z","title":"Optimal User Pairing for Achieving Rate Fairness in Downlink NOMA Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.11490","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:b4403e6dc37f179fe2d1f939f0b996111ced253062b8df0e84db7eed672d608e","target":"record","created_at":"2026-05-17T23:57: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":"2bf9d8a62548ff0577e8ccd9fd316879e979463e4547e1b0cbec60537f241dcf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-30T08:38:09Z","title_canon_sha256":"e361b84100c0c71108999eeacf255ce09e115ba14bac96500488fd93f5941456"},"schema_version":"1.0","source":{"id":"1812.11490","kind":"arxiv","version":1}},"canonical_sha256":"bd6238ec3e00203f2b796515a9d0da3438ed28041e8e1088d434267377aabf86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd6238ec3e00203f2b796515a9d0da3438ed28041e8e1088d434267377aabf86","first_computed_at":"2026-05-17T23:57:11.821149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:11.821149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0GXPlPZ+LT1yhAO/sj4tB8zOR8saY5yTJpgWKbWZzlAXo/JG945NvSHTocus/uPUCGXuhZA5Cfs4mQpEo5HADQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:11.821529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.11490","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4403e6dc37f179fe2d1f939f0b996111ced253062b8df0e84db7eed672d608e","sha256:1590589b9d58f5c617df5f9e8ebbf09c8bd4923491292d76eda00341e1f7b32b"],"state_sha256":"9c0c0b06049f6446b2725dbf9e7916ecbb60718054e77dda9d917c5945c10647"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WSupeZmwrVxQK2rINtAREXxqkVRQIqHXhKKVZ9qKLLQsBvDhfHgrRBogcxEpcDIvHQklUPK/ghXaQktZ+7WpCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T08:30:33.367022Z","bundle_sha256":"ebe44c1c973975288838a4c2e7bb508ccaad152b47ab2891b55666b3e88120c3"}}