{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QPHPMTB45OI4KJ34MRPVAWOT6V","short_pith_number":"pith:QPHPMTB4","schema_version":"1.0","canonical_sha256":"83cef64c3ceb91c5277c645f5059d3f5447ba69781c3bf2bd899fdea68cb9548","source":{"kind":"arxiv","id":"1403.6931","version":1},"attestation_state":"computed","paper":{"title":"A New Approach to User Scheduling in Massive Multi-User MIMO Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gilwon Lee, Youngchul Sung","submitted_at":"2014-03-27T07:09:00Z","abstract_excerpt":"In this paper, a new user-scheduling-and-beamforming method is proposed for multi-user massive multiple-input multiple-output (massive MIMO) broadcast channels in the context of two-stage beamforming. The key ideas of the proposed scheduling method are 1) to use a set of orthogonal reference beams and construct a double cone around each reference beam to select `nearly-optimal' semi-orthogonal users based only on channel quality indicator (CQI) feedback and 2) to apply post-user-selection beam refinement with zero-forcing beamforming (ZFBF) based on channel state information (CSI) feedback onl"},"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":"1403.6931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-27T07:09:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"511b1687bc0e99c33eb1eacad287811c1b738b7ca52802bb7cb5a372231d9844","abstract_canon_sha256":"7ca79a62926b5089f715df24ea687f37318732002857adf6711e077bb06f8a2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:26.852066Z","signature_b64":"6njlpMoYJaBMibMUn9INGdrQd0JCZBxTuYtgd81dvE9yEMw1hbaLPhtRXxMt80FWilBih2PVjU58IgksFp1SCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83cef64c3ceb91c5277c645f5059d3f5447ba69781c3bf2bd899fdea68cb9548","last_reissued_at":"2026-05-18T02:55:26.851562Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:26.851562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Approach to User Scheduling in Massive Multi-User MIMO Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gilwon Lee, Youngchul Sung","submitted_at":"2014-03-27T07:09:00Z","abstract_excerpt":"In this paper, a new user-scheduling-and-beamforming method is proposed for multi-user massive multiple-input multiple-output (massive MIMO) broadcast channels in the context of two-stage beamforming. The key ideas of the proposed scheduling method are 1) to use a set of orthogonal reference beams and construct a double cone around each reference beam to select `nearly-optimal' semi-orthogonal users based only on channel quality indicator (CQI) feedback and 2) to apply post-user-selection beam refinement with zero-forcing beamforming (ZFBF) based on channel state information (CSI) feedback onl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6931","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.6931","created_at":"2026-05-18T02:55:26.851639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.6931v1","created_at":"2026-05-18T02:55:26.851639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6931","created_at":"2026-05-18T02:55:26.851639+00:00"},{"alias_kind":"pith_short_12","alias_value":"QPHPMTB45OI4","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QPHPMTB45OI4KJ34","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QPHPMTB4","created_at":"2026-05-18T12:28:46.137349+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.01865","citing_title":"Evaluation of Low Complexity Massive MIMO Techniques Under Realistic Channel Conditions","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QPHPMTB45OI4KJ34MRPVAWOT6V","json":"https://pith.science/pith/QPHPMTB45OI4KJ34MRPVAWOT6V.json","graph_json":"https://pith.science/api/pith-number/QPHPMTB45OI4KJ34MRPVAWOT6V/graph.json","events_json":"https://pith.science/api/pith-number/QPHPMTB45OI4KJ34MRPVAWOT6V/events.json","paper":"https://pith.science/paper/QPHPMTB4"},"agent_actions":{"view_html":"https://pith.science/pith/QPHPMTB45OI4KJ34MRPVAWOT6V","download_json":"https://pith.science/pith/QPHPMTB45OI4KJ34MRPVAWOT6V.json","view_paper":"https://pith.science/paper/QPHPMTB4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.6931&json=true","fetch_graph":"https://pith.science/api/pith-number/QPHPMTB45OI4KJ34MRPVAWOT6V/graph.json","fetch_events":"https://pith.science/api/pith-number/QPHPMTB45OI4KJ34MRPVAWOT6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QPHPMTB45OI4KJ34MRPVAWOT6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QPHPMTB45OI4KJ34MRPVAWOT6V/action/storage_attestation","attest_author":"https://pith.science/pith/QPHPMTB45OI4KJ34MRPVAWOT6V/action/author_attestation","sign_citation":"https://pith.science/pith/QPHPMTB45OI4KJ34MRPVAWOT6V/action/citation_signature","submit_replication":"https://pith.science/pith/QPHPMTB45OI4KJ34MRPVAWOT6V/action/replication_record"}},"created_at":"2026-05-18T02:55:26.851639+00:00","updated_at":"2026-05-18T02:55:26.851639+00:00"}