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: "access vs bandwidth in codes for storage"
  Abstract: Maximum distance separable (MDS) codes are widely used in storage systems to protect against disks (nodes) failures. An (n, k, l) MDS code uses n nodes of capacity l to store k information nodes. The MDS property guarantees the resiliency to any n − k node failures. An optimal bandwidth (resp. optimal access) MDS code communicates (resp. accesses) the minimum amount of data during the recovery process of a single failed node. It was shown that this amount equals a fraction of 1/(n − k) of data stored in each node. In previous optimal bandwidth constructions, l scaled polynomially with k in codes with asymptotic rate < 1. Moreover, in constructions with constant number of parities, i.e. rate approaches 1, l scaled exponentially w.r.t. k. In this paper we focus on the practical case of n − k = 2, and ask the following question: Given the capacity of a node l what is the largest (w.r.t. k) optimal bandwidth (resp. access) (k + 2, k, l) MDS code. We give an upper bound for the general case, and two tight bounds in the special cases of two important families of codes.

Connected through hyperedge HE-1 (induced by source paper "explicit msr codes with optimal access optimal sub packetization and small field size for d k 1 k 2 k 3"):
  with members:
    - "a tight lower bound on the sub packetization level of optimal access msr and mds codes"
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "minimum storage regenerating codes for all parameters"
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "an improved sub packetization bound for minimum storage regenerating codes"

Connected through hyperedge HE-2 (induced by source paper "general sub packetized access optimal regenerating codes"):
  with members:
    - "a high rate msr code with polynomial sub packetization level"
    - "an alternate construction of an access optimal regenerating code with optimal sub packetization level"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "on codes for optimal rebuilding access"

Connected through hyperedge HE-3 (induced by source paper "an alternate construction of an access optimal regenerating code with optimal sub packetization level"):
  with members:
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "on codes for optimal rebuilding access"

Connected through hyperedge HE-4 (induced by source paper "optimal locally repairable and secure codes for distributed storage systems"):
  with members:
    - "zigzag codes mds array codes with optimal rebuilding"
    - "data secrecy in distributed storage systems under exact repair"
    - "explicit mbr all symbol locality codes"
    - "on the delay storage trade off in content download from coded distributed storage systems"
    - "regenerating codes for errors and erasures in distributed storage"
    - "codes with local regeneration"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "error resilience in distributed storage via rank metric codes"

Connected through hyperedge HE-5 (induced by source paper "explicit mds codes for optimal repair bandwidth"):
  with members:
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "a framework of constructions of minimum storage regenerating codes with the optimal update access property for distributed storage systems based on invariant subspace technique"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "an improved sub packetization bound for minimum storage regenerating codes"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "mds array codes with optimal rebuilding"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "on codes for optimal rebuilding access"

Connected through hyperedge HE-6 (induced by source paper "fast product matrix regenerating codes"):
  with members:
    - "core augmenting regenerating coding based recovery for single and concurrent failures in distributed storage systems"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"
    - "regenerating codes a system perspective"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "locally repairable codes"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-7 (induced by source paper "distributed storage systems based on equidistant subspace codes"):
  with members:
    - "optimal locally repairable codes via rank metric codes"
    - "storage codes coding rate and repair locality"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "self repairing codes for distributed storage a projective geometric construction"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "repair optimal erasure codes through hadamard designs"
    - "self repairing homomorphic codes for distributed storage systems"

Connected through hyperedge HE-8 (induced by source paper "fundamental limits on communication for oblivious updates in storage networks"):
  with members:
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "network coding for distributed storage systems"

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)