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 "explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes"):
  Abstract: It was shown in \cite{GXY18} that the length $n$ of a $q$-ary linear locally recoverable code with distance $d\ge 5$ is upper bounded by $O(dq^3)$. Thus, it is a challenging problem to construct $q$-ary locally recoverable codes with distance $d\ge 5$ and length approaching the upper bound. The paper \cite{GXY18} also gave an algorithmic construction of $q$-ary locally recoverable codes with locality $r$ and length $n=\Omega_r(q^2)$ for $d=5$ and $6$, where $\Omega_r$ means that the implicit constant depends on locality $r$. In the present paper, we present an explicit construction of $q$-ary locally recoverable codes of distance $d= 5$ and $6$ via binary constant weight codes. It turns out that (i) our construction is simpler and more explicit; and (ii) lengths of our codes are larger than those given in \cite{GXY18}.

Includes members:
  Member "how long can optimal locally repairable codes be":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "optimal lrc codes for all lenghts n q":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions")
  Member "construction of optimal locally recoverable codes and connection with hypergraph":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "constructive asymptotic bounds of locally repairable codes via function fields")
  Member "optimal locally repairable codes of distance 3 and 4 via cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "constructive asymptotic bounds of locally repairable codes via function fields")
  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 "cyclic lrc codes binary lrc codes and upper bounds on the distance of cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions")

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)