{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:QQ3K74CUS6YP377XND4XBTRHZ4","short_pith_number":"pith:QQ3K74CU","canonical_record":{"source":{"id":"2112.01738","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-12-03T06:35:41Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"e2bf1459cb50e0df44f9c4f30c4a65993c604ab10a18ea16137317ab8571cb46","abstract_canon_sha256":"ea3b0a53b088253f24dc5b0606328a8b8b5b5ed51f159251b358e85be7803241"},"schema_version":"1.0"},"canonical_sha256":"8436aff05497b0fdfff768f970ce27cf2d1c9e86691a4c5124b716fd525b07d0","source":{"kind":"arxiv","id":"2112.01738","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.01738","created_at":"2026-07-05T04:37:03Z"},{"alias_kind":"arxiv_version","alias_value":"2112.01738v2","created_at":"2026-07-05T04:37:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.01738","created_at":"2026-07-05T04:37:03Z"},{"alias_kind":"pith_short_12","alias_value":"QQ3K74CUS6YP","created_at":"2026-07-05T04:37:03Z"},{"alias_kind":"pith_short_16","alias_value":"QQ3K74CUS6YP377X","created_at":"2026-07-05T04:37:03Z"},{"alias_kind":"pith_short_8","alias_value":"QQ3K74CU","created_at":"2026-07-05T04:37:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:QQ3K74CUS6YP377XND4XBTRHZ4","target":"record","payload":{"canonical_record":{"source":{"id":"2112.01738","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-12-03T06:35:41Z","cross_cats_sorted":["eess.SP","math.IT"],"title_canon_sha256":"e2bf1459cb50e0df44f9c4f30c4a65993c604ab10a18ea16137317ab8571cb46","abstract_canon_sha256":"ea3b0a53b088253f24dc5b0606328a8b8b5b5ed51f159251b358e85be7803241"},"schema_version":"1.0"},"canonical_sha256":"8436aff05497b0fdfff768f970ce27cf2d1c9e86691a4c5124b716fd525b07d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:37:03.152910Z","signature_b64":"r7UcJTTCRdCGsz6HCrDOz+CPHkG7nnMlEQldmw0Q79hUNwao0ZxEqW0GmXp3wylc/ar7nsp4ty27DgPtiANQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8436aff05497b0fdfff768f970ce27cf2d1c9e86691a4c5124b716fd525b07d0","last_reissued_at":"2026-07-05T04:37:03.152481Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:37:03.152481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.01738","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-05T04:37:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OX1ar/MvR1kgHLcXFhntwjSmzOoghUZBs/yVNXSboERWvd+AsGApKiXebXd5/Lhh7I21YiH0tesYTIDW0UwbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:18:45.351179Z"},"content_sha256":"de318bed014ff1e17306bbdf1325699b4da41702359837e85d43894bc7ede918","schema_version":"1.0","event_id":"sha256:de318bed014ff1e17306bbdf1325699b4da41702359837e85d43894bc7ede918"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:QQ3K74CUS6YP377XND4XBTRHZ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint User Scheduling and Beamforming Design for Multiuser MISO Downlink Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"J. Yuan, S. He, W. Huang, Y. Huang, Y. Zhang, Z. An","submitted_at":"2021-12-03T06:35:41Z","abstract_excerpt":"In multiuser communication systems, user scheduling and beamforming (US-BF) design are two fundamental problems that are usually studied separately in the existing literature. In this work, we focus on the joint US-BF design with the goal of maximizing the set cardinality of scheduled users, which is computationally challenging due to the non-convex objective function and the coupled constraints with discrete-continuous variables. To tackle these difficulties, a successive convex approximation based US-BF (SCA-USBF) optimization algorithm is firstly proposed. Then, inspired by wireless intelli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.01738","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/2112.01738/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-05T04:37:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uJ3g27WDsqT8oNw0PvE/iS14uoHNd0V0F8CeA8+vqz8l1W+Zs+oKNfXkNgRaZDuy4wCHYDcHYZccuiLCm+fjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:18:45.351701Z"},"content_sha256":"48b1b9d2068725052fd5627de359fb82e88aab56a07963c49bb3090b29214953","schema_version":"1.0","event_id":"sha256:48b1b9d2068725052fd5627de359fb82e88aab56a07963c49bb3090b29214953"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQ3K74CUS6YP377XND4XBTRHZ4/bundle.json","state_url":"https://pith.science/pith/QQ3K74CUS6YP377XND4XBTRHZ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQ3K74CUS6YP377XND4XBTRHZ4/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-03T18:18:45Z","links":{"resolver":"https://pith.science/pith/QQ3K74CUS6YP377XND4XBTRHZ4","bundle":"https://pith.science/pith/QQ3K74CUS6YP377XND4XBTRHZ4/bundle.json","state":"https://pith.science/pith/QQ3K74CUS6YP377XND4XBTRHZ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQ3K74CUS6YP377XND4XBTRHZ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:QQ3K74CUS6YP377XND4XBTRHZ4","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":"ea3b0a53b088253f24dc5b0606328a8b8b5b5ed51f159251b358e85be7803241","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-12-03T06:35:41Z","title_canon_sha256":"e2bf1459cb50e0df44f9c4f30c4a65993c604ab10a18ea16137317ab8571cb46"},"schema_version":"1.0","source":{"id":"2112.01738","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.01738","created_at":"2026-07-05T04:37:03Z"},{"alias_kind":"arxiv_version","alias_value":"2112.01738v2","created_at":"2026-07-05T04:37:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.01738","created_at":"2026-07-05T04:37:03Z"},{"alias_kind":"pith_short_12","alias_value":"QQ3K74CUS6YP","created_at":"2026-07-05T04:37:03Z"},{"alias_kind":"pith_short_16","alias_value":"QQ3K74CUS6YP377X","created_at":"2026-07-05T04:37:03Z"},{"alias_kind":"pith_short_8","alias_value":"QQ3K74CU","created_at":"2026-07-05T04:37:03Z"}],"graph_snapshots":[{"event_id":"sha256:48b1b9d2068725052fd5627de359fb82e88aab56a07963c49bb3090b29214953","target":"graph","created_at":"2026-07-05T04:37:03Z","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/2112.01738/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In multiuser communication systems, user scheduling and beamforming (US-BF) design are two fundamental problems that are usually studied separately in the existing literature. In this work, we focus on the joint US-BF design with the goal of maximizing the set cardinality of scheduled users, which is computationally challenging due to the non-convex objective function and the coupled constraints with discrete-continuous variables. To tackle these difficulties, a successive convex approximation based US-BF (SCA-USBF) optimization algorithm is firstly proposed. Then, inspired by wireless intelli","authors_text":"J. Yuan, S. He, W. Huang, Y. Huang, Y. Zhang, Z. An","cross_cats":["eess.SP","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-12-03T06:35:41Z","title":"Joint User Scheduling and Beamforming Design for Multiuser MISO Downlink Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.01738","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:de318bed014ff1e17306bbdf1325699b4da41702359837e85d43894bc7ede918","target":"record","created_at":"2026-07-05T04:37:03Z","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":"ea3b0a53b088253f24dc5b0606328a8b8b5b5ed51f159251b358e85be7803241","cross_cats_sorted":["eess.SP","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2021-12-03T06:35:41Z","title_canon_sha256":"e2bf1459cb50e0df44f9c4f30c4a65993c604ab10a18ea16137317ab8571cb46"},"schema_version":"1.0","source":{"id":"2112.01738","kind":"arxiv","version":2}},"canonical_sha256":"8436aff05497b0fdfff768f970ce27cf2d1c9e86691a4c5124b716fd525b07d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8436aff05497b0fdfff768f970ce27cf2d1c9e86691a4c5124b716fd525b07d0","first_computed_at":"2026-07-05T04:37:03.152481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:37:03.152481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r7UcJTTCRdCGsz6HCrDOz+CPHkG7nnMlEQldmw0Q79hUNwao0ZxEqW0GmXp3wylc/ar7nsp4ty27DgPtiANQCw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:37:03.152910Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.01738","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de318bed014ff1e17306bbdf1325699b4da41702359837e85d43894bc7ede918","sha256:48b1b9d2068725052fd5627de359fb82e88aab56a07963c49bb3090b29214953"],"state_sha256":"17683f3f3941ca9ff1110c1b137b3f94ffcbc1e794c61d7e616fa97196798b52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yiXvwzzYyf7iG9lZx3AwGwwsz+i/3LgjMe4xMJVlkTMgJhc8TnwCDYFdT1P9oTF6BPxYtVGDMqh45Q5yD7MKDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:18:45.357538Z","bundle_sha256":"889ad37b90bb17a9ce26c73f9c526ac85c5fa4568a0bd87781ef7fbf419dd0d3"}}