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: "slepian wolf coding over cooperative networks"
  Abstract: We present sufficient conditions for multicasting a set of correlated sources over cooperative networks. We propose joint source-Wyner-Ziv encoding/sliding-window decoding scheme, in which each receiver considers an ordered partition of other nodes. Subject to this scheme, we obtain a set of feasibility constraints for each ordered partition. We consolidate the results of different ordered partitions by utilizing a result of geometrical approach to obtain the sufficient conditions. We observe that these sufficient conditions are indeed necessary conditions for Aref networks. As a consequence of the main result, we obtain an achievable rate region for networks with multicast demands. Also, we deduce an achievability result for two-way relay networks, in which two nodes want to communicate over a relay network.

Connected through hyperedge HE-1 (induced by source paper "short message noisy network coding with rate splitting"):
  with members:
    - "short message quantize forward network coding"

Connected through hyperedge HE-2 (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"
    - "short message quantize forward network coding"
    - "slepian wolf coding over cooperative relay networks"

Connected through hyperedge HE-3 (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"
    - "short message quantize forward network coding"
    - "slepian wolf coding over cooperative relay networks"
    - "on the optimal compressions in the compress and forward relay schemes"

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)