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 "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"):
  Abstract: Locally repairable codes (LRCs) are considered with equal or unequal localities, local distances and local field sizes. An explicit two-layer architecture with a sum-rank outer code is obtained, having disjoint local groups and achieving maximal recoverability (MR) for all families of local linear codes (MDS or not) simultaneously, up to a specified maximum locality $ r $. Furthermore, the local linear codes (thus the localities, local distances and local fields) can be efficiently and dynamically modified without global recoding or changes in architecture or outer code, while preserving the MR property, easily adapting to new configurations in storage or new hot and cold data. In addition, local groups and file components can be added, removed or updated without global recoding. The construction requires global fields of size roughly $ g^r $, for $ g $ local groups and maximum or specified locality $ r $. For equal localities, these global fields are smaller than those of previous MR-LRCs when $ r \leq h $ (global parities). For unequal localities, they provide an exponential field size reduction on all previous best known MR-LRCs. For bounded localities and a large number of local groups, the global erasure-correction complexity of the given construction is comparable to that of Tamo-Barg codes or Reed-Solomon codes with local replication, while local repair is as efficient as for the Cartesian product of the local codes. Reed-Solomon codes with local replication and Cartesian products are recovered from the given construction when $ r=1 $ and $ h = 0 $, respectively. The given construction can also be adapted to provide hierarchical MR-LRCs for all types of hierarchies and parameters. Finally, subextension subcodes and sum-rank alternant codes are introduced to obtain further exponential field size reductions, at the expense of lower information rates.

Includes members:
  Member "maximally recoverable codes with hierarchical locality":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "private information retrieval from locally repairable databases with colluding servers")
  Member "reliable and secure multishot network coding using linearized reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "locally repairable convolutional codes with sliding window repair")
  Member "extended integrated interleaved codes over any field with applications to locally recoverable codes":
    also connected through other hyperedges:
      (none)
  Member "random construction of partial mds codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")
  Member "how long can optimal locally repairable codes be":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "constructions of maximally recoverable local reconstruction codes via function fields":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "maximally recoverable codes with hierarchical locality")
  Member "locally repairable codes with unequal local erasure correction":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "locally repairable convolutional codes with sliding window repair")
  Member "optimal locally repairable codes of distance 3 and 4 via cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "constructive asymptotic bounds of locally repairable codes via function fields")

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)