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 "short message noisy network coding with a decode forward option"):
  Abstract: Short message noisy network coding (SNNC) differs from long message noisy network coding (LNNC) in that one transmits many short messages in blocks rather than using one long message with repetitive encoding. Several properties of SNNC are developed. First, SNNC with backward decoding achieves the same rates as SNNC with offset encoding and sliding window decoding for memoryless networks where each node transmits a multicast message. The rates are the same as LNNC with joint decoding. Second, SNNC enables early decoding if the channel quality happens to be good. This leads to mixed strategies that unify the advantages of decode-forward and noisy network coding. Third, the best decoders sometimes treat other nodes' signals as noise and an iterative method is given to find the set of nodes that a given node should treat as noise sources.

Includes members:
  Member "compress and forward scheme for relay networks backword decoding and connection to bisubmodular flows":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity approximations for gaussian relay networks")
  Member "mixed noisy network coding and cooperative unicasting in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity bounds for a class of interference relay channels")
  Member "a unified relay framework with both d f and c f relay nodes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "noncoherent relaying in energy harvesting communication systems")
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "on compress forward without wyner ziv binning for relay networks":
    also connected through other hyperedges:
      (none)
  Member "short message quantize forward network coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity approximations for gaussian relay networks")
  Member "slepian wolf coding over cooperative relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "on the optimal compressions in the compress and forward relay schemes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the rate distortion function of asynchronously sampled memoryless cyclostationary gaussian processes")

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)