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: "distributed memory breadth first search on massive graphs"
  Abstract: Author(s): Buluc, Aydin; Beamer, Scott; Madduri, Kamesh; Asanovic, Krste; Patterson, David | Abstract: This chapter studies the problem of traversing large graphs using the breadth-first search order on distributed-memory supercomputers. We consider both the traditional level-synchronous top-down algorithm as well as the recently discovered direction optimizing algorithm. We analyze the performance and scalability trade-offs in using different local data structures such as CSR and DCSC, enabling in-node multithreading, and graph decompositions such as 1D and 2D decomposition.

Connected through hyperedge HE-1 (induced by source paper "the reverse cuthill mckee algorithm in distributed memory"):
  with members:
    - "parallel breadth first search on distributed memory systems"

Connected through hyperedge HE-2 (induced by source paper "predictive partitioning for efficient bfs traversal in social networks"):
  with members:
    - "parallel distributed breadth first search on the kepler architecture"
    - "recent advances in graph partitioning"
    - "fast exact shortest path distance queries on large networks by pruned landmark labeling"
    - "parallel breadth first search on distributed memory systems"

Connected through hyperedge HE-3 (induced by source paper "parallel distributed breadth first search on the kepler architecture"):
  with members:
    - "compression and sieve reducing communication in parallel breadth first search on distributed memory systems"
    - "parallel breadth first search on distributed memory 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.DC(Distributed, Parallel, and Cluster Computing)