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: "storage codes coding rate and repair locality"
  Abstract: The {\em repair locality} of a distributed storage code is the maximum number of nodes that ever needs to be contacted during the repair of a failed node. Having small repair locality is desirable, since it is proportional to the number of disk accesses during repair. However, recent publications show that small repair locality comes with a penalty in terms of code distance or storage overhead if exact repair is required. #R##N#Here, we first review some of the main results on storage codes under various repair regimes and discuss the recent work on possible (information-theoretical) trade-offs between repair locality and other code parameters like storage overhead and code distance, under the exact repair regime. #R##N#Then we present some new information theoretical lower bounds on the storage overhead as a function of the repair locality, valid for all common coding and repair models. In particular, we show that if each of the $n$ nodes in a distributed storage system has storage capacity $\ga$ and if, at any time, a failed node can be {\em functionally} repaired by contacting {\em some} set of $r$ nodes (which may depend on the actual state of the system) and downloading an amount $\gb$ of data from each, then in the extreme cases where $\ga=\gb$ or $\ga = r\gb$, the maximal coding rate is at most $r/(r+1)$ or 1/2, respectively (that is, the excess storage overhead is at least $1/r$ or 1, respectively).

Connected through hyperedge HE-1 (induced by source paper "locality and availability of array codes constructed from subspaces"):
  with members:
    - "nearly optimal constructions of pir and batch codes"
    - "lengthening and extending binary private information retrieval codes"
    - "binary shortened projective reed muller codes for coded private information retrieval"
    - "locality via partially lifted codes"
    - "pir array codes with optimal virtual server rate"
    - "bounds and constructions of codes with multiple localities"
    - "codes with unequal locality"
    - "on private information retrieval array codes"

Connected through hyperedge HE-2 (induced by source paper "pir array codes with optimal virtual server rate"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "nearly optimal constructions of pir and batch codes"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "locality and availability of array codes constructed from subspaces"
    - "lower bound on the redundancy of pir codes"
    - "pir array codes with optimal pir rate"
    - "pir schemes with small download complexity and low storage requirements"
    - "private information retrieval from coded databases with colluding servers"

Connected through hyperedge HE-3 (induced by source paper "repair locality with multiple erasure tolerance"):
  with members:
    - "repair locality from a combinatorial perspective"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "optimal locally repairable linear codes"
    - "optimal locally repairable codes via rank metric codes"
    - "locally repairable codes with multiple repair alternatives"
    - "explicit mbr all symbol locality codes"
    - "optimal locally repairable codes and connections to matroid theory"
    - "optimal linear codes with a local error correction property"

Connected through hyperedge HE-4 (induced by source paper "distributed storage systems based on equidistant subspace codes"):
  with members:
    - "optimal locally repairable codes via rank metric codes"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "access vs bandwidth in codes for storage"
    - "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-5 (induced by source paper "error correcting regenerating and locally repairable codes via rank metric codes"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "xoring elephants novel erasure codes for big data"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "data secrecy in distributed storage systems under exact repair"
    - "explicit mbr all symbol locality codes"
    - "regenerating codes for errors and erasures in distributed storage"
    - "codes with local regeneration"
    - "on locality in distributed storage systems"

Connected through hyperedge HE-6 (induced by source paper "optimal locally repairable codes via rank metric codes"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "xoring elephants novel erasure codes for big data"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "codes with local regeneration"
    - "on locality in distributed storage systems"
    - "error resilience in distributed storage via rank metric codes"
    - "optimal linear codes with a local error correction property"
    - "locally repairable codes"

Connected through hyperedge HE-7 (induced by source paper "characterizations and construction methods for linear functional repair storage codes"):
  with members:
    - "analysis and construction of functional regenerating codes with uncoded repair for distributed storage systems"
    - "a survey on network codes for distributed storage"
    - "searching for minimum storage regenerating codes"
    - "network coding for distributed storage systems"

Connected through hyperedge HE-8 (induced by source paper "an overview of codes tailor made for better repairability in networked distributed storage systems"):
  with members:
    - "on locality in distributed storage systems"
    - "an empirical study of the repair performance of novel coding schemes for networked distributed storage systems"
    - "cooperative regenerating codes"
    - "mds array codes with optimal rebuilding"
    - "self repairing codes for distributed storage a projective geometric construction"
    - "on the locality of codeword symbols"
    - "cooperative regenerating codes for distributed storage systems"
    - "homomorphic self repairing codes for agile maintenance of 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)