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 "codes with hierarchical locality from covering maps of curves"):
  Abstract: Locally recoverable (LRC) codes provide ways of recovering erased coordinates of the codeword without having to access each of the remaining coordinates. A subfamily of LRC codes with hierarchical locality (H-LRC codes) provides added flexibility to the construction by introducing several tiers of recoverability for correcting different numbers of erasures. We present a general construction of codes with 2-level hierarchical locality from maps between algebraic curves and specialize it to several code families obtained from quotients of curves by a subgroup of the automorphism group, including rational, elliptic, Kummer, and Artin-Schreier curves. We further address the question of H-LRC codes with availability, and suggest a general construction of such codes from fiber products of curves. Detailed calculations of parameters for H-LRC codes with availability are performed for Reed-Solomon- and Hermitian-like code families. Finally, we construct asymptotically good families of H-LRC codes from curves related to the Garcia-Stichtenoth tower.

Includes members:
  Member "optimal locally repairable codes of distance 3 and 4 via cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "constructive asymptotic bounds of locally repairable codes via function fields")
  Member "secure coding practices in java challenges and vulnerabilities":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an empirical study of c vulnerabilities in crowd sourced code examples")
  Member "construction of asymptotically good locally repairable codes via automorphism groups of function fields":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "constructive asymptotic bounds of locally repairable codes via function fields")
  Member "optimal binary linear locally repairable codes with disjoint repair groups":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "extended integrated interleaved codes over any field with applications to locally recoverable codes")
  Member "construction of optimal locally repairable codes via automorphism groups of rational function fields":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "constructive asymptotic bounds of locally repairable codes via function fields")
  Member "locally recoverable codes from algebraic curves and surfaces":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage")
  Member "optimal locally repairable codes via elliptic curves":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "multi erasure locally recoverable codes over small fields":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "extended integrated interleaved codes over any field with applications to locally recoverable codes")

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)