human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "communication free massively distributed graph generation"):
  Abstract: Analyzing massive complex networks yields promising insights about our everyday lives. Building scalable algorithms to do that is a challenging task that requires a careful analysis and extensive evaluation. However, engineering such algorithms is often hindered by the scarcity of publicly available datasets. Network generators serve as a tool to alleviate this problem by providing synthetic instances with controllable parameters. However, many network generators fail to provide instances on a massive scale due to their sequential nature or resource constraints. Additionally, truly scalable network generators are few and often limited in their realism. In this work, we present novel generators for a variety of network models commonly found in practice. By making use of pseudorandomization and divide-and-conquer schemes, our generators follow a communication-free paradigm, i.e. they require no communication. The resulting generators are often embarrassingly parallel and have a near optimal scaling behavior. Overall, we are able to generate instances of up to $2^{43}$ vertices and $2^{47}$ edges in less than 22 minutes on 32768 processors. Therefore, our generators allow new graph families to be used on an unprecedented scale.

Includes members:
  Member "efficient parallel random sampling vectorized cache efficient and online":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "recent advances in scalable network generation")
  Member "generating massive complex networks with hyperbolic geometry faster in practice":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "recent advances in scalable network generation")
  Member "scalable generation of scale free graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "recent advances in scalable network generation")
  Member "sampling geometric inhomogeneous random graphs in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "understanding the effectiveness of data reduction in public transportation networks")
  Member "geometric inhomogeneous random graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "recent advances in scalable network generation")
  Member "engineering a scalable high quality graph partitioner":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "recent advances in scalable network generation")

Question: Please tell me which class the source paper 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)