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: "codes with local regeneration"
  Abstract: Regenerating codes and codes with locality are two schemes that have recently been proposed to ensure data collection and reliability in a distributed storage network. In a situation where one is attempting to repair a failed node, regenerating codes seek to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. In this paper, we provide several constructions for a class of vector codes with locality in which the local codes are regenerating codes, that enjoy both advantages. We derive an upper bound on the minimum distance of this class of codes and show that the proposed constructions achieve this bound. The constructions include both the cases where the local regenerating codes correspond to the MSR as well as the MBR point on the storage-repair-bandwidth tradeoff curve of regenerating codes. Also included is a performance comparison of various code constructions for fixed block length and minimum distance.

Connected through hyperedge HE-1 (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-2 (induced by source paper "the complete hierarchical locality of the punctured simplex code"):
  with members:
    - "codes with hierarchical locality from covering maps of curves"
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "matroid theory and storage codes bounds and constructions"
    - "alphabet dependent bounds for linear locally repairable codes based on residual codes"
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "codes with hierarchical locality"
    - "locality and availability in distributed storage"
    - "optimal locally repairable and secure codes for distributed storage systems"

Connected through hyperedge HE-3 (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-4 (induced by source paper "speeding up distributed machine learning using codes"):
  with members:
    - "a pliable index coding approach to data shuffling"
    - "coded computation over heterogeneous clusters"
    - "short dot computing large linear transforms distributedly using coded short dot products"
    - "minimizing latency for secure distributed computing"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "a unified coding framework for distributed computing with straggling servers"
    - "on the worst case communication overhead for distributed data shuffling"
    - "information theoretic limits of data shuffling for distributed learning"

Connected through hyperedge HE-5 (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"

Connected through hyperedge HE-6 (induced by source paper "alphabet dependent bounds for linear locally repairable codes based on residual codes"):
  with members:
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "matroid theory and storage codes bounds and constructions"
    - "mds code constructions with small sub packetization and near optimal repair bandwidth"
    - "bounds on binary locally repairable codes tolerating multiple erasures"
    - "constructions and properties of linear locally repairable codes"
    - "optimal linear and cyclic locally repairable codes over small fields"
    - "cooperative local repair in distributed storage"
    - "storage capacity of repairable networks"

Connected through hyperedge HE-7 (induced by source paper "combinatorial alphabet dependent bounds for locally recoverable codes"):
  with members:
    - "bounds on the rate of linear locally repairable codes over small alphabets"
    - "cyclic lrc codes binary lrc codes and upper bounds on the distance of cyclic codes"
    - "cooperative local repair in distributed storage"
    - "storage capacity of repairable networks"
    - "bounds on the parameters of locally recoverable codes"
    - "locally recoverable codes on algebraic curves"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"

Connected through hyperedge HE-8 (induced by source paper "list decoding of locally repairable codes"):
  with members:
    - "a family of optimal locally recoverable codes"
    - "optimal locally repairable codes via rank metric codes"
    - "every list decodable code for high noise has abundant near optimal rate puncturings"
    - "optimal locally repairable codes and connections to matroid theory"
    - "on the locality of codeword symbols"

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)