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: "construction of optimal locally repairable codes via automorphism groups of rational function fields"
  Abstract: Locally repairable codes, or locally recoverable codes (LRC for short) are designed for application in distributed and cloud storage systems. Similar to classical block codes, there is an important bound called the Singleton-type bound for locally repairable codes. In this paper, an optimal locally repairable code refers to a block code achieving this Singleton-type bound. Like classical MDS codes, optimal locally repairable codes carry some very nice combinatorial structures. Since introduction of the Singleton-type bound for locally repairable codes, people have put tremendous effort on constructions of optimal locally repairable codes. Due to hardness of this problem, there are few constructions of optimal locally repairable codes in literature. Most of these constructions are realized via either combinatorial or algebraic structures. #R##N#In this paper, we employ automorphism groups of rational function fields to construct optimal locally repairable codes by considering the group action on the projective lines over finite fields. It turns out that we are able to construct optimal locally repairable codes with reflexibility of locality as well as smaller alphabet size comparable to the code length. In particular, we produce new families of $q$-ary locally repairable codes, including codes of length $q+1$ via cyclic groups and codes via dihedral groups.

Connected through hyperedge HE-1 (induced by source paper "constructive asymptotic bounds of locally repairable codes via function fields"):
  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"
    - "construction of optimal locally recoverable codes and connection with hypergraph"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "construction of asymptotically good locally repairable codes via automorphism groups of function fields"
    - "optimal locally repairable codes via elliptic curves"
    - "bounds on the parameters of locally recoverable codes"
    - "locally recoverable codes on algebraic curves"

Connected through hyperedge HE-2 (induced by source paper "computing sharp recovery structures for locally recoverable codes"):
  with members:
    - "integrated interleaved codes as locally recoverable codes properties and performance"
    - "cyclic lrc codes and their subfield subcodes"
    - "locally recoverable codes on algebraic curves"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally recoverable codes"
    - "on the ideal associated to a linear code"
    - "locally repairable codes"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-3 (induced by source paper "a new construction of nonlinear codes via rational function fields"):
  with members:
    - "a family of optimal 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"
    - "locally recoverable codes from algebraic curves and surfaces"
    - "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"
    - "locally recoverable codes from algebraic curves and surfaces"
    - "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 "optimal locally repairable codes of distance 3 and 4 via cyclic codes"):
  with members:
    - "rate optimal binary linear locally repairable codes with small availability"
    - "locally recoverable codes from algebraic curves and surfaces"
    - "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-7 (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"
    - "locally recoverable codes from algebraic curves and surfaces"
    - "optimal locally repairable codes via elliptic curves"
    - "a family of optimal locally recoverable codes"
    - "optimal locally repairable codes via rank metric codes"

Connected through hyperedge HE-8 (induced by source paper "optimal lrc codes for all lenghts n q"):
  with members:
    - "optimal binary linear locally repairable codes with disjoint repair groups"
    - "optimal locally repairable codes via elliptic curves"
    - "bounds and constructions of codes with multiple localities"
    - "a family of optimal locally recoverable codes"
    - "optimal locally repairable codes via rank metric codes"
    - "optimal locally repairable codes and connections to matroid theory"
    - "optimal linear codes with a local error correction property"
    - "on the locality of codeword symbols"

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)