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 "wireless network simplification the gaussian n relay diamond network"):
  Abstract: We consider the Gaussian N-relay diamond network, where a source wants to communicate to a destination node through a layer of N-relay nodes. We investigate the following question: what fraction of the capacity can we maintain by using only k out of the N available relays? We show that independent of the channel configurations and the operating SNR, we can always find a subset of k relays which alone provide a rate (kC/(k+1))-G, where C is the information theoretic cutset upper bound on the capacity of the whole network and G is a constant that depends only on N and k (logarithmic in N and linear in k). In particular, for k = 1, this means that half of the capacity of any N-relay diamond network can be approximately achieved by routing information over a single relay. We also show that this fraction is tight: there are configurations of the N-relay diamond network where every subset of k relays alone can at most provide approximately a fraction k/(k+1) of the total capacity. These high-capacity k-relay subnetworks can be also discovered efficiently. We propose an algorithm that computes a constant gap approximation to the capacity of the Gaussian N-relay diamond network in O(N log N) running time and discovers a high-capacity k-relay subnetwork in O(kN) running time. #R##N#This result also provides a new approximation to the capacity of the Gaussian N-relay diamond network which is hybrid in nature: it has both multiplicative and additive gaps. In the intermediate SNR regime, this hybrid approximation is tighter than existing purely additive or purely multiplicative approximations to the capacity of this network.

Includes members:
  Member "achieving the capacity of the n relay gaussian diamond network within log n bits":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the arbitrarily varying relay channel")
  Member "efficient capacity computation and power optimization for relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polynomial time capacity calculation and scheduling for half duplex 1 2 1 networks")
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "the approximate capacity of the gaussian n relay diamond network":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "generalized degrees of freedom of noncoherent diamond networks")
  Member "noisy network coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an information theoretic analysis of the gaussian multicast channel with interactive user cooperation")
  Member "approximately achieving gaussian relay network capacity with lattice codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "generalized degrees of freedom of noncoherent diamond networks")
  Member "a simple cooperative diversity method based on network path selection":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "dynwalks global topology and recent changes awareness dynamic network embedding")

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)