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 "distributed computing on core periphery networks axiom based design"):
  Abstract: Inspired by social networks and complex systems, we propose a core-periphery network architecture that supports fast computation for many distributed algorithms and is robust and efficient in number of links. Rather than providing a concrete network model, we take an axiom-based design approach. We provide three intuitive (and independent) algorithmic axioms and prove that any network that satisfies all axioms enjoys an efficient algorithm for a range of tasks (e.g., MST, sparse matrix multiplication, etc.). We also show the minimality of our axiom set: for networks that satisfy any subset of the axioms, the same efficiency cannot be guaranteed for any deterministic algorithm.

Includes members:
  Member "distributed computation of large scale graph problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "super fast distributed algorithms for metric facility location":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed approximation algorithms for steiner tree in the mathcal congested mathcal clique")
  Member "optimal deterministic routing and sorting on the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exponentially faster shortest paths in the congested clique")
  Member "tri tri again finding triangles and small subgraphs in a distributed setting":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "parallel algorithms for small subgraph counting")
  Member "from caesar to twitter an axiomatic approach to elites of social networks":
    also connected through other hyperedges:
      (none)
  Member "tight bounds for parallel randomized load balancing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "simple and sharp analysis of k means")
  Member "the hardness of median in the synchronized bit communication model":
    also connected through other hyperedges:
      (none)
  Member "an analysis of the skype peer to peer internet telephony protocol":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "peer to peer based social networks a comprehensive survey")

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)