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: "shortened regenerating codes"
  Abstract: For general exact repair regenerating codes, the optimal trade-offs between storage size and repair bandwith remain undetermined. Various outer bounds and partial results have been proposed. Using a simple chain rule argument we identify nonnegative differences between the functional repair and the exact repair outer bounds. One of the differences is then bounded from below by the repair data of a shortened subcode. Our main result is a new outer bound for an exact repair regenerating code in terms of its shortened subcodes. In general the new outer bound is implicit and depends on the choice of shortened subcodes. For the linear case we obtain explicit 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 "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"
    - "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"
    - "new codes and inner bounds for exact repair in distributed storage systems"

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

Connected through hyperedge HE-4 (induced by source paper "centralized multi node repair regenerating codes"):
  with members:
    - "cooperative repair constructions of optimal mds codes for all admissible parameters"
    - "optimal mds codes for cooperative repair"
    - "repairing reed solomon codes universally achieving the cut set bound for any number of erasures"
    - "repairing reed solomon codes with two erasures"
    - "repairing multiple failures for scalar mds codes"
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "repairing reed solomon codes with multiple erasures"
    - "minimum storage regenerating codes for all parameters"

Connected through hyperedge HE-5 (induced by source paper "outer bounds on the storage repair bandwidth tradeoff of exact repair regenerating codes"):
  with members:
    - "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"
    - "new codes and inner bounds for exact repair in 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"
    - "zigzag codes mds array codes with optimal rebuilding"

Connected through hyperedge HE-6 (induced by source paper "on secrecy capacity of minimum storage regenerating codes"):
  with members:
    - "toward optimal secure distributed storage systems with exact repair"
    - "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"
    - "codes between mbr and msr points with exact repair property"
    - "outer bounds for exact repair codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "update efficient regenerating codes with minimum per node storage"

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"
    - "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"
    - "exact repair regenerating codes via layered erasure correction and block designs"
    - "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 "a probabilistic approach towards exact repair regeneration codes"):
  with members:
    - "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"
    - "new codes and inner bounds for exact repair in distributed storage systems"
    - "an improved outer bound on the storage repair bandwidth tradeoff of exact repair regenerating codes"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "rate region of the 4 3 3 exact repair regenerating codes"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

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)