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: "on sequential locally repairable codes"
  Abstract: We consider the locally repairable codes (LRC), aiming at sequential recovering multiple erasures. We define the (n,k,r,t)-SLRC (Sequential Locally Repairable Codes) as an [n,k] linear code where any t'(>= t) erasures can be sequentially recovered, each one by r (2 =3 erasures and bounds to evaluate the performance of such codes. #R##N#We first derive a tight upper bound on the code rate of (n, k, r, t)-SLRC for t=3 and r>=2. We then propose two constructions of binary (n, k, r, t)-SLRCs for general r,t>=2 (Existing constructions are dealing with t =2 and odd t>=3. For both constructions, the rates are optimal for t in {2,3} and are higher than most of the existing LRC families for arbitrary t>=4.

Connected through hyperedge HE-1 (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"
    - "binary codes with locality for four erasures"
    - "binary locally repairable codes sequential repair for multiple 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-2 (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"
    - "binary codes with locality for four erasures"
    - "binary locally repairable codes sequential repair for multiple 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"

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)