human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "repair locality with multiple erasure tolerance"
  Abstract: In distributed storage systems, erasure codes with locality    \(r\)    are preferred because a coordinate can be locally repaired by accessing at most    \(r\)    other coordinates which in turn greatly reduces the disk I/O complexity for small    \(r\)   . However, the local repair may not be performed when some of the    \(r\)    coordinates are also erased. To overcome this problem, we propose the   \((r,\delta )_{c}\)   -locality providing    \(\delta -1\)    nonoverlapping local repair groups of size no more than    \(r\)    for a coordinate. Consequently, the repair locality    \(r\)    can tolerate    \(\delta -1\)    erasures in total. We derive an upper bound on the minimum distance for any linear    \([n,k]\)    code with information    \((r,\delta )_{c}\)   -locality. Then, we prove existence of the codes that attain this bound when    \(n\geq k(r(\delta -1)+1)\)   . Although the locality    \((r,\delta )\)    defined by Prakash  et al.  provides the same level of locality and local repair tolerance as our definition, codes with    \((r,\delta )_{c}\)   -locality attaining the bound are proved to have more advantage in the minimum distance. In particular, we construct a class of codes with all symbol    \((r,\delta )_{c}\)   -locality where the gain in minimum distance is    \(\Omega (\sqrt {r})\)    and the information rate is close to 1.

Connected through hyperedge HE-1 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes"):
  with members:
    - "array codes with local properties"
    - "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"
    - "how long can optimal locally repairable codes be"
    - "explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes"
    - "on optimal locally repairable codes with super linear length"
    - "explicit optimal length locally repairable codes of distance 5"
    - "locality and availability of array codes constructed from subspaces"
    - "optimal locally repairable codes via elliptic curves"

Connected through hyperedge HE-2 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies"):
  with members:
    - "on maximally recoverable codes for product topologies"
    - "maximally recoverable lrcs a field size lower bound and constructions for few heavy parities"
    - "maximally recoverable codes for grid like topologies"
    - "binary codes with locality for multiple erasures having short block length"
    - "optimal binary locally repairable codes via anticodes"
    - "binary linear locally repairable codes"
    - "locally recoverable codes on algebraic curves"
    - "codes with locality for two erasures"

Connected through hyperedge HE-3 (induced by source paper "analyzing the download time of availability codes"):
  with members:
    - "straggler mitigation at scale"
    - "simplex queues for hot data download"
    - "on the service capacity region of accessing erasure coded content"
    - "rate optimal binary linear locally repairable codes with small availability"
    - "efficient redundancy techniques for latency reduction in cloud systems"
    - "provably delay efficient data retrieving in storage clouds"
    - "locality and availability in distributed storage"
    - "bounds on locally recoverable codes with multiple recovering sets"

Connected through hyperedge HE-4 (induced by source paper "locally recoverable j affine variety codes"):
  with members:
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "how long can optimal locally repairable codes be"
    - "new binary and ternary lcd codes"
    - "classical and quantum evaluation codes at the trace roots"
    - "on the distance of stabilizer quantum codes from j affine variety codes"
    - "constructions of optimal cyclic r delta locally repairable codes"
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
    - "cooperative local repair in distributed storage"

Connected through hyperedge HE-5 (induced by source paper "lifted multiplicity codes and the disjoint repair group property"):
  with members:
    - "batch and pir codes and their connections to locally repairable codes"
    - "nearly optimal constructions of pir and batch codes"
    - "locality via partially lifted codes"
    - "lower bound on the redundancy of pir codes"
    - "bounds on the parameters of locally recoverable codes"
    - "high rate locally correctable and locally testable codes with sub polynomial query complexity"
    - "locality and availability in distributed storage"
    - "bounds on locally recoverable codes with multiple recovering sets"

Connected through hyperedge HE-6 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions"):
  with members:
    - "explicit msr codes with optimal access optimal sub packetization and small field size for d k 1 k 2 k 3"
    - "a tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures"
    - "optimal lrc codes for all lenghts n q"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "on optimal ternary locally repairable codes"
    - "liquid cloud storage"
    - "rate optimal binary linear locally repairable codes with small availability"
    - "bounds and constructions of codes with all symbol locality and availability"

Connected through hyperedge HE-7 (induced by source paper "extended integrated interleaved codes over any field with applications to locally recoverable codes"):
  with members:
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "optimal lrc codes for all lenghts n q"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "erasure coding for distributed storage an overview"
    - "maximally recoverable lrcs a field size lower bound and constructions for few heavy parities"
    - "bounds and constructions for linear locally repairable codes over binary fields"
    - "optimal binary linear locally repairable codes with disjoint repair groups"
    - "extended product and integrated interleaved codes"

Connected through hyperedge HE-8 (induced by source paper "a tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures"):
  with members:
    - "on minimum distance of locally repairable codes"
    - "binary codes with locality for multiple erasures having short block length"
    - "binary codes with locality for four erasures"
    - "codes with hierarchical locality"
    - "binary locally repairable codes sequential repair for multiple erasures"
    - "an upper bound on the minimum distance of ldpc codes over gf q"
    - "locally repairable codes with functional repair and multiple erasure tolerance"
    - "bounds on the parameters of locally recoverable codes"

Question: Please tell me which class the center node 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)