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: "multilevel coding schemes for compute and forward"
  Abstract: We investigate techniques for designing modulation/coding schemes for the wireless two-way relaying channel. The relay is assumed to have perfect channel state information, but the transmitters are assumed to have no channel state information. We consider physical layer network coding based on multilevel coding techniques. Our multilevel coding framework is inspired by the compute-and-forward relaying protocol. Indeed, we show that the framework developed here naturally facilitates decoding of linear combinations of codewords for forwarding by the relay node. We develop our framework with general modulation formats in mind, but numerical results are presented for the case where each node transmits using the QPSK constellation with gray labeling. We focus our discussion on the rates at which the relay may reliably decode linear combinations of codewords transmitted from the end nodes.

Connected through hyperedge HE-1 (induced by source paper "space time coded spatial modulated physical layer network coding for two way relaying"):
  with members:
    - "wireless bidirectional relaying latin squares and graph vertex coloring"
    - "distributed space time coding for wireless two way relaying"
    - "co ordinate interleaved distributed space time coding for two antenna relays networks"
    - "compute and forward harnessing interference through structured codes"
    - "physical network coding in two way wireless relay channels"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-2 (induced by source paper "an algebraic approach to physical layer network coding"):
  with members:
    - "lattices over eisenstein integers for compute and forward"
    - "communication over finite chain ring matrix channels"
    - "multilevel coding schemes for compute and forward with flexible decoding"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "wireless network information flow a deterministic approach"
    - "reliable physical layer network coding"
    - "the degrees of freedom of compute and forward"
    - "integer forcing linear receivers"

Connected through hyperedge HE-3 (induced by source paper "distributed space time coding for wireless two way relaying"):
  with members:
    - "wireless network coding for mimo two way relaying using latin rectangles"
    - "physical layer network coding for two way relaying with qam and latin squares"
    - "wireless bidirectional relaying and latin squares"
    - "channel quantization for physical layer network coded two way relaying"
    - "power allocation strategies and lattice based coding schemes for bi directional relaying"
    - "physical network coding in two way wireless relay channels"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-4 (induced by source paper "physical layer network coding for two way relaying with qam"):
  with members:
    - "an adaptive modulation scheme for two user fading mac with quantized fade state feedback"
    - "physical layer network coding for two way relaying with qam and latin squares"
    - "performance analysis of adaptive physical layer network coding for wireless two way relaying"
    - "wireless bidirectional relaying and latin squares"
    - "channel quantization for physical layer network coded two way relaying"
    - "physical network coding in two way wireless relay channels"

Connected through hyperedge HE-5 (induced by source paper "simplified compute and forward and its performance analysis"):
  with members:
    - "an algebraic approach to physical layer network coding"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "reliable physical layer network coding"

Connected through hyperedge HE-6 (induced by source paper "wireless bidirectional relaying latin squares and graph vertex coloring"):
  with members:
    - "physical layer network coding for two way relaying with qam"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-7 (induced by source paper "on modulo sum computation over an erasure multiple access channel"):
  with members:
    - "anti structure problems"
    - "on the capacity of abelian group codes over discrete memoryless channels"
    - "providing secrecy with structured codes tools and applications to two user gaussian channels"
    - "lattice strategies for the dirty multiple access channel"
    - "on the secrecy rate of interference networks using structured codes"
    - "compute and forward harnessing interference through structured codes"
    - "joint physical layer coding and network coding for bi directional relaying"
    - "lattices for distributed source coding jointly gaussian sources and reconstruction of a linear function"

Connected through hyperedge HE-8 (induced by source paper "wireless network coded accumulate compute and forward two way relaying"):
  with members:
    - "wireless bidirectional relaying and latin squares"
    - "channel quantization for physical layer network coded two way relaying"
    - "multicell zero forcing and user scheduling on the downlink of a linear cell array"
    - "adaptive spatial intercell interference cancellation in multicell wireless networks"
    - "physical network coding in two way wireless relay channels"

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)