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 "capacity bounds for diamond networks with an orthogonal broadcast channel"):
  Abstract: A class of diamond networks is studied where the broadcast component is orthogonal and modeled by two independent bit-pipes. New upper and lower bounds on the capacity are derived. The proof technique for the upper bound generalizes bounding techniques of Ozarow for the Gaussian multiple description problem (1981) and Kang and Liu for the Gaussian diamond network (2011). The lower bound is based on Marton's coding technique and superposition coding. The bounds are evaluated for Gaussian and binary adder multiple access channels (MACs). For Gaussian MACs, both the lower and upper bounds strengthen the Kang-Liu bounds and establish capacity for interesting ranges of bit-pipe capacities. For binary adder MACs, the capacity is established for all ranges of bit-pipe capacities.

Includes members:
  Member "generalization of mrs gerber s lemma":
    also connected through other hyperedges:
      (none)
  Member "capacity bounds for a class of diamond networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity bounds on the downlink of symmetric multi relay single receiver c ran networks")
  Member "a new entropy power inequality for integer valued random variables":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an entropy power inequality for discrete random variables")
  Member "achieving the capacity of the n relay gaussian diamond network within log n bits":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the arbitrarily varying relay channel")
  Member "the gaussian multiple access diamond channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "generalized compression strategy for the downlink cloud radio access network")
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "generalized degrees of freedom of noncoherent diamond networks")
  Member "entropy power inequality for a family of discrete random variables":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an entropy power inequality for discrete random variables")

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)