human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "capacity approximations for gaussian relay networks"):
  with members:
    - "compress and forward scheme for relay networks backword decoding and connection to bisubmodular flows"
    - "improved capacity approximations for gaussian relay networks"
    - "achieving the capacity of the n relay gaussian diamond network within log n bits"
    - "wireless network information flow a deterministic approach"
    - "computation alignment capacity approximation without noise accumulation"
    - "on the optimal compressions in the compress and forward relay schemes"
    - "ergodic interference alignment"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-2 (induced by source paper "short message noisy network coding with rate splitting"):
  with members:
    - "slepian wolf coding over cooperative networks"

Connected through hyperedge HE-3 (induced by source paper "mixed noisy network coding and cooperative unicasting in wireless networks"):
  with members:
    - "short message noisy network coding with a decode forward option"
    - "a unified relay framework with both d f and c f relay nodes"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "selective coding strategy for unicast composite networks"
    - "wireless network information flow a deterministic approach"
    - "the degrees of freedom of compute and forward"
    - "slepian wolf coding over cooperative relay networks"
    - "cooperative strategies for simultaneous and broadcast relay channels"

Connected through hyperedge HE-4 (induced by source paper "short message noisy network coding with a decode forward option"):
  with members:
    - "compress and forward scheme for relay networks backword decoding and connection to bisubmodular flows"
    - "mixed noisy network coding and cooperative unicasting in wireless networks"
    - "a unified relay framework with both d f and c f relay nodes"
    - "wireless network information flow a deterministic approach"
    - "on compress forward without wyner ziv binning for relay networks"
    - "slepian wolf coding over cooperative relay networks"
    - "on the optimal compressions in the compress and forward relay schemes"
    - "noisy network coding"

Connected through hyperedge HE-5 (induced by source paper "multiple access channels with states causally known at transmitters"):
  with members:
    - "a note on multiple access channels with strictly causal state information"
    - "message and state cooperation in multiple access channels"
    - "noisy network coding"
    - "lecture notes on network information theory"
    - "lattice strategies for the dirty multiple access channel"
    - "multiaccess channels with state known to some encoders and independent messages"

Connected through hyperedge HE-6 (induced by source paper "a unified relay framework with both d f and c f relay nodes"):
  with members:
    - "compress and forward scheme for relay networks backword decoding and connection to bisubmodular flows"
    - "selective coding strategy for unicast composite networks"
    - "wireless network information flow a deterministic approach"
    - "on the optimal compressions in the compress and forward relay schemes"
    - "noisy network coding"
    - "lecture notes on network information theory"
    - "an improvement of cover el gamal s compress and forward relay scheme"
    - "analysis of a mixed strategy for multiple relay networks"

Connected through hyperedge HE-7 (induced by source paper "on compress forward without wyner ziv binning for relay networks"):
  with members:
    - "incremental relaying for the gaussian interference channel with a degraded broadcasting relay"
    - "compress forward without wyner ziv binning for the one way and two way relay channels"
    - "lecture notes on network information theory"

Question: Please tell me which class the center node 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)