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: "locally repairable codes with functional repair and multiple erasure tolerance"
  Abstract: We consider the problem of designing [n; k] linear codes for distributed storage systems (DSS) that satisfy the (r, t)-Local Repair Property, where any t'(<=t) simultaneously failed nodes can be locally repaired, each with locality r. The parameters n, k, r, t are positive integers such that r<k<n and t <= n-k. We consider the functional repair model and the sequential approach for repairing multiple failed nodes. By functional repair, we mean that the packet stored in each newcomer is not necessarily an exact copy of the lost data but a symbol that keep the (r, t)-local repair property. By the sequential approach, we mean that the t' newcomers are ordered in a proper sequence such that each newcomer can be repaired from the live nodes and the newcomers that are ordered before it. Such codes, which we refer to as (n, k, r, t)-functional locally repairable codes (FLRC), are the most general class of LRCs and contain several subclasses of LRCs reported in the literature. #R##N#In this paper, we aim to optimize the storage overhead (equivalently, the code rate) of FLRCs. We derive a lower bound on the code length n given t belongs to {2,3} and any possible k, r. For t=2, our bound generalizes the rate bound proved in [14]. For t=3, our bound improves the rate bound proved in [10]. We also give some onstructions of exact LRCs for t belongs to {2,3} whose length n achieves the bound of (n, k, r, t)-FLRC, which proves the tightness of our bounds and also implies that there is no gap between the optimal code length of functional LRCs and exact LRCs for certain sets of parameters. Moreover, our constructions are over the binary field, hence are of interest in practice.

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 "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"
    - "bounds on the parameters of locally recoverable codes"
    - "on partial maximally recoverable and maximally recoverable codes"

Connected through hyperedge HE-3 (induced by source paper "locally repairable codes with unequal local erasure correction"):
  with members:
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "constructions of optimal cyclic r delta locally repairable codes"
    - "constructions and properties of linear locally repairable codes"
    - "bounds on the maximal minimum distance of linear locally repairable codes"
    - "cyclic lrc codes and their subfield subcodes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally 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"
    - "binary locally repairable codes sequential repair for multiple erasures"
    - "codes with locality for two erasures"
    - "locally repairable codes"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-5 (induced by source paper "centralized multi node repair regenerating codes"):
  with members:
    - "cooperative repair constructions of optimal mds codes for all admissible parameters"
    - "optimal mds codes for cooperative repair"
    - "repairing reed solomon codes universally achieving the cut set bound for any number of erasures"
    - "repairing reed solomon codes with two erasures"
    - "repairing multiple failures for scalar mds codes"
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "repairing reed solomon codes with multiple erasures"
    - "minimum storage regenerating codes for all parameters"

Connected through hyperedge HE-6 (induced by source paper "rate optimal binary linear locally repairable codes with small availability"):
  with members:
    - "locally rewritable codes for resistive memories"
    - "bounds on the rate of linear locally repairable codes over small alphabets"
    - "bounds on codes with locality and availability"
    - "a bound on rate of codes with locality with sequential recovery from multiple erasures"
    - "binary codes with locality for multiple erasures having short block length"
    - "cyclic lrc codes binary lrc codes and upper bounds on the distance of cyclic codes"
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "codes with hierarchical locality"

Connected through hyperedge HE-7 (induced by source paper "centralized repair of multiple node failures with applications to communication efficient secret sharing"):
  with members:
    - "on the tradeoff region of secure exact repair regenerating codes"
    - "minimum storage regenerating codes for all parameters"
    - "broadcast repair for wireless distributed storage systems"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "security concerns in minimum storage cooperative regenerating codes"
    - "optimal rebuilding of multiple erasures in mds codes"
    - "on secrecy capacity of minimum storage regenerating codes"
    - "a high rate msr code with polynomial sub packetization level"

Connected through hyperedge HE-8 (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"
    - "binary locally repairable codes sequential repair for multiple erasures"
    - "some improvements on locally repairable codes"
    - "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)