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: "secure partial repair in wireless caching networks with broadcast channels"
  Abstract: We study security in partial repair in wireless caching networks where parts of the stored packets in the caching nodes are susceptible to be erased. Let us denote a caching node that has lost parts of its stored packets as a sick caching node and a caching node that has not lost any packet as a healthy caching node. In partial repair, a set of caching nodes (among sick and healthy caching nodes) broadcast information to other sick caching nodes to recover the erased packets. The broadcast information from a caching node is assumed to be received without any error by all other caching nodes. All the sick caching nodes then are able to recover their erased packets, while using the broadcast information and the nonerased packets in their storage as side information. In this setting, if an eavesdropper overhears the broadcast channels, it might obtain some information about the stored file. We thus study secure partial repair in the senses of information-theoretically strong and weak security. In both senses, we investigate the secrecy caching capacity, namely, the maximum amount of information which can be stored in the caching network such that there is no leakage of information during a partial repair process. We then deduce the strong and weak secrecy caching capacities, and also derive the sufficient finite field sizes for achieving the capacities. Finally, we propose optimal secure codes for exact partial repair, in which the recovered packets are exactly the same as erased packets.

Connected through hyperedge HE-1 (induced by source paper "secure and energy efficient transmissions in cache enabled heterogeneous cellular networks performance analysis and optimization"):
  with members:
    - "generalization of lru cache replacement policy with applications to video streaming"
    - "cache enabled physical layer security for video streaming in backhaul limited cellular networks"
    - "safeguarding decentralized wireless networks using full duplex jamming receivers"
    - "secure video streaming in heterogeneous small cell networks with untrusted cache helpers"
    - "sprout a functional caching approach to minimize service latency in erasure coded storage"
    - "wireless caching technical misconceptions and business barriers"
    - "on edge caching with secrecy constraints"
    - "a survey on wireless security technical challenges recent advances and future trends"

Connected through hyperedge HE-2 (induced by source paper "physical layer security in cache enabled cooperative small cell networks against randomly distributed eavesdroppers"):
  with members:
    - "cache enabled physical layer security for video streaming in backhaul limited cellular networks"
    - "safeguarding decentralized wireless networks using full duplex jamming receivers"
    - "secure video streaming in heterogeneous small cell networks with untrusted cache helpers"
    - "wireless caching technical misconceptions and business barriers"
    - "artificial noise aided secure transmission in large scale spectrum sharing networks"
    - "on edge caching with secrecy constraints"
    - "a survey on wireless security technical challenges recent advances and future trends"
    - "physical layer security in heterogeneous 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)