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: "new codes and inner bounds for exact repair in distributed storage systems"
  Abstract: We study the exact-repair tradeoff between storage and repair bandwidth in distributed storage systems (DSS). We give new inner bounds for the tradeoff region and provide code constructions that achieve these bounds.

Connected through hyperedge HE-1 (induced by source paper "cascade codes for distributed storage systems"):
  with members:
    - "a generic transformation to enable optimal repair in mds codes for distributed storage systems"
    - "determinant codes with helper independent repair for single and multiple failures"
    - "a class of msr codes for clustered distributed storage"
    - "product matrix msr codes with bandwidth adaptive exact repair"
    - "bandwidth adaptive error resilient mbr exact repair regenerating codes"
    - "a tight lower bound on the sub packetization level of optimal access msr and mds codes"
    - "capacity of clustered distributed storage"
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"

Connected through hyperedge HE-2 (induced by source paper "multilevel diversity coding with secure regeneration separate coding achieves the mbr point"):
  with members:
    - "on the tradeoff region of secure exact repair regenerating codes"
    - "minimum storage regenerating codes for all parameters"
    - "general sub packetized access optimal regenerating codes"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "hashtag erasure codes from theory to practice"
    - "toward optimal secure distributed storage systems with exact repair"
    - "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1"
    - "layered exact repair regenerating codes via embedded error correction and block designs"

Connected through hyperedge HE-3 (induced by source paper "on the achievability region of regenerating codes for multiple erasures"):
  with members:
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "minimum storage regenerating codes for all parameters"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "centralized repair of multiple node failures with applications to communication efficient secret sharing"
    - "shortened regenerating codes"
    - "a note on the rate region of exact repair regenerating codes"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "outer bounds for exact repair codes"

Connected through hyperedge HE-4 (induced by source paper "determinant codes with helper independent repair for single and multiple failures"):
  with members:
    - "cooperative repair constructions of optimal mds codes for all admissible parameters"
    - "centralized multi node repair regenerating codes"
    - "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"
    - "shortened regenerating codes"
    - "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1"
    - "layered exact repair regenerating codes via embedded error correction and block designs"

Connected through hyperedge HE-5 (induced by source paper "on the tradeoff region of secure exact repair regenerating codes"):
  with members:
    - "a note on secure minimum storage regenerating codes"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "toward optimal secure distributed storage systems with exact repair"
    - "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1"
    - "on secrecy capacity of minimum storage regenerating codes"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "symmetrical multilevel diversity coding and subset entropy inequalities"
    - "outer bounds for exact repair codes"

Connected through hyperedge HE-6 (induced by source paper "a connection between locally repairable codes and exact regenerating codes"):
  with members:
    - "when locally repairable codes meet regenerating codes what if some helpers are unavailable"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "locally repairable codes and matroid theory"
    - "codes between mbr and msr points with exact repair property"
    - "when and by how much can helper node selection improve regenerating codes"
    - "outer bounds for exact repair codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-7 (induced by source paper "toward optimal secure distributed storage systems with exact repair"):
  with members:
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "outer bounds for exact repair codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "an improved outer bound on the storage repair bandwidth tradeoff of exact repair regenerating codes"
    - "data secrecy in distributed storage systems under exact repair"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"
    - "rate region of the 4 3 3 exact repair regenerating codes"

Connected through hyperedge HE-8 (induced by source paper "outer bounds on the storage repair bandwidth tradeoff of exact repair regenerating codes"):
  with members:
    - "shortened regenerating codes"
    - "a note on the rate region of exact repair regenerating codes"
    - "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "outer bounds for exact repair codes"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "an improved outer bound on the storage repair bandwidth tradeoff of exact repair regenerating codes"
    - "zigzag codes mds array codes with optimal rebuilding"

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)