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: "byzantine fault tolerance of regenerating codes"
  Abstract: Recent years have witnessed a slew of coding techniques custom designed for networked storage systems. Network coding inspired regenerating codes are the most prolifically studied among these new age storage centric codes. A lot of effort has been invested in understanding the fundamental achievable trade-offs of storage and bandwidth usage to maintain redundancy in presence of different models of failures, showcasing the efficacy of regenerating codes with respect to traditional erasure coding techniques. For practical usability in open and adversarial environments, as is typical in peer-to-peer systems, we need however not only resilience against erasures, but also from (adversarial) errors. In this paper, we study the resilience of generalized regenerating codes (supporting multi-repairs, using collaboration among newcomers) in the presence of two classes of Byzantine nodes, relatively benign selfish (non-cooperating) nodes, as well as under more active, malicious polluting nodes. We give upper bounds on the resilience capacity of regenerating codes, and show that the advantages of collaborative repair can turn to be detrimental in the presence of Byzantine nodes. We further exhibit that system mechanisms can be combined with regenerating codes to mitigate the effect of rogue nodes.

Connected through hyperedge HE-1 (induced by source paper "bandwidth adaptive error resilient mbr exact repair regenerating codes"):
  with members:
    - "product matrix msr codes with bandwidth adaptive exact repair"
    - "product matrix minimum storage regenerating codes with flexible number of helpers"
    - "mds codes with progressive engagement property for cloud storage systems"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "on mbr codes with replication"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "information theoretically secure erasure codes for distributed storage"
    - "beyond the mds bound in distributed cloud storage"

Connected through hyperedge HE-2 (induced by source paper "cooperative repair of multiple node failures in distributed storage systems"):
  with members:
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "security concerns in minimum storage cooperative regenerating codes"
    - "a high rate msr code with polynomial sub packetization level"
    - "cooperative local repair in distributed storage"
    - "repairing reed solomon codes"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"
    - "xoring elephants novel erasure codes for big data"

Connected through hyperedge HE-3 (induced by source paper "variable packet error coding"):
  with members:
    - "regenerating codes for errors and erasures in distributed storage"
    - "error resilience in distributed storage via rank metric codes"
    - "erasure multiple descriptions"
    - "polytope codes against adversaries in networks"
    - "network codes resilient to jamming and eavesdropping"
    - "security in distributed storage systems by communicating a logarithmic number of bits"
    - "a survey on network codes for distributed storage"

Connected through hyperedge HE-4 (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-5 (induced by source paper "optimal construction of regenerating code through rate matching in hostile networks"):
  with members:
    - "toward optimal secure distributed storage systems with exact repair"
    - "repairing reed solomon codes"
    - "beyond the mds bound in distributed cloud storage"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "multilevel diversity coding with regeneration"
    - "regenerating codes for errors and erasures in distributed storage"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "exact cooperative regenerating codes with minimum repair bandwidth for distributed storage"

Connected through hyperedge HE-6 (induced by source paper "error correcting regenerating and locally repairable codes via rank metric codes"):
  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"
    - "data secrecy in distributed storage systems under exact repair"
    - "storage codes coding rate and repair locality"
    - "explicit mbr all symbol locality codes"
    - "regenerating codes for errors and erasures in distributed storage"
    - "codes with local regeneration"

Connected through hyperedge HE-7 (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"
    - "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-8 (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"
    - "repair optimal erasure codes through hadamard designs"
    - "exact regenerating codes for byzantine fault tolerance in distributed storage"
    - "optimal repair of mds codes in distributed storage via subspace interference alignment"

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.DC(Distributed, Parallel, and Cluster Computing)