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 field matrix channels"
  Abstract: This paper is motivated by the problem of error control in network coding when errors are introduced in a random fashion (rather than chosen by an adversary). An additive-multiplicative matrix channel is considered as a model for random network coding. The model assumes that n packets of length m are transmitted over the network, and up to t erroneous packets are randomly chosen and injected into the network. Upper and lower bounds on capacity are obtained for any channel parameters, and asymptotic expressions are provided in the limit of large field or matrix size. A simple coding scheme is presented that achieves capacity in both limiting cases. The scheme has decoding complexity O(n 2 m) and a probability of error that decreases exponentially both in the packet length and in the field size in bits. Extensions of these results for coherent network coding are also presented.

Connected through hyperedge HE-1 (induced by source paper "finite field matrix channels for network coding"):
  with members:
    - "on the capacity of multiplicative finite field matrix channels"
    - "a rank metric approach to error control in random network coding"
    - "bounds on covering codes with the rank metric"
    - "coding for errors and erasures in random network coding"
    - "packing and covering properties of rank metric codes"

Connected through hyperedge HE-2 (induced by source paper "ranksign an efficient signature algorithm based on the rank metric"):
  with members:
    - "on the hardness of the decoding and the minimum distance problems for rank codes"
    - "on the complexity of the rank syndrome decoding problem"
    - "properties of codes in rank metric"

Connected through hyperedge HE-3 (induced by source paper "error correction for index coding with coded side information"):
  with members:
    - "bounding the optimal rate of the icsi and iccsi problem"
    - "on the optimality of uncoded cache placement"
    - "structural properties of index coding capacity using fractional graph theory"
    - "index coding and network coding via rank minimization"
    - "graph theory versus minimum rank for index coding"
    - "fundamental limits of caching improved bounds for small buffer users"
    - "fundamental limits of caching"
    - "an equivalence between network coding and index coding"

Connected through hyperedge HE-4 (induced by source paper "multi server coded caching"):
  with members:
    - "fundamental limits of cache aided interference management"
    - "coded caching for delay sensitive content"
    - "precoding based network alignment for three unicast sessions"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"
    - "on the feasibility of precoding based network alignment for three unicast sessions"
    - "coding for linear operator channels over finite fields"
    - "network coding for multiple unicasts an interference alignment approach"

Connected through hyperedge HE-5 (induced by source paper "error correction for differential linear network coding in slowly varying networks"):
  with members:
    - "convolutional codes in rank metric with application to random network coding"
    - "on partial unit memory codes based on gabidulin codes"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-6 (induced by source paper "batched sparse codes"):
  with members:
    - "overhead optimized gamma network codes"
    - "effects of the generation size and overlap on throughput and complexity in randomized linear network coding"
    - "on the capacity of non coherent network coding"
    - "coding for linear operator channels over finite fields"
    - "overlapped chunked network coding"
    - "sparse network coding with overlapping classes"
    - "compute and forward harnessing interference through structured codes"
    - "packing and covering properties of subspace codes for error control in random linear network coding"

Connected through hyperedge HE-7 (induced by source paper "communication over finite chain ring matrix channels"):
  with members:
    - "lattices over eisenstein integers for compute and forward"
    - "on multiplicative matrix channels over finite chain rings"
    - "an algebraic approach to physical layer network coding"
    - "on the capacity of multiplicative finite field matrix channels"
    - "network coding with modular lattices"
    - "compute and forward harnessing interference through structured codes"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-8 (induced by source paper "on multiplicative matrix channels over finite chain rings"):
  with members:
    - "communication over finite chain ring matrix channels"
    - "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"
    - "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)