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: "location aware ici reduction in mimo ofdm downlinks for high speed railway communication systems"
  Abstract: High mobility may destroy the orthogonality of subcarriers in OFDM systems, resulting in inter- carrier interference (ICI), which may greatly reduce the service quantity of high-speed railway (HSR) wireless communications. This paper focuses on ICI mitigation in the HSR downlinks with distributed transmit antennas.For such a system, its key feature is that the ICIs are caused by multiple carrier frequency offsets corresponding to multiple transmit antennas. Meanwhile, the channel of HSR is fast time varying, which is another big challenge in the system design. In order to get a good performance, low complexity real-time ICI reduction is necessary. To this end, we first analyzed the property of the ICI matrix in AWGN and Rician scenarios, respectively. Then, we propose corresponding low complexity ICI reduction methods based on location information. For evaluating the effectiveness of the proposed method, the expectation and variance of remaining interference after ICI reduction is analyzed with respect to Rician K-factor. In addition, the service quantity and the bandwidth and computation cost are also discussed. Numerical results are presented to verify our theoretical analysis and the effectiveness of proposed ICI reduction methods. One important observation is that our proposed ICI mitigation method can achieve almost the same service quantity with that obtained on the case without ICI at 300km/h,that is, ICI has been completely eliminated. Numerical results also show that the scenarios with Rician K-factors over 30dB can be considered as AWGN scenarios, which may provide valuable insights on future system designs.

Connected through hyperedge HE-1 (induced by source paper "toward traffic patterns in high speed railway communication systems power allocation and antenna selection"):
  with members:
    - "analysis and optimization of caching and multicasting in large scale cache enabled wireless networks"
    - "what will 5g be"
    - "asymptotic laws for joint content replication and delivery in wireless networks"

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)