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 "theory of supports for linear codes endowed with the sum rank metric"):
  Abstract: The sum-rank metric naturally extends both the Hamming and rank metrics in coding theory over fields. It measures the error-correcting capability of codes in multishot matrix-multiplicative channels (e.g. linear network coding or the discrete memoryless channel on fields). Although this metric has already shown to be of interest in several applications, not much is known about it. In this work, sum-rank supports for codewords and linear codes are introduced and studied, with emphasis on duality. The lattice structure of sum-rank supports is given; characterizations of the ambient spaces (\textit{support spaces}) they define are obtained; the classical operations of restriction and shortening are extended to the sum-rank metric; and estimates (bounds and equalities) on the parameters of such restricted and shortened codes are found. Three main applications are given: 1) Generalized sum-rank weights are introduced, together with their basic properties and bounds; 2) It is shown that duals, shortened and restricted codes of maximum sum-rank distance (MSRD) codes are in turn MSRD; 3) Degenerateness and effective lengths of sum-rank codes are introduced and characterized. In an appendix, skew supports are introduced, defined by skew polynomials, and their connection to sum-rank supports is given.

Includes members:
  Member "private information retrieval from locally repairable databases with colluding servers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robust low delay streaming pir using convolutional codes")
  Member "on defining generalized rank weights":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rank metric codes")
  Member "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "private information retrieval from locally repairable databases with colluding servers")
  Member "new criteria for mrd and gabidulin codes and some rank metric code constructions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "decoding high order interleaved rank metric codes")
  Member "relative generalized matrix weights of matrix codes for universal security on wire tap networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reliable and secure multishot network coding using linearized reed solomon codes")
  Member "private information retrieval from coded databases with colluding servers":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "latent variable private information retrieval")
  Member "rank error correcting pairs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "private information retrieval from locally repairable databases with colluding servers")
  Member "relative generalized rank weight of linear codes and its applications to network coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "reliable and secure multishot network coding using linearized reed solomon codes")

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)