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 "topology induced enhancement of mappings"):
  Abstract: In this paper we propose a new method to enhance a mapping $\mu(\cdot)$ of a parallel application's computational tasks to the processing elements (PEs) of a parallel computer. #R##N#The idea behind our method \mswap is to enhance such a mapping by drawing on the observation that many topologies take the form of a partial cube. #R##N#This class of graphs includes all rectangular and cubic meshes, any such torus with even extensions in each dimension, all hypercubes, and all trees. #R##N#Following previous work, we represent the parallel application and the parallel computer by graphs $G_a = (V_a, E_a)$ and $G_p = (V_p, E_p)$. #R##N#$G_p$ being a partial cube allows us to label its vertices, the PEs, by bitvectors such that the cost of exchanging one unit of information between two vertices $u_p$ and $v_p$ of $G_p$ amounts to the Hamming distance between the labels of $u_p$ and $v_p$. #R##N#By transferring these bitvectors from $V_p$ to $V_a$ via $\mu^{-1}(\cdot)$ and extending them to be unique on $V_a$, we can enhance $\mu(\cdot)$ by swapping labels of $V_a$ in a new way. #R##N#Pairs of swapped labels are local \wrt the PEs, but not \wrt $G_a$. Moreover, permutations of the bitvectors' entries give rise to a plethora of hierarchies on the PEs. Through these hierarchies we turn \mswap into a hierarchical method for improving $\mu(\cdot)$ that is complementary to state-of-the-art methods for computing $\mu(\cdot)$ in the first place. #R##N#In our experiments we use \mswap to enhance mappings of complex networks onto rectangular meshes and tori with 256 and 512 nodes, as well as hypercubes with 256 nodes. It turns out that common quality measures of mappings derived from state-of-the-art algorithms can be improved considerably.

Includes members:
  Member "better process mapping and sparse quadratic assignment":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "load balanced bottleneck objectives in process mapping")
  Member "algorithms for mapping parallel processes onto grid and torus architectures":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "better process mapping and sparse quadratic assignment")
  Member "recent advances in graph partitioning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multilevel acyclic hypergraph partitioning")
  Member "kahip v0 53 karlsruhe high quality partitioning user guide":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multilevel acyclic hypergraph partitioning")
  Member "advanced coarsening schemes for graph partitioning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximating spectral clustering via sampling a review")
  Member "recognizing partial cubes in quadratic time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "medians in median graphs in linear time")

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)