{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JGT2O2BHEMNJ65GB522BCRFUCS","short_pith_number":"pith:JGT2O2BH","canonical_record":{"source":{"id":"1803.04651","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-03-13T06:35:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"257b733514f039252c7bc00893c8988db3b2b8a3d9fca57244b2970999b3be69","abstract_canon_sha256":"a21253cc27d22fb4661bdfc75e49cc1c101c59c0e20be02fc3fe8b2e5f719c30"},"schema_version":"1.0"},"canonical_sha256":"49a7a76827231a9f74c1eeb41144b41498eae0fff49467bd0bb7105e3f5b6105","source":{"kind":"arxiv","id":"1803.04651","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04651","created_at":"2026-05-18T00:16:25Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04651v1","created_at":"2026-05-18T00:16:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04651","created_at":"2026-05-18T00:16:25Z"},{"alias_kind":"pith_short_12","alias_value":"JGT2O2BHEMNJ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JGT2O2BHEMNJ65GB","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JGT2O2BH","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JGT2O2BHEMNJ65GB522BCRFUCS","target":"record","payload":{"canonical_record":{"source":{"id":"1803.04651","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-03-13T06:35:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"257b733514f039252c7bc00893c8988db3b2b8a3d9fca57244b2970999b3be69","abstract_canon_sha256":"a21253cc27d22fb4661bdfc75e49cc1c101c59c0e20be02fc3fe8b2e5f719c30"},"schema_version":"1.0"},"canonical_sha256":"49a7a76827231a9f74c1eeb41144b41498eae0fff49467bd0bb7105e3f5b6105","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:25.296949Z","signature_b64":"5Az9J640eZOm1j/SdX/Taxzlnm482Cv8Vs52aB3/9HAHI74jgZVMwXXsKmnbLWjMmNnyukXVVv/1dhH9phbwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49a7a76827231a9f74c1eeb41144b41498eae0fff49467bd0bb7105e3f5b6105","last_reissued_at":"2026-05-18T00:16:25.296235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:25.296235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.04651","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:16:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mqEeqFlkV0U5OH3fZJgmq/C/Eq0oCyyb2ni9A5QvAG6HqI3khX4rgW/51ZVyWjam8dmU9JoBZhdfuuburb62BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:05:56.524453Z"},"content_sha256":"9091cfc6b9e5977463a66dd80e1ab1e9ba03f5e08494992a3f0e3675ea34cc47","schema_version":"1.0","event_id":"sha256:9091cfc6b9e5977463a66dd80e1ab1e9ba03f5e08494992a3f0e3675ea34cc47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JGT2O2BHEMNJ65GB522BCRFUCS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressive Sensing Based User Clustering for Downlink NOMA Systems with Decoding Power","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cunhua Pan, Ming Chen, Wei Xu, Zhaohui Yang","submitted_at":"2018-03-13T06:35:37Z","abstract_excerpt":"This letter investigates joint power control and user clustering for downlink non-orthogonal multiple access systems. Our aim is to minimize the total power consumption by taking into account not only the conventional transmission power but also the decoding power of the users. To solve this optimization problem, it is firstly transformed into an equivalent problem with tractable constraints. Then, an efficient algorithm is proposed to tackle the equivalent problem by using the techniques of reweighted 1-norm minimization and majorization-minimization. Numerical results validate the superiorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04651","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:16:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0hDpRqtZLx6CAaaJk559E125ww0ec8PINsPEIX4wsg+u2hBZ+k2ss33OfT9Dq94YY1X8lJtSQg71HTua7nDVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:05:56.525138Z"},"content_sha256":"f1fc20f7da0b381c8a6ae71615cd77d00eea113ff75ff5303d39fe727881ec9e","schema_version":"1.0","event_id":"sha256:f1fc20f7da0b381c8a6ae71615cd77d00eea113ff75ff5303d39fe727881ec9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGT2O2BHEMNJ65GB522BCRFUCS/bundle.json","state_url":"https://pith.science/pith/JGT2O2BHEMNJ65GB522BCRFUCS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGT2O2BHEMNJ65GB522BCRFUCS/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-07T22:05:56Z","links":{"resolver":"https://pith.science/pith/JGT2O2BHEMNJ65GB522BCRFUCS","bundle":"https://pith.science/pith/JGT2O2BHEMNJ65GB522BCRFUCS/bundle.json","state":"https://pith.science/pith/JGT2O2BHEMNJ65GB522BCRFUCS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGT2O2BHEMNJ65GB522BCRFUCS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JGT2O2BHEMNJ65GB522BCRFUCS","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":"a21253cc27d22fb4661bdfc75e49cc1c101c59c0e20be02fc3fe8b2e5f719c30","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-03-13T06:35:37Z","title_canon_sha256":"257b733514f039252c7bc00893c8988db3b2b8a3d9fca57244b2970999b3be69"},"schema_version":"1.0","source":{"id":"1803.04651","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04651","created_at":"2026-05-18T00:16:25Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04651v1","created_at":"2026-05-18T00:16:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04651","created_at":"2026-05-18T00:16:25Z"},{"alias_kind":"pith_short_12","alias_value":"JGT2O2BHEMNJ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JGT2O2BHEMNJ65GB","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JGT2O2BH","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:f1fc20f7da0b381c8a6ae71615cd77d00eea113ff75ff5303d39fe727881ec9e","target":"graph","created_at":"2026-05-18T00:16:25Z","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 letter investigates joint power control and user clustering for downlink non-orthogonal multiple access systems. Our aim is to minimize the total power consumption by taking into account not only the conventional transmission power but also the decoding power of the users. To solve this optimization problem, it is firstly transformed into an equivalent problem with tractable constraints. Then, an efficient algorithm is proposed to tackle the equivalent problem by using the techniques of reweighted 1-norm minimization and majorization-minimization. Numerical results validate the superiorit","authors_text":"Cunhua Pan, Ming Chen, Wei Xu, Zhaohui Yang","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-03-13T06:35:37Z","title":"Compressive Sensing Based User Clustering for Downlink NOMA Systems with Decoding Power"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04651","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:9091cfc6b9e5977463a66dd80e1ab1e9ba03f5e08494992a3f0e3675ea34cc47","target":"record","created_at":"2026-05-18T00:16:25Z","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":"a21253cc27d22fb4661bdfc75e49cc1c101c59c0e20be02fc3fe8b2e5f719c30","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-03-13T06:35:37Z","title_canon_sha256":"257b733514f039252c7bc00893c8988db3b2b8a3d9fca57244b2970999b3be69"},"schema_version":"1.0","source":{"id":"1803.04651","kind":"arxiv","version":1}},"canonical_sha256":"49a7a76827231a9f74c1eeb41144b41498eae0fff49467bd0bb7105e3f5b6105","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49a7a76827231a9f74c1eeb41144b41498eae0fff49467bd0bb7105e3f5b6105","first_computed_at":"2026-05-18T00:16:25.296235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:25.296235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Az9J640eZOm1j/SdX/Taxzlnm482Cv8Vs52aB3/9HAHI74jgZVMwXXsKmnbLWjMmNnyukXVVv/1dhH9phbwCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:25.296949Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04651","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9091cfc6b9e5977463a66dd80e1ab1e9ba03f5e08494992a3f0e3675ea34cc47","sha256:f1fc20f7da0b381c8a6ae71615cd77d00eea113ff75ff5303d39fe727881ec9e"],"state_sha256":"57a544ba47d3fc4eb470be8da58c53c5ce4f0b9308fd5ed80396feb4f70949a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FX/qcOtY9il9lBMNoW6IMmo8f34bMG5zr3PhFdP45WC4ySarrNo9x14TOdA+EhXdTiHgtgp7iKWYPiDOM2MEDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T22:05:56.528716Z","bundle_sha256":"bc3cec93ba243cc949e84788cf24b6579644bbaa1b094916bd88ae7691a8af52"}}