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: "increasing availability in distributed storage systems via clustering"
  Abstract: We introduce the Fixed Cluster Repair System (FCRS) as a novel architecture for Distributed Storage Systems (DSS), achieving a small repair bandwidth while guaranteeing a high availability. Specifically we partition the set of servers in a DSS into $s$ clusters and allow a failed server to choose any cluster other than its own as its repair group. Thereby, we guarantee an availability of $s-1$. We characterize the repair bandwidth vs. storage trade-off for the FCRS under functional repair and show that the minimum repair bandwidth can be improved by an asymptotic multiplicative factor of $2/3$ compared to the state of the art coding techniques that guarantee the same availability. We further introduce Cubic Codes designed to minimize the repair bandwidth of the FCRS under the exact repair model. We prove an asymptotic multiplicative improvement of $0.79$ in the minimum repair bandwidth compared to the existing exact repair coding techniques that achieve the same availability. We show that Cubic Codes are information-theoretically optimal for the FCRS with $2$ and $3$ complete clusters. Furthermore, under the repair-by-transfer model, Cubic Codes are optimal irrespective of the number of clusters.

Connected through hyperedge HE-1 (induced by source paper "explicit constructions of msr codes for clustered distributed storage the rack aware storage model"):
  with members:
    - "a generic transformation to enable optimal repair in mds codes for distributed storage systems"
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "rack aware regenerating codes for data centers"
    - "cooperative repair constructions of optimal mds codes for all admissible parameters"
    - "a class of msr codes for clustered distributed storage"
    - "erasure coding for distributed storage an overview"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "a tight lower bound on the sub packetization level of optimal access msr and mds codes"

Connected through hyperedge HE-2 (induced by source paper "explicit construction of mbr codes for clustered distributed storage"):
  with members:
    - "explicit constructions of msr codes for clustered distributed storage the rack aware storage model"
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "a class of msr codes for clustered distributed storage"
    - "secure clustered distributed storage against eavesdroppers"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "locality and availability of array codes constructed from subspaces"
    - "capacity of clustered distributed storage"
    - "minimum storage regenerating codes for all parameters"

Connected through hyperedge HE-3 (induced by source paper "explicit constructions of mbr and msr codes for clustered distributed storage"):
  with members:
    - "explicit constructions of msr codes for clustered distributed storage the rack aware storage model"
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "a class of msr codes for clustered distributed storage"
    - "secure clustered distributed storage against eavesdroppers"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "locality and availability of array codes constructed from subspaces"
    - "capacity of clustered distributed storage"
    - "minimum storage regenerating codes for all parameters"

Connected through hyperedge HE-4 (induced by source paper "functional repair codes a view from projective geometry"):
  with members:
    - "cooperative repair constructions of optimal mds codes for all admissible parameters"
    - "on the achievability region of regenerating codes for multiple erasures"
    - "a class of msr codes for clustered distributed storage"
    - "locality and availability of array codes constructed from subspaces"
    - "a tight lower bound on the sub packetization level of optimal access msr and mds codes"
    - "optimal fractional repetition codes and fractional repetition batch codes"
    - "fractional repetition and erasure batch codes"
    - "on the combinatorics of locally repairable codes via matroid theory"

Connected through hyperedge HE-5 (induced by source paper "a class of msr codes for clustered distributed storage"):
  with members:
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "optimal repair layering for erasure coded data centers from theory to practice"
    - "capacity of clustered distributed storage"
    - "minimum storage regenerating codes for all parameters"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "codes between mbr and msr points with exact repair property"
    - "a family of optimal locally recoverable codes"
    - "optimal locally repairable codes and connections to matroid theory"

Connected through hyperedge HE-6 (induced by source paper "multi rack distributed data storage networks"):
  with members:
    - "the storage versus repair bandwidth trade off for clustered storage systems"
    - "capacity of clustered distributed storage"
    - "maximally recoverable codes for grid like topologies"
    - "architecture aware coding for distributed storage repairable block failure resilient codes"
    - "codes with hierarchical locality"
    - "xoring elephants novel erasure codes for big data"
    - "a realistic distributed storage system that minimizes data storage and repair bandwidth"
    - "locally repairable codes with multiple repair alternatives"

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)