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 of a class of state dependent orthogonal relay channels"):
  Abstract: The class of orthogonal relay channels in which the orthogonal channels connecting the source terminal to the relay and the destination, and the relay to the destination, depend on a state sequence, is considered. It is assumed that the state sequence is fully known at the destination while it is not known at the source or the relay. The capacity of this class of relay channels is characterized, and shown to be achieved by the partial decode-compress-and-forward (pDCF) scheme. Then the capacity of certain binary and Gaussian state-dependent orthogonal relay channels are studied in detail, and it is shown that the compress-and-forward (CF) and partial-decode-and-forward (pDF) schemes are suboptimal in general. To the best of our knowledge, this is the first single relay channel model for which the capacity is achieved by pDCF, while pDF and CF schemes are both suboptimal. Furthermore, it is shown that the capacity of the considered class of state-dependent orthogonal relay channels is in general below the cut-set bound. The conditions under which pDF or CF suffices to meet the cut-set bound, and hence, achieve the capacity, are also derived.

Includes members:
  Member "cooperative binning for semideterministic channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cooperative binning for semi deterministic channels with non causal state information")
  Member "relay channel with orthogonal components and structured interference known at the source":
    also connected through other hyperedges:
      (none)
  Member "bounds on the capacity of the relay channel with noncausal state at source":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the arbitrarily varying relay channel")
  Member "message and state cooperation in a relay channel when only the relay knows the state":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cooperative binning for semideterministic channels")
  Member "bounds on the capacity of the relay channel with noncausal state information at source":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on cooperative multiple access channels with delayed csi at transmitters")
  Member "capacity of a class of diamond channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "generalized compression strategy for the downlink cloud radio access network")
  Member "capacity of a class of deterministic relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "interference mitigation via relaying")
  Member "capacity of a class of modulo sum relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)