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: "codes with hierarchical locality"
  Abstract: In this paper, we study the notion of {\em codes with hierarchical locality} that is identified as another approach to local recovery from multiple erasures. The well-known class of {\em codes with locality} is said to possess hierarchical locality with a single level. In a {\em code with two-level hierarchical locality}, every symbol is protected by an inner-most local code, and another middle-level code of larger dimension containing the local code. We first consider codes with two levels of hierarchical locality, derive an upper bound on the minimum distance, and provide optimal code constructions of low field-size under certain parameter sets. Subsequently, we generalize both the bound and the constructions to hierarchical locality of arbitrary levels.

Connected through hyperedge HE-1 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes"):
  with members:
    - "array codes with local properties"
    - "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"
    - "how long can optimal locally repairable codes be"
    - "explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes"
    - "on optimal locally repairable codes with super linear length"
    - "explicit optimal length locally repairable codes of distance 5"
    - "locality and availability of array codes constructed from subspaces"
    - "optimal locally repairable codes via elliptic curves"

Connected through hyperedge HE-2 (induced by source paper "the complete hierarchical locality of the punctured simplex code"):
  with members:
    - "codes with hierarchical locality from covering maps of curves"
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "matroid theory and storage codes bounds and constructions"
    - "alphabet dependent bounds for linear locally repairable codes based on residual codes"
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "locality and availability in distributed storage"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-3 (induced by source paper "maximally recoverable codes with hierarchical locality"):
  with members:
    - "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"
    - "constructions of maximally recoverable local reconstruction codes via function fields"
    - "new constructions of sd and mr codes over small finite fields"
    - "explicit maximally recoverable codes with locality"
    - "partial mds codes and their application to raid type of architectures"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-4 (induced by source paper "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"):
  with members:
    - "maximally recoverable codes with hierarchical locality"
    - "reliable and secure multishot network coding using linearized reed solomon codes"
    - "extended integrated interleaved codes over any field with applications to locally recoverable codes"
    - "random construction of partial mds codes"
    - "how long can optimal locally repairable codes be"
    - "constructions of maximally recoverable local reconstruction codes via function fields"
    - "locally repairable codes with unequal local erasure correction"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"

Connected through hyperedge HE-5 (induced by source paper "a tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures"):
  with members:
    - "on minimum distance of locally repairable codes"
    - "binary codes with locality for multiple erasures having short block length"
    - "binary codes with locality for four erasures"
    - "binary locally repairable codes sequential repair for multiple erasures"
    - "an upper bound on the minimum distance of ldpc codes over gf q"
    - "locally repairable codes with functional repair and multiple erasure tolerance"
    - "bounds on the parameters of locally recoverable codes"
    - "on partial maximally recoverable and maximally recoverable codes"

Connected through hyperedge HE-6 (induced by source paper "matroid theory and storage codes bounds and constructions"):
  with members:
    - "locally recoverable codes from algebraic curves and surfaces"
    - "improved singleton type bounds for locally repairable codes"
    - "constructions and properties of linear locally repairable codes"
    - "optimal binary locally repairable codes via anticodes"
    - "pir with low storage overhead coding instead of replication"
    - "bounds for batch codes with restricted query size"
    - "applications of polymatroid theory to distributed storage systems"
    - "bounds on the parameters of locally recoverable codes"

Connected through hyperedge HE-7 (induced by source paper "on optimal locally repairable codes with super linear length"):
  with members:
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "how long can optimal locally repairable codes be"
    - "explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes"
    - "optimal lrc codes for all lenghts n q"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "explicit optimal length locally repairable codes of distance 5"
    - "irregular recovery and unequal locality for locally recoverable codes with availability"
    - "locality and availability of array codes constructed from subspaces"

Connected through hyperedge HE-8 (induced by source paper "codes with hierarchical locality from covering maps of curves"):
  with members:
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "secure coding practices in java challenges and vulnerabilities"
    - "construction of asymptotically good locally repairable codes via automorphism groups of function fields"
    - "optimal binary linear locally repairable codes with disjoint repair groups"
    - "construction of optimal locally repairable codes via automorphism groups of rational function fields"
    - "locally recoverable codes from algebraic curves and surfaces"
    - "optimal locally repairable codes via elliptic curves"
    - "multi erasure locally recoverable codes over small fields"

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)