{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UGISAXDSMZY6PDF2KK34PCMZUG","short_pith_number":"pith:UGISAXDS","schema_version":"1.0","canonical_sha256":"a191205c726671e78cba52b7c78999a18e4573a4fa8e157194f308a827f2447f","source":{"kind":"arxiv","id":"1812.01241","version":1},"attestation_state":"computed","paper":{"title":"Hypergraph matching for MU-MIMO user grouping in wireless LANs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"eess.SP","authors_text":"Jeffrey H. Reed, Qinghai Gao, Vuk Marojevic, Xiaofu Ma","submitted_at":"2018-12-04T06:27:22Z","abstract_excerpt":"This paper investigates the user grouping problem of downlink wireless local area networks (WLANs) with multi-user MIMO (MU-MIMO). Particularly, we focus on the problem of whether single user transmit beamforming (SU-TxBF) or MU-MIMO should be utilized, and how many users and which users should be in a multi-user (MU) group. We formulate the problem for maximizing the system throughput subject to the multi-user air time fairness (MU-ATF) criterion. We show that hypergraphs provide a suitable mathematical model and effective tool for finding the optimal or close to optimal solution. We show tha"},"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":"1812.01241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-12-04T06:27:22Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"3d626577d03a75822ad315a610173af123914b3c62e72947392223736b81c7a2","abstract_canon_sha256":"cdf6d56fc24a41d7758edbd66b9b1520a76a2df16d638c15b5fb7bcba1c8e62d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:13.017426Z","signature_b64":"h9GxqgDuBS3txyXGlLgYSuDMqmuZROkt362kPqDz9YumO24cJOHRdQWtW43tWo21kVZXcCd67auokwq/xexbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a191205c726671e78cba52b7c78999a18e4573a4fa8e157194f308a827f2447f","last_reissued_at":"2026-05-17T23:59:13.016408Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:13.016408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph matching for MU-MIMO user grouping in wireless LANs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"eess.SP","authors_text":"Jeffrey H. Reed, Qinghai Gao, Vuk Marojevic, Xiaofu Ma","submitted_at":"2018-12-04T06:27:22Z","abstract_excerpt":"This paper investigates the user grouping problem of downlink wireless local area networks (WLANs) with multi-user MIMO (MU-MIMO). Particularly, we focus on the problem of whether single user transmit beamforming (SU-TxBF) or MU-MIMO should be utilized, and how many users and which users should be in a multi-user (MU) group. We formulate the problem for maximizing the system throughput subject to the multi-user air time fairness (MU-ATF) criterion. We show that hypergraphs provide a suitable mathematical model and effective tool for finding the optimal or close to optimal solution. We show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01241","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":"1812.01241","created_at":"2026-05-17T23:59:13.016513+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.01241v1","created_at":"2026-05-17T23:59:13.016513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01241","created_at":"2026-05-17T23:59:13.016513+00:00"},{"alias_kind":"pith_short_12","alias_value":"UGISAXDSMZY6","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UGISAXDSMZY6PDF2","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UGISAXDS","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UGISAXDSMZY6PDF2KK34PCMZUG","json":"https://pith.science/pith/UGISAXDSMZY6PDF2KK34PCMZUG.json","graph_json":"https://pith.science/api/pith-number/UGISAXDSMZY6PDF2KK34PCMZUG/graph.json","events_json":"https://pith.science/api/pith-number/UGISAXDSMZY6PDF2KK34PCMZUG/events.json","paper":"https://pith.science/paper/UGISAXDS"},"agent_actions":{"view_html":"https://pith.science/pith/UGISAXDSMZY6PDF2KK34PCMZUG","download_json":"https://pith.science/pith/UGISAXDSMZY6PDF2KK34PCMZUG.json","view_paper":"https://pith.science/paper/UGISAXDS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.01241&json=true","fetch_graph":"https://pith.science/api/pith-number/UGISAXDSMZY6PDF2KK34PCMZUG/graph.json","fetch_events":"https://pith.science/api/pith-number/UGISAXDSMZY6PDF2KK34PCMZUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UGISAXDSMZY6PDF2KK34PCMZUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UGISAXDSMZY6PDF2KK34PCMZUG/action/storage_attestation","attest_author":"https://pith.science/pith/UGISAXDSMZY6PDF2KK34PCMZUG/action/author_attestation","sign_citation":"https://pith.science/pith/UGISAXDSMZY6PDF2KK34PCMZUG/action/citation_signature","submit_replication":"https://pith.science/pith/UGISAXDSMZY6PDF2KK34PCMZUG/action/replication_record"}},"created_at":"2026-05-17T23:59:13.016513+00:00","updated_at":"2026-05-17T23:59:13.016513+00:00"}