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: "analysis and optimization of probabilistic caching in multi antenna small cell networks"
  Abstract: Previous works on cache-enabled small-cell networks (SCNs) with probabilistic caching often assume that each user is connected to the nearest small base station (SBS) among all that have cached its desired content. The user may, however, suffer strong interference from other SBSs which do not cache the desired content but are geographically closer. In this work, we investigate this issue by deploying multiple antennas at each SBS. We first propose a user-centric SBS clustering model where each user chooses its serving SBS only from a cluster of $K$ nearest SBSs with $K$ being a fixed cluster size. Two beamforming schemes are considered. One is coordinated beamforming, where each SBS uses zero-forcing (ZF) beamformer to null out the interference within the coordination cluster. The other is uncoordinated beamforming, where each SBS simply applies matched-filter (MF) beamformer. Using tools from stochastic geometry, we obtain tractable expressions for the successful transmission probability (STP) of a typical user for both cases in the high signal-to-noise ratio (SNR) region. Tight approximations in closed-form expressions are also obtained. We then formulate and solve the optimal probabilistic caching problem to maximize the STP. Numerical results reveal interesting insights on the choices of ZF and MF beamforming in multi-antenna cache-enabled SCNs.

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"
    - "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"
    - "optimization and analysis of probabilistic caching in n tier heterogeneous 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)