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 "bounds and constructions for linear locally repairable codes over binary fields"):
  Abstract: We present two new upper bounds on the dimension $k$ for binary linear locally repairable codes (LRCs). The first one is an explicit bound for binary linear LRCs with disjoint repair groups, which can be regarded as an extension of known explicit bounds for such LRCs to more general code parameters. The second one is based on an optimization problem, and can be applied to any binary linear LRC. By simplifying the second bound for $d\ge5$, we obtain an explicit bound which can outperform the Cadambe-Mazumdar bound for $5 \le d \le 8$ and large $n$. Lastly, we give a new construction of binary linear LRCs with $d \ge 6$, and prove their optimality with respect to the simplified bound.

Includes members:
  Member "bounds and constructions of locally repairable codes parity check matrix approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "irregular recovery and unequal locality for locally recoverable codes with availability")
  Member "bounds on the rate of linear locally repairable codes over small alphabets":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "combinatorial alphabet dependent bounds for locally recoverable codes")
  Member "optimal linear and cyclic locally repairable codes over small fields":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the complete hierarchical locality of the punctured simplex code")
  Member "optimal binary locally repairable codes via anticodes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies")
  Member "bounds on the parameters of locally recoverable codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "codes with locality for two erasures":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies")
  Member "an integer programming based bound for locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies")
  Member "a family of optimal locally recoverable codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a locality based approach for coded computation")

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)