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 upper bounds for the relay channel via reverse hypercontractivity"):
  Abstract: The primitive relay channel, introduced by Cover in 1987, is the simplest single-source single-destination network model that captures some of the most essential features and challenges of relaying in wireless networks. Recently, Wu and Ozgur developed upper bounds on the capacity of this channel that are tighter than the cutset bound. In this paper, we recover, generalize and improve their upper bounds with simpler proofs that rely on a converse technique recently introduced by Liu, van Handel and Verd\'u that builds on reverse hypercontractivity. To our knowledge, this is the first application of reverse hypercontractivity for proving first-order converses in network information theory.

Includes members:
  Member "the capacity of the relay channel solution to cover s problem in the gaussian case":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the capacity regions of cloud radio access networks with limited orthogonal fronthaul")
  Member "brascamp lieb inequality and its reverse an information theoretic view":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dispersion bound for the wyner ahlswede k orner network via reverse hypercontractivity on types")
  Member "cut set bound is loose for gaussian relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the arbitrarily varying relay channel")
  Member "secret key generation with one communicator and a one shot converse via hypercontractivity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "communication for generating correlation a unifying survey")
  Member "wasserstein continuity of entropy and outer bounds for interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a lower bound on the expected distortion of joint source channel coding")
  Member "capacity of a class of modulo sum relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a new coding paradigm for the primitive relay 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)