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: "communication over finite chain ring matrix channels"
  Abstract: This work was sponsored by the Natural Sciences and Engineering Research Council of Canada through a Discovery Grant, and also by the National Council for Scientific and Technological Development (CNPq), Brazil.

Connected through hyperedge HE-1 (induced by source paper "a multilevel framework for lattice network coding"):
  with members:
    - "multistage compute and forward with multilevel lattice codes based on product constructions"
    - "an algebraic approach to physical layer network coding"
    - "compute and forward harnessing interference through structured 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"
    - "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"
    - "multilevel coding schemes for compute and forward"

Connected through hyperedge HE-3 (induced by source paper "on multiplicative matrix channels over finite chain rings"):
  with members:
    - "an algebraic approach to physical layer network coding"
    - "on the capacity of multiplicative finite field matrix channels"
    - "universal secure network coding via rank metric codes"
    - "physical layer network coding tutorial survey and beyond"
    - "on the capacity of non coherent network coding"
    - "coding for linear operator channels over finite fields"
    - "communication over finite field matrix channels"
    - "compute and forward harnessing interference through structured codes"

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)