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: "network simplification for secure af relaying"
  Abstract: We consider a class of Gaussian layered networks where a source communicates with a destination through L intermediate relay layers with N nodes in each layer in the presence of a single eavesdropper which can overhear the transmissions of the nodes in the last layer. For such networks we address the question: what fraction of maximum secure achievable rate can be maintained if only a fraction of available relay nodes are used in each layer? In particular, we provide upper bounds on additive and multiplicative gaps between the optimal secure AF when all N relays in each layer are used and when only k, 1 <= k < N, relays are used in each layer. We show that asymptotically (in source power), the additive gap increases at most logarithmically with ratio N/k and L, and the corresponding multiplicative gap increases at most quadratically with ratio N/k and L. To the best of our knowledge, this work offers the first characterization of the performance of network simplification in layered amplify-and-forward relay networks in the presence of an eavesdropper.

Connected through hyperedge HE-1 (induced by source paper "wireless network simplification the performance of routing"):
  with members:
    - "network simplification in half duplex building on submodularity"
    - "consistency in the face of change an adaptive approach to physical layer cooperation"
    - "cut set bound is loose for gaussian relay networks"
    - "wireless network information flow a deterministic approach"
    - "wireless network simplification the gaussian n relay diamond network"
    - "a simple cooperative diversity method based on network path selection"

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)