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 "rate optimal binary linear locally repairable codes with small availability"):
  Abstract: A locally repairable code with availability has the property that every code symbol can be recovered from multiple, disjoint subsets of other symbols of small size. In particular, a code symbol is said to have $(r,t)$-availability if it can be recovered from $t$ disjoint subsets, each of size at most $r$. A code with availability is said to be 'rate-optimal', if its rate is maximum among the class of codes with given locality, availability, and alphabet size. #R##N#This paper focuses on rate-optimal binary, linear codes with small availability, and makes three contributions. First, it establishes tight upper bounds on the rate of binary linear codes with $(r,2)$ and $(2,3)$ availability. Second, it establishes a uniqueness result for binary rate-optimal codes, showing that for certain classes of binary linear codes with $(r,2)$ and $(2,3)$-availability, any rate optimal code must be a direct sum of shorter rate optimal codes. Finally, it derives properties of locally repairable linear codes associated with convex polyhedra, focusing on the codes associated with the Platonic solids. It demonstrates that these codes are locally repairable with $t = 2$, and that the codes associated with (geometric) dual polyhedra are (coding theoretic) duals of each other.

Includes members:
  Member "locally rewritable codes for resistive memories":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "redundancy allocation in finite length nested codes for nonvolatile memories")
  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 "bounds on codes with locality and availability":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions")
  Member "a bound on rate of codes with locality with sequential recovery from multiple erasures":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "edge coloring and stopping sets analysis in product codes with mds components")
  Member "binary codes with locality for multiple erasures having short block length":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies")
  Member "cyclic lrc codes binary lrc codes and upper bounds on the distance of cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions")
  Member "optimal linear and cyclic locally repairable codes over small fields":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the complete hierarchical locality of the punctured simplex code")
  Member "codes with hierarchical locality":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on optimal locally repairable codes and generalized sector disk 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)