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 "approximately optimal wireless broadcasting"):
  Abstract: We study a wireless broadcast network, where a single source reliably communicates independent messages to multiple destinations, with the aid of relays and cooperation between destinations. The wireless nature of the medium is captured by the broadcast nature of transmissions as well as the superposition of all transmit signals plus independent Gaussian noise at the received signal at any radio. We propose a scheme that can achieve rate tuples within a constant gap away from the cut-set bound, where the constant is independent of channel coefficients and power constraints. #R##N#The proposed scheme operates in two steps. The inner code, in which the relays perform a quantize-and-encode operation, is constructed by lifting a scheme designed for a corresponding discrete superposition network. The outer code is a Marton code for the non-Gaussian vector broadcast channel induced by the relaying scheme, and is constructed by adopting a ``receiver-centric'' viewpoint.

Includes members:
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "a digital interface for gaussian relay and interference networks lifting codes from the discrete superposition model":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the optimality of treating interference as noise general message sets")
  Member "algebraic network coding approach to deterministic wireless relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bounded contention coding for wireless networks in the high snr regime")
  Member "noisy network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an information theoretic analysis of the gaussian multicast channel with interactive user cooperation")
  Member "linear finite field deterministic networks with many sources and one destination":
    also connected through other hyperedges:
      (none)
  Member "reciprocity in linear deterministic networks under linear coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "upper bounds and duality relations of the linear deterministic sum capacity for cellular systems")
  Member "on approximating gaussian relay networks by deterministic networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a digital interface for gaussian relay and interference networks lifting codes from the discrete superposition model")
  Member "a combinatorial study of linear deterministic relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "efficient capacity computation and power optimization for relay 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)