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: "performance of pzf and mmse receivers in cellular networks with multi user spatial multiplexing"
  Abstract: This paper characterizes the performance of cellular networks employing multiple antenna open-loop spatial multiplexing (SM) techniques. We use a stochastic geometric framework to model distance depended inter cell interference. Using this framework, we analyze the coverage and rate using two linear receivers, namely, partial zero-forcing (PZF) and minimum-mean-square-estimation (MMSE) receivers. Analytical expressions are obtained for coverage and rate distribution that are suitable for fast numerical computation.

Connected through hyperedge HE-1 (induced by source paper "modeling analysis and optimization of caching in multi antenna small cell networks"):
  with members:
    - "treating content delivery in multi antenna coded caching as general message sets transmission a dof region perspective"
    - "analysis and optimization of probabilistic caching in multi antenna small cell networks"
    - "caching policy toward maximal success probability and area spectral efficiency of cache enabled hetnets"
    - "modeling analysis and optimization of coded caching in small cell networks"
    - "wireless caching technical misconceptions and business barriers"
    - "a learning based approach to caching in heterogenous small cell networks"
    - "fundamental storage latency tradeoff in cache aided mimo interference networks"
    - "caching in wireless small cell networks a storage bandwidth tradeoff"

Connected through hyperedge HE-2 (induced by source paper "local partial zero forcing precoding for cell free massive mimo"):
  with members:
    - "scalability aspects of cell free massive mimo"
    - "ubiquitous cell free massive mimo communications"
    - "making cell free massive mimo competitive with mmse processing and centralized implementation"
    - "downlink spectral efficiency of cell free massive mimo with full pilot zero forcing"
    - "cell free massive mimo with limited backhaul"
    - "on the total energy efficiency of cell free massive mimo"
    - "cell free massive mimo versus small cells"
    - "reciprocity calibration for massive mimo proposal modeling and validation"

Connected through hyperedge HE-3 (induced by source paper "spectral efficiency bounds for interference limited svd mimo cellular communication systems"):
  with members:
    - "a stochastic analysis of network mimo systems"
    - "on the optimal feedback rate in interference limited multi antenna cellular systems"
    - "downlink mimo hetnets modeling ordering results and performance analysis"
    - "average rate of downlink heterogeneous cellular networks over generalized fading channels a stochastic geometry approach"
    - "a tractable approach to coverage and rate in cellular 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)