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: "securing dynamic distributed storage systems against eavesdropping and adversarial attacks"
  Abstract: We address the problem of securing distributed storage systems against eavesdropping and adversarial attacks. An important aspect of these systems is node failures over time, necessitating, thus, a repair mechanism in order to maintain a desired high system reliability. In such dynamic settings, an important security problem is to safeguard the system from an intruder who may come at different time instances during the lifetime of the storage system to observe and possibly alter the data stored on some nodes. In this scenario, we give upper bounds on the maximum amount of information that can be stored safely on the system. For an important operating regime of the distributed storage system, which we call the 'bandwidth-limited regime', we show that our upper bounds are tight and provide explicit code constructions. Moreover, we provide a way to short list the malicious nodes and expurgate the system.

Connected through hyperedge HE-1 (induced by source paper "optimal locally repairable and secure codes for distributed storage systems"):
  with members:
    - "zigzag codes mds array codes with optimal rebuilding"
    - "data secrecy in distributed storage systems under exact repair"
    - "explicit mbr all symbol locality codes"
    - "on the delay storage trade off in content download from coded distributed storage systems"
    - "regenerating codes for errors and erasures in distributed storage"
    - "codes with local regeneration"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "error resilience in distributed storage via rank metric codes"

Connected through hyperedge HE-2 (induced by source paper "data secrecy in distributed storage systems under exact repair"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "xoring elephants novel erasure codes for big data"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "an improved sub packetization bound for minimum storage regenerating codes"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"
    - "regenerating codes for errors and erasures in distributed storage"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "access vs bandwidth in codes for storage"

Connected through hyperedge HE-3 (induced by source paper "update efficient error correcting product matrix codes"):
  with members:
    - "update efficient regenerating codes with minimum per node storage"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "capacity and security of heterogeneous distributed storage systems"):
  with members:
    - "xoring elephants novel erasure codes for big data"
    - "wireless device to device communications with distributed caching"
    - "distributed storage allocations"
    - "non homogeneous distributed storage systems"
    - "allocations for heterogenous distributed storage"
    - "cooperative regenerating codes"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "repairing multiple failures with coordinated and adaptive regenerating codes"

Connected through hyperedge HE-5 (induced by source paper "update efficient regenerating codes with minimum per node storage"):
  with members:
    - "zigzag codes mds array codes with optimal rebuilding"
    - "update efficient error correcting regenerating codes"
    - "regenerating codes for errors and erasures in distributed storage"
    - "mds array codes with optimal rebuilding"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "byzantine fault tolerance of regenerating codes"
    - "repair optimal erasure codes through hadamard designs"
    - "exact regenerating codes for byzantine fault tolerance in distributed storage"

Connected through hyperedge HE-6 (induced by source paper "error resilience in distributed storage via rank metric codes"):
  with members:
    - "zigzag codes mds array codes with optimal rebuilding"
    - "regenerating codes for errors and erasures in distributed storage"
    - "optimal linear codes with a local error correction property"
    - "locally repairable codes"
    - "on the locality of codeword symbols"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "information theoretically secure regenerating codes for distributed storage"
    - "homomorphic self repairing codes for agile maintenance of distributed storage systems"

Connected through hyperedge HE-7 (induced by source paper "regenerating codes for errors and erasures in distributed storage"):
  with members:
    - "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"
    - "mds array codes with optimal rebuilding"
    - "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"
    - "exact regenerating codes for byzantine fault tolerance in distributed storage"
    - "exact regeneration codes for distributed storage repair using interference alignment"
    - "explicit codes minimizing repair bandwidth for distributed storage"

Connected through hyperedge HE-8 (induced by source paper "exact regenerating codes for byzantine fault tolerance in distributed storage"):
  with members:
    - "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"
    - "searching for minimum storage regenerating codes"
    - "explicit construction of optimal exact regenerating codes for distributed storage"
    - "network coding for distributed storage systems"

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)