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 "partial decode forward binning schemes for the causal cognitive relay channels"):
  Abstract: The causal cognitive relay channel (CRC) has two sender-receiver pairs, in which the second sender obtains information from the first sender causally and assists the transmission of both senders. In this paper, we study both the full- and half-duplex modes. In each mode, we propose two new coding schemes built successively upon one another to illustrate the impact of different coding techniques. The first scheme called partial decode-forward binning (PDF-binning) combines the ideas of partial decode-forward relaying and Gelfand-Pinsker binning. The second scheme called Han-Kobayashi partial decode-forward binning (HK-PDF-binning) combines PDF-binning with Han-Kobayashi coding by further splitting rates and applying superposition coding, conditional binning and relaxed joint decoding. #R##N#In both schemes, the second sender decodes a part of the message from the first sender, then uses Gelfand-Pinsker binning technique to bin against the decoded codeword, but in such a way that allows both state nullifying and forwarding. For the Gaussian channels, this PDF-binning essentializes to a correlation between the transmit signal and the binning state, which encompasses the traditional dirty-paper-coding binning as a special case when this correlation factor is zero. We also provide the closed-form optimal binning parameter for each scheme. #R##N#The 2-phase half-duplex schemes are adapted from the full-duplex ones by removing block Markov encoding, sending different message parts in different phases and applying joint decoding across both phases. Analysis shows that the HK-PDF-binning scheme in both modes encompasses the Han-Kobayashi rate region and achieves both the partial decode-forward relaying rate for the first sender and interference-free rate for the second sender. Furthermore, this scheme outperforms all existing schemes.

Includes members:
  Member "inner and outer bounds for the gaussian cognitive interference channel and new capacity results":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "study of gaussian relay channels with correlated noises":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interference mitigation via relaying")
  Member "dependence balance based outer bounds for gaussian networks with cooperation and feedback":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint state sensing and communication over memoryless multiple access channels")
  Member "interference channels with source cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "gdof of interference channel with limited cooperation under finite precision csit")
  Member "interference mitigation through limited transmitter cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exploiting computation replication for mobile edge computing a fundamental computation communication tradeoff study")
  Member "on achievable rate regions for half duplex causal cognitive radio channels":
    also connected through other hyperedges:
      (none)
  Member "capacity bounds of half duplex gaussian cooperative interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cooperative relaying under spatially and temporally correlated interference")
  Member "interference channels with one cognitive transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multiuser cognitive radio networks an information theoretic perspective")

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)