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 information flow a deterministic approach"):
  Abstract: In a wireless network with a single source and a single destination and an arbitrary number of relay nodes, what is the maximum rate of information flow achievable? We make progress on this long standing problem through a two-step approach. First, we propose a deterministic channel model which captures the key wireless properties of signal strength, broadcast and superposition. We obtain an exact characterization of the capacity of a network with nodes connected by such deterministic channels. This result is a natural generalization of the celebrated max-flow min-cut theorem for wired networks. Second, we use the insights obtained from the deterministic analysis to design a new quantize-map-and-forward scheme for Gaussian networks. In this scheme, each relay quantizes the received signal at the noise level and maps it to a random Gaussian codeword for forwarding, and the final destination decodes the source's message based on the received signal. We show that, in contrast to existing schemes, this scheme can achieve the cut-set upper bound to within a gap which is independent of the channel parameters. In the case of the relay channel with a single relay as well as the two-relay Gaussian diamond network, the gap is 1 bit/s/Hz. Moreover, the scheme is universal in the sense that the relays need no knowledge of the values of the channel parameters to (approximately) achieve the rate supportable by the network. We also present extensions of the results to multicast networks, half-duplex networks, and ergodic networks.

Includes members:
  Member "the approximate capacity of the gaussian n relay diamond network":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "generalized degrees of freedom of noncoherent diamond networks")
  Member "approximately achieving gaussian relay network capacity with lattice codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "generalized degrees of freedom of noncoherent diamond networks")
  Member "broadcast capacity region of two phase bidirectional relaying":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the dof of two way 2 2 2 relay networks with or without relay caching")
  Member "approximate capacity of the two way relay channel a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "state space adaptive nonlinear self interference cancellation for full duplex communication")
  Member "lossy source transmission over the relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "joint source channel cooperative transmission over relay broadcast networks")
  Member "joint physical layer coding and network coding for bi directional relaying":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "compute and forward relaying with ldpc codes over qpsk scheme")
  Member "approximate capacity of gaussian relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multihop backhaul compression for the uplink of cloud radio access networks")
  Member "a deterministic approach to wireless relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the deterministic sum capacity of the multiple access wiretap channel")

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)