human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "network simplification in half duplex building on submodularity"):
  Abstract: Given an $N$-relay Gaussian Half-Duplex (HD) diamond network, can we achieve a significant fraction of the capacity of the full network by operating only a subset of $k$ relays? This paper seeks to answer this question, which is also known as the {\it network simplification} problem. Building upon the recent result of Cardone et al., this work proves that there always exists a subnetwork of $k=N-1$ relays that approximately (i.e., up to a constant gap) achieves a fraction $\frac{N-1}{N}$ of the capacity of the full network. This fraction guarantee is shown to be tight, i.e., there exists a class of Gaussian HD diamond networks with $N$ relays where the best (i.e., the one with the largest capacity) subnetwork of $k=N-1$ relays has an approximate capacity of $\frac{N-1}{N}$ of the capacity of the full network. Moreover, it is shown that any optimal schedule of the full network can be used by at least one of the ${N}\choose{k}$ subnetworks of $k$ relays to achieve a worst performance guarantee of $\frac{k}{N}$. The key step of the proof lies in the derivation of properties of submodular functions, which provide a combinatorial handle of the network simplification problem in Gaussian HD diamond networks.

Includes members:
  Member "on the impact of a single edge on the network coding capacity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a local perspective on the edge removal problem")
  Member "on network simplification for gaussian half duplex diamond networks":
    also connected through other hyperedges:
      (none)
  Member "cut set bound is loose for gaussian relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the arbitrarily varying relay channel")
  Member "the approximate optimality of simple schedules for half duplex multi relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficiently finding simple schedules in gaussian half duplex relay line networks")
  Member "gaussian half duplex relay networks improved constant gap and connections with the assignment problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "wireless network simplification the gaussian n relay diamond network":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "best relay selection in gaussian half duplex diamond networks")

Question: Please tell me which class the source paper 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)