{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YBHMLA3L4IFISH67VP5PMWXLNA","short_pith_number":"pith:YBHMLA3L","schema_version":"1.0","canonical_sha256":"c04ec5836be20a891fdfabfaf65aeb68236f3017f56ad9e84c0edb40dfb62adf","source":{"kind":"arxiv","id":"2302.05645","version":1},"attestation_state":"computed","paper":{"title":"User Pairing and Power Allocation in Untrusted Multiuser NOMA for Internet-of-Things","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"AbbasJamalipour, Chaoying Yuan, Jingpeng Bai, Jun Shen, Kezhong Zhang, Wei Ni","submitted_at":"2023-02-11T10:17:13Z","abstract_excerpt":"In the Internet-of-Things (IoT), massive sensitive and confidential information is transmitted wirelessly, making security a serious concern. This is particularly true when technologies, such as non-orthogonal multiple access (NOMA), are used, making it possible for users to access each other's data. This paper studies secure communications in multiuser NOMA downlink systems, where each user is potentially an eavesdropper. Resource allocation is formulated to achieve the maximum sum secrecy rate, meanwhile satisfying the users' data requirements and power constraint. We solve this non-trivial,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2302.05645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-02-11T10:17:13Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"f38304859aa5464ccfee2872fe12e7ff05db56cfcd150f3817f76c280aeeeb1b","abstract_canon_sha256":"d7740f82b4f632f77bb315b2e32dfccf47b6cc741396e4e35544f508a65f6bf2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:40:56.308589Z","signature_b64":"uC22OhkhJK2rRqowOIfbH9CrM+9VVqPAwGYM4oV+DmGW5VzV4TdhTLUKpMrL3RbShP85PqarENGYO2MuNxcgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c04ec5836be20a891fdfabfaf65aeb68236f3017f56ad9e84c0edb40dfb62adf","last_reissued_at":"2026-07-05T05:40:56.307931Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:40:56.307931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"User Pairing and Power Allocation in Untrusted Multiuser NOMA for Internet-of-Things","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"AbbasJamalipour, Chaoying Yuan, Jingpeng Bai, Jun Shen, Kezhong Zhang, Wei Ni","submitted_at":"2023-02-11T10:17:13Z","abstract_excerpt":"In the Internet-of-Things (IoT), massive sensitive and confidential information is transmitted wirelessly, making security a serious concern. This is particularly true when technologies, such as non-orthogonal multiple access (NOMA), are used, making it possible for users to access each other's data. This paper studies secure communications in multiuser NOMA downlink systems, where each user is potentially an eavesdropper. Resource allocation is formulated to achieve the maximum sum secrecy rate, meanwhile satisfying the users' data requirements and power constraint. We solve this non-trivial,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.05645","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.05645/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2302.05645","created_at":"2026-07-05T05:40:56.307998+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.05645v1","created_at":"2026-07-05T05:40:56.307998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.05645","created_at":"2026-07-05T05:40:56.307998+00:00"},{"alias_kind":"pith_short_12","alias_value":"YBHMLA3L4IFI","created_at":"2026-07-05T05:40:56.307998+00:00"},{"alias_kind":"pith_short_16","alias_value":"YBHMLA3L4IFISH67","created_at":"2026-07-05T05:40:56.307998+00:00"},{"alias_kind":"pith_short_8","alias_value":"YBHMLA3L","created_at":"2026-07-05T05:40:56.307998+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.10951","citing_title":"TSFormer: A Robust Framework for Efficient UHD Image Restoration","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YBHMLA3L4IFISH67VP5PMWXLNA","json":"https://pith.science/pith/YBHMLA3L4IFISH67VP5PMWXLNA.json","graph_json":"https://pith.science/api/pith-number/YBHMLA3L4IFISH67VP5PMWXLNA/graph.json","events_json":"https://pith.science/api/pith-number/YBHMLA3L4IFISH67VP5PMWXLNA/events.json","paper":"https://pith.science/paper/YBHMLA3L"},"agent_actions":{"view_html":"https://pith.science/pith/YBHMLA3L4IFISH67VP5PMWXLNA","download_json":"https://pith.science/pith/YBHMLA3L4IFISH67VP5PMWXLNA.json","view_paper":"https://pith.science/paper/YBHMLA3L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.05645&json=true","fetch_graph":"https://pith.science/api/pith-number/YBHMLA3L4IFISH67VP5PMWXLNA/graph.json","fetch_events":"https://pith.science/api/pith-number/YBHMLA3L4IFISH67VP5PMWXLNA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YBHMLA3L4IFISH67VP5PMWXLNA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YBHMLA3L4IFISH67VP5PMWXLNA/action/storage_attestation","attest_author":"https://pith.science/pith/YBHMLA3L4IFISH67VP5PMWXLNA/action/author_attestation","sign_citation":"https://pith.science/pith/YBHMLA3L4IFISH67VP5PMWXLNA/action/citation_signature","submit_replication":"https://pith.science/pith/YBHMLA3L4IFISH67VP5PMWXLNA/action/replication_record"}},"created_at":"2026-07-05T05:40:56.307998+00:00","updated_at":"2026-07-05T05:40:56.307998+00:00"}