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 "convolutional codes in rank metric with application to random network coding"):
  Abstract: Random network coding recently attracts attention as a technique to disseminate information in a network. This paper considers a noncoherent multishot network, where the unknown and time-variant network is used several times. In order to create dependence between the different shots, particular convolutional codes in rank metric are used. These codes are so-called (partial) unit memory ((P)UM) codes, i.e., convolutional codes with memory one. First, distance measures for convolutional codes in rank metric are shown and two constructions of (P)UM codes in rank metric based on the generator matrices of maximum rank distance codes are presented. Second, an efficient error-erasure decoding algorithm for these codes is presented. Its guaranteed decoding radius is derived and its complexity is bounded. Finally, it is shown how to apply these codes for error correction in random linear and affine network coding.

Includes members:
  Member "efficient decoding of partial unit memory codes of arbitrary rate":
    also connected through other hyperedges:
      (none)
  Member "on partial unit memory codes based on gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reliable and secure multishot network coding using linearized reed solomon codes")
  Member "localized dimension growth in random network coding a convolutional approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "localized dimension growth a convolutional random network coding approach to managing memory and decoding delay")
  Member "a matroid framework for noncoherent random network communications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "probability of partially solving random linear systems in network coding")
  Member "multishot codes for network coding using rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")
  Member "on network error correcting convolutional codes under the bsc edge error model":
    also connected through other hyperedges:
      (none)
  Member "a rank metric approach to error control in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")
  Member "coding for errors and erasures in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the gap between scalar and vector solutions of generalized combination networks")

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)