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: "erasure codes with simplex locality"
  Abstract: Abstract—We focus on erasure codes for distributed storage.The distributed storage setting imposes locality requirementsbecause of easy repair demands on the decoder. We ﬁrstestablish the characterization of various locality properties interms of the generator matrix of the code. These lead to boundson locality and notions of optimality. We then examine thelocality properties of a family of nonbinary codes with simplexstructure. We investigate their optimality and design seve raleasy repair decoding methods. In particular, we show that anycorrectable erasure pattern can be solved by easy repair. I. I NTRODUCTION Several classical coding techniques (such as Reed-Solomon erasure codes) are extensively used for data storage,most successfully applied to storage in RAID systems andmagnetic recording (see [2]). However, due to the fast-growing demand for large-scale data storage, it would beimpossible or extremely expensive to build single piecesof hardware with enough storage capabilities to store theenormous volume of data that is being generated. Hence, newclasses of storage technology have emerged using the idea ofdistributing data across multiple nodes which are intercon-nected over a network, as we witness in some peer-to-peer(P2P) storage systems [3] and data centers [4] that comprisethe backbone infrastructure of cloud computing. We call suchsystems Networked Distributed Storage Systems (NDSS).A fundamental issue that arises in this context is theso-called Repair Problem: how to maintain the encodeddata when failures (node erasures) occur. When a storagenode fails, information that was stored in the node is nolonger accessible. As a remedy a node is then added tothe system to replace the failed node. The added nodedownloads data from a set of appropriate and accessiblenodes to recover the information stored in the failed node.This is called node repair. To assess the performance ofthis repair process, there are several metrics that can beconsidered: storage cost, measured as the amount of datastored in the node, repair bandwidth, measured as the totalnumber of bits communicated in the network for each repairand locality, measured as the number of nodes needed foreach repair. For instance, (n,k)maximum distance separable(MDS) codes are optimal in terms of storage cost sinceany k nodes contain the minimum amount of informationrequired to recover the original data. However, to repair one

Connected through hyperedge HE-1 (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-2 (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"
    - "locally repairable codes with functional repair and multiple erasure tolerance"
    - "optimal locally repairable and secure codes for distributed storage systems"

Connected through hyperedge HE-3 (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-4 (induced by source paper "extended product and integrated interleaved codes"):
  with members:
    - "multi block interleaved codes for local and global read access"
    - "maximally recoverable codes for grid like topologies"
    - "bounds and constructions of codes with multiple localities"
    - "new constructions of sd and mr codes over small finite fields"
    - "integrated interleaved codes as locally recoverable codes properties and performance"
    - "generalized and extended product codes"
    - "density evolution for deterministic generalized product codes on the binary erasure channel at high rates"
    - "repair locality with multiple erasure tolerance"

Connected through hyperedge HE-5 (induced by source paper "codes with unequal disjoint local erasure correction constraints"):
  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"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally recoverable codes"
    - "binary cyclic codes that are locally repairable"

Connected through hyperedge HE-6 (induced by source paper "codes with unequal locality"):
  with members:
    - "bounds and constructions of codes with multiple localities"
    - "codes with hierarchical locality"
    - "optimal binary locally repairable codes via anticodes"
    - "binary linear locally repairable codes"
    - "linear locally repairable codes with random matrices"
    - "locality and availability in distributed storage"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "codes with locality for two erasures"

Connected through hyperedge HE-7 (induced by source paper "integrated interleaved codes as locally recoverable codes properties and performance"):
  with members:
    - "bounds and constructions of codes with multiple localities"
    - "on locally recoverable lrc codes"
    - "repair locality with multiple erasure tolerance"
    - "generalized concatenated types of codes for erasure correction"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally recoverable codes"
    - "explicit maximally recoverable codes with locality"
    - "xoring elephants novel erasure codes for big data"

Connected through hyperedge HE-8 (induced by source paper "bounds and constructions of codes with multiple localities"):
  with members:
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "optimal binary locally repairable codes via anticodes"
    - "a family of optimal locally recoverable codes"
    - "binary cyclic codes that are locally repairable"
    - "optimal locally repairable codes via rank metric codes"
    - "an upper bound on the size of locally recoverable codes"
    - "optimal locally repairable codes and connections to matroid theory"
    - "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)