{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:HJYPBUJSM37KYHM55YD5QYXKYS","short_pith_number":"pith:HJYPBUJS","canonical_record":{"source":{"id":"2306.13693","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-06-23T10:19:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"97b2beb2ef8a8eaeced6bc3b72f1a2645cf739d370f5d8968eb20c8d7655a3e4","abstract_canon_sha256":"388ef84fe98d869594f44ec20caf6d0a11392e6377854a31b1221b5f340ca356"},"schema_version":"1.0"},"canonical_sha256":"3a70f0d13266feac1d9dee07d862eac48cc5fc6a2556bce23660c6e9ae6d7321","source":{"kind":"arxiv","id":"2306.13693","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.13693","created_at":"2026-07-05T07:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"2306.13693v2","created_at":"2026-07-05T07:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.13693","created_at":"2026-07-05T07:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"HJYPBUJSM37K","created_at":"2026-07-05T07:21:42Z"},{"alias_kind":"pith_short_16","alias_value":"HJYPBUJSM37KYHM5","created_at":"2026-07-05T07:21:42Z"},{"alias_kind":"pith_short_8","alias_value":"HJYPBUJS","created_at":"2026-07-05T07:21:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:HJYPBUJSM37KYHM55YD5QYXKYS","target":"record","payload":{"canonical_record":{"source":{"id":"2306.13693","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-06-23T10:19:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"97b2beb2ef8a8eaeced6bc3b72f1a2645cf739d370f5d8968eb20c8d7655a3e4","abstract_canon_sha256":"388ef84fe98d869594f44ec20caf6d0a11392e6377854a31b1221b5f340ca356"},"schema_version":"1.0"},"canonical_sha256":"3a70f0d13266feac1d9dee07d862eac48cc5fc6a2556bce23660c6e9ae6d7321","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:21:42.849964Z","signature_b64":"H40Yu/7LvELeQA2WsP3gLKE4Z6tt0htRsdc8YJBYgY+WWWb3hpR6vuG20CtgFAemAYn9oJPIPl/EIUMmya4TAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a70f0d13266feac1d9dee07d862eac48cc5fc6a2556bce23660c6e9ae6d7321","last_reissued_at":"2026-07-05T07:21:42.849531Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:21:42.849531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.13693","source_version":2,"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-07-05T07:21:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sewjgJYahEy0NyGVZ82RQWUfU/GYHQXVFyJCKJcPB7qyL/BRkxSC6698CzNT2HsOHfmyZBkNNmFLAiwLHv/5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T05:14:30.848694Z"},"content_sha256":"ebd4d93ab9d687845defbfaa88643b6e8242a0955f75a9f6670a6f758f2d702c","schema_version":"1.0","event_id":"sha256:ebd4d93ab9d687845defbfaa88643b6e8242a0955f75a9f6670a6f758f2d702c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:HJYPBUJSM37KYHM55YD5QYXKYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RSMA for Overloaded MIMO Networks: Low-Complexity Design for Max-Min Fairness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ata Sattarzadeh, Onur Dizdar, Stephen Wang, Yi Xien Yap","submitted_at":"2023-06-23T10:19:26Z","abstract_excerpt":"Rate-Splitting Multiple Access (RSMA) is a robust multiple access scheme for multi-antenna wireless networks. In this work, we study the performance of RSMA in downlink overloaded networks, where the number of transmit antennas is smaller than the number of users. We provide analysis and closed-form solutions for optimal power and rate allocations that maximize max-min fairness when low-complexity precoding schemes are employed. The derived closed-form solutions are used to propose a low-complexity RSMA system design for precoder selection and resource allocation for arbitrary number of users "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.13693","kind":"arxiv","version":2},"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/2306.13693/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"},"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-07-05T07:21:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"feKNA6wXgfMIB5GTFDLKzvOTKUyXPAwMkpHuFI24SX0b3pmBClCN1EzzHv86j9yUU4SlfIWxUHFqdXkNSNNpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T05:14:30.849211Z"},"content_sha256":"f8f91b303859fdbc0c3fbebbc51a0929ddd7c9b7b4fa6ef23cad9ad7b994c3ff","schema_version":"1.0","event_id":"sha256:f8f91b303859fdbc0c3fbebbc51a0929ddd7c9b7b4fa6ef23cad9ad7b994c3ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJYPBUJSM37KYHM55YD5QYXKYS/bundle.json","state_url":"https://pith.science/pith/HJYPBUJSM37KYHM55YD5QYXKYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJYPBUJSM37KYHM55YD5QYXKYS/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-08-04T05:14:30Z","links":{"resolver":"https://pith.science/pith/HJYPBUJSM37KYHM55YD5QYXKYS","bundle":"https://pith.science/pith/HJYPBUJSM37KYHM55YD5QYXKYS/bundle.json","state":"https://pith.science/pith/HJYPBUJSM37KYHM55YD5QYXKYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJYPBUJSM37KYHM55YD5QYXKYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:HJYPBUJSM37KYHM55YD5QYXKYS","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":"388ef84fe98d869594f44ec20caf6d0a11392e6377854a31b1221b5f340ca356","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-06-23T10:19:26Z","title_canon_sha256":"97b2beb2ef8a8eaeced6bc3b72f1a2645cf739d370f5d8968eb20c8d7655a3e4"},"schema_version":"1.0","source":{"id":"2306.13693","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.13693","created_at":"2026-07-05T07:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"2306.13693v2","created_at":"2026-07-05T07:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.13693","created_at":"2026-07-05T07:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"HJYPBUJSM37K","created_at":"2026-07-05T07:21:42Z"},{"alias_kind":"pith_short_16","alias_value":"HJYPBUJSM37KYHM5","created_at":"2026-07-05T07:21:42Z"},{"alias_kind":"pith_short_8","alias_value":"HJYPBUJS","created_at":"2026-07-05T07:21:42Z"}],"graph_snapshots":[{"event_id":"sha256:f8f91b303859fdbc0c3fbebbc51a0929ddd7c9b7b4fa6ef23cad9ad7b994c3ff","target":"graph","created_at":"2026-07-05T07:21:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2306.13693/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Rate-Splitting Multiple Access (RSMA) is a robust multiple access scheme for multi-antenna wireless networks. In this work, we study the performance of RSMA in downlink overloaded networks, where the number of transmit antennas is smaller than the number of users. We provide analysis and closed-form solutions for optimal power and rate allocations that maximize max-min fairness when low-complexity precoding schemes are employed. The derived closed-form solutions are used to propose a low-complexity RSMA system design for precoder selection and resource allocation for arbitrary number of users ","authors_text":"Ata Sattarzadeh, Onur Dizdar, Stephen Wang, Yi Xien Yap","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-06-23T10:19:26Z","title":"RSMA for Overloaded MIMO Networks: Low-Complexity Design for Max-Min Fairness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.13693","kind":"arxiv","version":2},"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:ebd4d93ab9d687845defbfaa88643b6e8242a0955f75a9f6670a6f758f2d702c","target":"record","created_at":"2026-07-05T07:21:42Z","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":"388ef84fe98d869594f44ec20caf6d0a11392e6377854a31b1221b5f340ca356","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-06-23T10:19:26Z","title_canon_sha256":"97b2beb2ef8a8eaeced6bc3b72f1a2645cf739d370f5d8968eb20c8d7655a3e4"},"schema_version":"1.0","source":{"id":"2306.13693","kind":"arxiv","version":2}},"canonical_sha256":"3a70f0d13266feac1d9dee07d862eac48cc5fc6a2556bce23660c6e9ae6d7321","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a70f0d13266feac1d9dee07d862eac48cc5fc6a2556bce23660c6e9ae6d7321","first_computed_at":"2026-07-05T07:21:42.849531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:21:42.849531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H40Yu/7LvELeQA2WsP3gLKE4Z6tt0htRsdc8YJBYgY+WWWb3hpR6vuG20CtgFAemAYn9oJPIPl/EIUMmya4TAw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:21:42.849964Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.13693","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebd4d93ab9d687845defbfaa88643b6e8242a0955f75a9f6670a6f758f2d702c","sha256:f8f91b303859fdbc0c3fbebbc51a0929ddd7c9b7b4fa6ef23cad9ad7b994c3ff"],"state_sha256":"13d03c3cbca07dc92b8eca4d1c70212bba19c0cb7daed3ad656bc4517c71a5ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VfeYc3EyBEvFmQY7iSBw94gnciivfk2yk1nQG1Kh64gpQImQkoLQy0rzu1DyOn/LF9LzgBAnpTXy6bQP1jlZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T05:14:30.853705Z","bundle_sha256":"fbd030400d8810e0fef0220be69744c6334176526fb62acc582b8cbbaaeb6ddf"}}