human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "on multiplicative matrix channels over finite chain rings"):
  Abstract: Motivated by physical-layer network coding, this paper considers communication in multiplicative matrix channels over finite chain rings. Such channels are defined by the law $Y =A X$, where $X$ and $Y$ are the input and output matrices, respectively, and $A$ is called the transfer matrix. It is assumed a coherent scenario in which the instances of the transfer matrix are unknown to the transmitter, but available to the receiver. It is also assumed that $A$ and $X$ are independent. Besides that, no restrictions on the statistics of $A$ are imposed. As contributions, a closed-form expression for the channel capacity is obtained, and a coding scheme for the channel is proposed. It is then shown that the scheme can achieve the capacity with polynomial time complexity and can provide correcting guarantees under a worst-case channel model. The results in the paper extend the corresponding ones for finite fields.

Includes members:
  Member "communication over finite chain ring matrix channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a multilevel framework for lattice network coding")
  Member "an algebraic approach to physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "on the capacity of multiplicative finite field matrix channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finite field matrix channels for network coding")
  Member "universal secure network coding via rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")
  Member "physical layer network coding tutorial survey and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "random access for massive machine type communications")
  Member "on the capacity of non coherent network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "batched sparse codes")
  Member "coding for linear operator channels over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multi server coded caching")
  Member "communication over finite field matrix channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "finite field matrix channels for network coding")

Question: Please tell me which class the source paper 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)