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 quantize forward network coding"):
  Abstract: Recent work for single-relay channels shows that quantize-forward (QF) with long-message encoding achieves the same reliable rates as compress-forward (CF) with short-message encoding. It is shown that short-message QF with backward or pipelined (sliding-window) decoding also achieves the same rates. Similarly, for many relays and sources, short-message QF with backward decoding achieves the same rates as long-message QF. Several practical advantages of short-message encoding are pointed out, e.g., reduced delay and simpler modulation. Furthermore, short-message encoding lets relays use decode-forward (DF) if their channel quality is good, thereby enabling multiinput, multi-output (MIMO) gains that are not possible with long-message encoding. Finally, one may combine the advantages of long- and short-message encoding by hashing a long message to short messages.

Includes members:
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "on the optimal compressions in the compress and forward relay schemes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the rate distortion function of asynchronously sampled memoryless cyclostationary gaussian processes")
  Member "noisy network coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an information theoretic analysis of the gaussian multicast channel with interactive user cooperation")
  Member "pipelined encoding for deterministic and noisy relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "piggybacking codes for network coding the high low snr regime")
  Member "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "wireless mesh networking with devices equipped with multi connectivity")

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)