human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "beamforming learning for mmwave communication theory and experimental validation"
  Abstract: To establish reliable and long-range millimeter-wave (mmWave) communication, beamforming is deemed to be a promising solution. Although beamforming can be done in the digital and analog domains, both approaches are hindered by several constraints when it comes to mmWave communications. For example, performing fully digital beamforming in mmWave systems involves using many radio frequency (RF) chains, which are expensive and consume high power. This necessitates finding more efficient ways for using fewer RF chains while taking advantage of the large antenna arrays. One way to overcome this challenge is to employ (partially or fully) analog beamforming through proper configuration of phase-shifters. Existing works on mmWave analog beam design either rely on the knowledge of the channel state information (CSI) per antenna within the array, require a large search time (e.g., exhaustive search) or do not guarantee a minimum beamforming gain (e.g., codebook based beamforming). In this paper, we propose a beam design technique that reduces the search time and does not require CSI while guaranteeing a minimum beamforming gain. The key idea derives from observations drawn from real-life measurements. It was observed that for a given propagation environment (e.g., coverage area of a mmWave BS) the azimuthal angles of dominant signals could be more probable from certain angles than others. Thus, pre-collected measurements could used to build a beamforming codebook that regroups the most probable beam designs. We invoke Bayesian learning for measurements clustering. We evaluate the efficacy of the proposed scheme in terms of building the codebook and assessing its performance through real-life measurements. We demonstrate that the training time required by the proposed scheme is only 5% of that of exhaustive search. This crucial gain is obtained while achieving a minimum targeted beamforming gain.

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.IT(Information Theory)