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: "update efficient regenerating codes with minimum per node storage"
  Abstract: Regenerating codes provide an efficient way to recover data at failed nodes in distributed storage systems. It has been shown that regenerating codes can be designed to minimize the per-node storage (called MSR) or minimize the communication overhead for regeneration (called MBR). In this work, we propose a new encoding scheme for [n,d] error- correcting MSR codes that generalizes our earlier work on error-correcting regenerating codes. We show that by choosing a suitable diagonal matrix, any generator matrix of the [n,{\alpha}] Reed-Solomon (RS) code can be integrated into the encoding matrix. Hence, MSR codes with the least update complexity can be found. An efficient decoding scheme is also proposed that utilizes the [n,{\alpha}] RS code to perform data reconstruction. The proposed decoding scheme has better error correction capability and incurs the least number of node accesses when errors are present.

Connected through hyperedge HE-1 (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-2 (induced by source paper "on secrecy capacity of minimum storage regenerating codes"):
  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"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "repairing reed solomon codes"):
  with members:
    - "repairing reed solomon codes with two erasures"
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "a high rate msr code with polynomial sub packetization level"
    - "communication efficient secret sharing"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "a family of optimal locally recoverable codes"
    - "xoring elephants novel erasure codes for big data"

Connected through hyperedge HE-4 (induced by source paper "a piggybacking design framework for read and download efficient distributed storage codes"):
  with members:
    - "a high rate msr code with polynomial sub packetization level"
    - "repairing reed solomon codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "a family of optimal locally recoverable codes"
    - "repair optimal mds array codes over gf 2"
    - "quasi cyclic flexible regenerating codes"
    - "error correcting regenerating and locally repairable codes via rank metric codes"

Connected through hyperedge HE-5 (induced by source paper "update efficient error correcting product matrix codes"):
  with members:
    - "decentralized minimum cost repair for distributed storage systems"
    - "repair for distributed storage systems with erasure channels"
    - "regenerating codes for errors and erasures in distributed storage"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "byzantine fault tolerance of regenerating codes"
    - "exact regenerating codes for byzantine fault tolerance in distributed storage"
    - "distributed data storage with minimum storage regenerating codes exact and functional repair are asymptotically equally efficient"

Connected through hyperedge HE-6 (induced by source paper "secure cooperative regenerating codes for distributed storage systems"):
  with members:
    - "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"
    - "regenerating codes for errors and erasures in distributed storage"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "exact scalar minimum storage coordinated regenerating codes"
    - "error resilience in distributed storage via rank metric codes"
    - "optimal linear codes with a local error correction property"

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)