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: "binary locally repairable codes sequential repair for multiple erasures"
  Abstract: Locally repairable codes (LRC) for distribute storage allow two approaches to locally repair multiple failed nodes: 1) parallel approach, by which each newcomer access a set of $r$ live nodes $(r$ is the repair locality$)$ to download data and recover the lost packet; and 2) sequential approach, by which the newcomers are properly ordered and each newcomer access a set of $r$ other nodes, which can be either a live node or a newcomer ordered before it. An $[n,k]$ linear code with locality $r$ and allows local repair for up to $t$ failed nodes by sequential approach is called an $(n,k,r,t)$-exact locally repairable code (ELRC). #R##N#In this paper, we present a family of binary codes which is equivalent to the direct product of $m$ copies of the $[r+1,r]$ single-parity-check code. We prove that such codes are $(n,k,r,t)$-ELRC with $n=(r+1)^m,k=r^m$ and $t=2^m-1$, which implies that they permit local repair for up to $2^m-1$ erasures by sequential approach. Our result shows that the sequential approach has much bigger advantage than parallel approach.

Connected through hyperedge HE-1 (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-2 (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-3 (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"
    - "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"
    - "on partial maximally recoverable and maximally recoverable codes"

Connected through hyperedge HE-4 (induced by source paper "a rate optimal construction of codes with sequential recovery with low block length"):
  with members:
    - "a tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures"
    - "binary codes with locality for multiple erasures having short block length"
    - "on sequential locally repairable codes"
    - "binary codes with locality for four erasures"
    - "locally repairable codes with functional repair and multiple erasure tolerance"
    - "codes with locality for two erasures"
    - "locally repairable codes"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-5 (induced by source paper "a bound on rate of codes with locality with sequential recovery from multiple erasures"):
  with members:
    - "binary codes with locality for multiple erasures having short block length"
    - "on sequential locally repairable codes"
    - "binary codes with locality for four erasures"
    - "some improvements on locally repairable codes"
    - "locally repairable codes with functional repair and multiple erasure tolerance"
    - "binary linear locally repairable codes"
    - "bounds on the parameters of locally recoverable codes"
    - "repair locality with multiple erasure tolerance"

Connected through hyperedge HE-6 (induced by source paper "binary codes with locality for multiple erasures having short block length"):
  with members:
    - "some improvements on locally repairable codes"
    - "locally repairable codes with functional repair and multiple erasure tolerance"
    - "binary linear locally repairable codes"
    - "bounds on the parameters of locally recoverable codes"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "repair locality from a combinatorial perspective"
    - "codes with locality for two erasures"

Connected through hyperedge HE-7 (induced by source paper "binary codes with locality for four erasures"):
  with members:
    - "binary codes with locality for multiple erasures having short block length"
    - "some improvements on locally repairable codes"
    - "locally repairable codes with functional repair and multiple erasure tolerance"
    - "binary linear locally repairable codes"
    - "bounds on the parameters of locally recoverable codes"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "repair locality from a combinatorial perspective"

Connected through hyperedge HE-8 (induced by source paper "on sequential locally repairable codes"):
  with members:
    - "binary codes with locality for multiple erasures having short block length"
    - "repair locality with multiple erasure tolerance"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "an integer programming based bound for locally repairable codes"
    - "a family of optimal locally recoverable codes"
    - "optimal locally repairable linear codes"
    - "locally repairable codes with multiple repair alternatives"
    - "optimal linear codes with a local error correction property"

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)