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 "hamming and simplex codes for the sum rank metric"):
  Abstract: Sum-rank Hamming codes are introduced in this work. They are essentially defined as the longest codes with minimum sum-rank distance at least $ 3 $ for a fixed redundancy $ r $, base-field size $ q $ and field-extension degree $ m $ (i.e., number of matrix rows). General upper bounds on their code length, number of shots or sublengths and average sublength are obtained based on such parameters. When the field-extension degree is $ 1 $, it is shown that sum-rank isometry classes of sum-rank Hamming codes are in bijective correspondence with maximal-size partial spreads. In that case, it is also shown that sum-rank Hamming codes are perfect codes for the sum-rank metric. Also in that case, estimates on the parameters of sum-rank Hamming codes are given, together with an efficient syndrome decoding algorithm. Duals of sum-rank Hamming codes, called sum-rank simplex codes, are then introduced. Bounds on the minimum sum-rank distance of sum-rank simplex codes are given based on known bounds on the size of partial spreads. As applications, sum-rank Hamming codes are proposed for error correction in multishot matrix-multiplicative channels and to construct locally repairable codes over small fields, including binary.

Includes members:
  Member "reliable and secure multishot network coding using linearized reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "locally repairable convolutional codes with sliding window repair")
  Member "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "optimal locally repairable and secure codes for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "partial spreads in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "maximal ferrers diagram codes constructions and genericity considerations")
  Member "on the locality of codeword symbols":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a locality based approach for coded computation")
  Member "multishot codes for network coding using rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")
  Member "coding for errors and erasures in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the gap between scalar and vector solutions of generalized combination networks")
  Member "properties of codes in rank metric":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "improved veron identification and signature schemes in the rank metric")

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)