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 asymptotically good locally repairable codes via automorphism groups of function fields"
  Abstract: Locally repairable codes have been investigated extensively in recent years due to practical application in distributed storage as well as theoretical interest. However, not much work on asymptotical behavior of locally repairable codes has been done until now. In particular, there is a little result on constructive lower bound on asymptotical behavior of locally repairable codes. In this paper, we extend the construction given in \cite{BTV17} via automorphism groups of function field towers. The main advantage of our construction is to allow more flexibility of locality. Furthermore, we show that the Gilbert-Varshamov type bound on locally repairable codes can be improved for all sufficiently large alphabet size $q$.

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 optimal locally repairable codes via automorphism groups of rational 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 "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"
    - "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"
    - "codes with hierarchical locality"

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)