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 "new bounds on the field size for maximally recoverable codes instantiating grid like topologies"):
  Abstract: In recent years, the rapidly increasing amounts of data created and processed through the internet resulted in distributed storage systems employing erasure coding based schemes. Aiming to balance the tradeoff between data recovery for correlated failures and efficient encoding and decoding, distributed storage systems employing maximally recoverable codes came up. Unifying a number of topologies considered both in theory and practice, Gopalan \cite{Gopalan2017} initiated the study of maximally recoverable codes for grid-like topologies. #R##N#In this paper, we focus on the maximally recoverable codes that instantiate grid-like topologies $T_{m\times n}(1,b,0)$. To characterize the property of codes for these topologies, we introduce the notion of \emph{pseudo-parity check matrix}. Then, using the hypergraph independent set approach, we establish the first polynomial upper bound on the field size needed for achieving the maximal recoverability in topologies $T_{m\times n}(1,b,0)$, when $n$ is large enough. And we further improve this general upper bound for topologies $T_{4\times n}(1,2,0)$ and $T_{3\times n}(1,3,0)$. By relating the problem to generalized \emph{Sidon sets} in $\mathbb{F}_q$, we also obtain non-trivial lower bounds on the field size for maximally recoverable codes that instantiate topologies $T_{4\times n}(1,2,0)$ and $T_{3\times n}(1,3,0)$.

Includes members:
  Member "on maximally recoverable codes for product topologies":
    also connected through other hyperedges:
      (none)
  Member "maximally recoverable lrcs a field size lower bound and constructions for few heavy parities":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "uniform minors in maximally recoverable codes")
  Member "maximally recoverable codes for grid like topologies":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "repair rate lower bounds for distributed storage")
  Member "binary codes with locality for multiple erasures having short block length":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions")
  Member "optimal binary locally repairable codes via anticodes":
    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 "binary linear locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions")
  Member "locally recoverable codes on algebraic curves":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "constructive asymptotic bounds of locally repairable codes via function fields")
  Member "repair locality with multiple erasure tolerance":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)