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: "exact repair regenerating codes via layered erasure correction and block designs"
  Abstract: A new class of exact-repair regenerating codes is constructed by combining two layers of erasure correction codes together with combinatorial block designs, e.g., Steiner systems, balanced incomplete block designs and t-designs. The proposed codes have the "uncoded repair" property where the nodes participating in the repair simply transfer part of the stored data directly, without performing any computation. The layered error correction structure makes the decoding process rather straightforward, and in general the complexity is low. We show that this construction is able to achieve performance better than time-sharing between the minimum storage regenerating codes and the minimum repair-bandwidth regenerating codes.

Connected through hyperedge HE-1 (induced by source paper "on secure exact repair regenerating codes with a single pareto optimal point"):
  with members:
    - "on the tradeoff region of secure exact repair regenerating codes"
    - "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"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "security concerns in minimum storage cooperative regenerating codes"):
  with members:
    - "on secrecy capacity of minimum storage regenerating codes"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "an alternate construction of an access optimal regenerating code with optimal sub packetization level"
    - "codes between mbr and msr points with exact repair property"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "data secrecy in distributed storage systems under exact repair"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"

Connected through hyperedge HE-3 (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"
    - "new codes and inner bounds for exact repair in distributed storage systems"

Connected through hyperedge HE-4 (induced by source paper "improved upper bounds on systematic length for linear minimum storage regenerating codes"):
  with members:
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "minimum storage regenerating codes for all parameters"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "on secrecy capacity of minimum storage regenerating codes"
    - "a high rate msr code with polynomial sub packetization level"
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "an alternate construction of an access optimal regenerating code with optimal sub packetization level"

Connected through hyperedge HE-5 (induced by source paper "mds codes with progressive engagement property for cloud storage systems"):
  with members:
    - "the storage repair bandwidth trade off of exact repair linear regenerating codes for the case d k n 1"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "rate region of the 4 3 3 exact repair regenerating codes"
    - "optimal repair of mds codes in distributed storage via subspace interference alignment"
    - "a survey on network codes for distributed storage"
    - "exact regeneration codes for distributed storage repair using interference alignment"
    - "explicit codes minimizing repair bandwidth for distributed storage"

Connected through hyperedge HE-6 (induced by source paper "information theoretically secure erasure codes for distributed storage"):
  with members:
    - "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"
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "an improved outer bound on the storage repair bandwidth tradeoff of exact repair regenerating codes"
    - "a framework of constructions of minimum storage regenerating codes with the optimal update access property for distributed storage systems based on invariant subspace technique"
    - "novel repair by transfer codes and systematic exact mbr codes with lower complexities and smaller field sizes"
    - "generalization of rashmi shah kumar minimum storage regenerating codes"

Connected through hyperedge HE-7 (induced by source paper "characterization of secrecy capacity for general msr codes under passive eavesdropping model"):
  with members:
    - "toward optimal secure distributed storage systems with exact repair"
    - "shortened regenerating codes"
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "an alternate construction of an access optimal regenerating code with optimal sub packetization level"
    - "outer bounds for exact repair codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"

Connected through hyperedge HE-8 (induced by source paper "layered exact repair regenerating codes via embedded error correction and block designs"):
  with members:
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "high rate regenerating codes through layering"
    - "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"
    - "simple regenerating codes network coding for cloud storage"
    - "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"

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)