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: "locally recoverable codes from algebraic curves and surfaces"
  Abstract: A code \(\mathcal{C}\) of length n over a finite field F q is a subset of the linear space F q n . The code is called linear if it forms a linear subspace of F q n . The minimum distance d of a code is the minimum pairwise separation between two distinct elements of \(\mathcal{C}\) in the Hamming metric, and if the code \(\mathcal{C}\) is linear, then d is equal to the minimum Hamming weight of a nonzero codeword of \(\mathcal{C}\). We use the notation (n, k, d) to refer to the parameters of a linear k-dimensional code of length n and minimum distance d.

Connected through hyperedge HE-1 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage"):
  with members:
    - "an exponential lower bound on the sub packetization of msr codes"
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "capacity of locally recoverable codes"
    - "a layered architecture for erasure coded consistent distributed storage"
    - "product matrix msr codes with bandwidth adaptive exact repair"
    - "bandwidth adaptive error resilient mbr exact repair regenerating codes"
    - "the storage vs repair bandwidth trade off for multiple failures in clustered storage networks"
    - "a tight lower bound on the sub packetization level of optimal access msr and mds codes"

Connected through hyperedge HE-2 (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-3 (induced by source paper "matroid theory and storage codes bounds and constructions"):
  with members:
    - "improved singleton type bounds for locally repairable codes"
    - "constructions and properties of linear locally repairable codes"
    - "codes with hierarchical locality"
    - "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-4 (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"
    - "optimal locally repairable codes via elliptic curves"
    - "multi erasure locally recoverable codes over small fields"
    - "codes with hierarchical locality"

Connected through hyperedge HE-5 (induced by source paper "explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes"):
  with members:
    - "how long can optimal locally repairable codes be"
    - "optimal lrc codes for all lenghts n q"
    - "construction of optimal locally recoverable codes and connection with hypergraph"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "construction of optimal locally repairable codes via automorphism groups of rational function fields"
    - "optimal locally repairable codes via elliptic curves"
    - "cyclic lrc codes binary lrc codes and upper bounds on the distance of cyclic codes"
    - "locally recoverable codes on algebraic curves"

Connected through hyperedge HE-6 (induced by source paper "capacity of locally recoverable codes"):
  with members:
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "cooperative local repair in distributed storage"
    - "storage capacity of repairable networks"
    - "bounds on the parameters of locally recoverable codes"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "a family of optimal locally recoverable codes"
    - "optimal locally repairable codes and connections to matroid theory"

Connected through hyperedge HE-7 (induced by source paper "optimal locally repairable codes of distance 3 and 4 via cyclic codes"):
  with members:
    - "rate optimal binary linear locally repairable codes with small availability"
    - "construction of optimal locally repairable codes via automorphism groups of rational function fields"
    - "optimal locally repairable codes via elliptic curves"
    - "locally recoverable codes on algebraic curves"
    - "a family of optimal locally recoverable codes"
    - "on the locality of codeword symbols in non linear codes"
    - "optimal locally repairable codes via rank metric codes"
    - "optimal locally repairable codes and connections to matroid theory"

Connected through hyperedge HE-8 (induced by source paper "explicit optimal length locally repairable codes of distance 5"):
  with members:
    - "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"
    - "affine cartesian codes with complementary duals"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "construction of optimal locally repairable codes via automorphism groups of rational function fields"
    - "optimal locally repairable codes via elliptic curves"
    - "a family of optimal locally recoverable codes"
    - "optimal locally repairable codes via rank metric codes"

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)