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: "multi way relay networks orthogonal uplink source channel separation and code design"
  Abstract: We consider a multi-way relay network with an orthogonal uplink and correlated sources, and we characterise reliable communication (in the usual Shannon sense) with a single-letter expression. The characterisation is obtained using a joint source-channel random-coding argument, which is based on a combination of Wyner et al.'s Cascaded Slepian-Wolf Source Coding and Tuncel's Slepian-Wolf Coding over Broadcast Channels. We prove a separation theorem for the special case of two nodes; that is, we show that a modular code architecture with separate source and channel coding functions is (asymptotically) optimal. Finally, we propose a practical coding scheme based on low-density parity-check codes, and we analyse its performance using multi-edge density evolution.

Connected through hyperedge HE-1 (induced by source paper "a multiway relay channel with balanced sources"):
  with members:
    - "information theoretic caching sequential coding for computing"
    - "the three user finite field multi way relay channel with correlated sources"
    - "the capacity region of restricted multi way relay channels with deterministic uplinks"
    - "the capacity region of multiway relay channels over finite fields with full data exchange"
    - "malleable coding with fixed reuse"
    - "network information flow with correlated sources"

Connected through hyperedge HE-2 (induced by source paper "slepian wolf coding for broadcasting with cooperative base stations"):
  with members:
    - "offloading in heterogeneous networks modeling analysis and design insights"
    - "rate distortion with side information at many decoders"
    - "wyner ziv coding over broadcast channels digital schemes"
    - "broadcast capacity region of two phase bidirectional relaying"

Connected through hyperedge HE-3 (induced by source paper "compressed relaying for two way relay networks with correlated sources"):
  with members:
    - "a distributed differential space time coding scheme with analog network coding in two way relay networks"
    - "physical layer network coding tutorial survey and beyond"

Connected through hyperedge HE-4 (induced by source paper "the three user finite field multi way relay channel with correlated sources"):
  with members:
    - "gaussian two way relay channel with private information for the relay"
    - "on the equal rate capacity of the awgn multiway relay channel"
    - "the capacity region of the restricted two way relay channel with any deterministic uplink"
    - "the capacity region of multiway relay channels over finite fields with full data exchange"
    - "an optimal coding strategy for the binary multi way relay channel"
    - "capacity theorems for the awgn multi way relay channel"
    - "when is a function securely computable"
    - "lossy broadcasting in two way relay networks with common reconstructions"

Connected through hyperedge HE-5 (induced by source paper "error performance analysis of df and af multi way relay networks with bpsk modulation"):
  with members:
    - "asynchronous physical layer network coding"
    - "relay selection for two way relaying with amplify and forward protocols"
    - "an optimal coding strategy for the binary multi way relay channel"

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)