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: "an optimal coding strategy for the binary multi way relay channel"
  Abstract: We derive the capacity of the binary multi-way relay channel, in which multiple users exchange messages at a common rate through a relay. The capacity is achieved using a novel functional-decode-forward coding strategy. In the functional-decode-forward coding strategy, the relay decodes functions of the users' messages without needing to decode individual messages. The functions to be decoded by the relay are defined such that when the relay broadcasts the functions back to the users, every user is able to decode the messages of all other users.

Connected through hyperedge HE-1 (induced by source paper "maximizing data rate for multiway relay channels with pairwise transmission strategy"):
  with members:
    - "generalized signal alignment on the achievable dof for multi user mimo two way relay channels"
    - "on the achievable rates of pairwise multiway relay channels"
    - "a novel user pairing scheme for functional decode and forward multi way relay network"
    - "mimo multiway relaying with pairwise data exchange a degrees of freedom perspective"
    - "degrees of freedom for the mimo multi way relay channel"
    - "on the equal rate capacity of the awgn multiway relay channel"
    - "the capacity region of multiway relay channels over finite fields with full data exchange"
    - "the multi way relay channel"

Connected through hyperedge HE-2 (induced by source paper "a novel user pairing scheme for functional decode and forward multi way relay network"):
  with members:
    - "optimal coding functions for pairwise message sharing on finite field multi way relay channels"
    - "on the achievable rates of pairwise multiway relay channels"
    - "symbol and bit mapping optimization for physical layer network coding with pulse amplitude modulation"
    - "error performance analysis of df and af multi way relay networks with bpsk modulation"
    - "on the equal rate capacity of the awgn multiway relay channel"
    - "asynchronous physical layer network coding"
    - "nested lattice codes for gaussian relay networks with interference"
    - "physical layer network coding tutorial survey and beyond"

Connected through hyperedge HE-3 (induced by source paper "on the achievable rates of pairwise multiway relay channels"):
  with members:
    - "on the equal rate capacity of the awgn multiway relay channel"
    - "the capacity region of multiway relay channels over finite fields with full data exchange"
    - "the multi way relay channel"

Connected through hyperedge HE-4 (induced by source paper "rateless codes for the multi way relay channel"):
  with members:
    - "the multi way relay channel"
    - "capacity theorems for the awgn multi way relay channel"

Connected through hyperedge HE-5 (induced by source paper "the three user finite field multi way relay channel with correlated sources"):
  with members:
    - "multi way relay networks orthogonal uplink source channel separation and code design"
    - "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"
    - "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-6 (induced by source paper "low latency data sharing in erasure multi way relay channels"):
  with members:
    - "on modulo sum computation over an erasure multiple access channel"
    - "joint compute and forward for the two way relay channel with spatially coupled ldpc codes"
    - "the multi way relay channel"
    - "capacity theorems for the awgn multi way relay channel"
    - "intermediate performance of rateless codes"

Connected through hyperedge HE-7 (induced by source paper "degrees of freedom for mimo two way x relay channel"):
  with members:
    - "linear precoding designs for amplify and forward multiuser two way relay systems"
    - "the ergodic capacity of phase fading interference networks"
    - "the multi way relay channel"
    - "physical layer network coding"
    - "interference alignment and the degrees of freedom for the k user interference channel"

Connected through hyperedge HE-8 (induced by source paper "error performance analysis of df and af multi way relay networks with bpsk modulation"):
  with members:
    - "multi way relay networks orthogonal uplink source channel separation and code design"
    - "asynchronous physical layer network coding"
    - "relay selection for two way relaying with amplify and forward protocols"

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)