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: "skew in parallel query processing"
  Abstract: We study the problem of computing a conjunctive query q in parallel, using p of servers, on a large database. We consider algorithms with one round of communication, and study the complexity of the communication. We are especially interested in the case where the data is skewed, which is a major challenge for scalable parallel query processing. We establish a tight connection between the fractional edge packings of the query and the amount of communication, in two cases. First, in the case when the only statistics on the database are the cardinalities of the input relations, and the data is skew-free, we provide matching upper and lower bounds (up to a poly log p factor) expressed in terms of fractional edge packings of the query q. Second, in the case when the relations are skewed and the heavy hitters and their frequencies are known, we provide upper and lower bounds (up to a poly log p factor) expressed in terms of packings of residual queries obtained by specializing the query to a heavy hitter. All our lower bounds are expressed in the strongest form, as number of bits needed to be communicated between processors with unlimited computational power. Our results generalizes some prior results on uniform databases (where each relation is a matching) [4], and other lower bounds for the MapReduce model [1].

Connected through hyperedge HE-1 (induced by source paper "parallel algorithms for small subgraph counting"):
  with members:
    - "log diameter rounds algorithms for 2 vertex and 2 edge connectivity"
    - "dynamic algorithms for the massively parallel computation model"
    - "linear time subgraph counting graph degeneracy and the chasm at size six"
    - "exponentially faster massively parallel maximal matching"
    - "faster algorithms for edge connectivity via random 2 out contractions"
    - "massively parallel algorithms for finding well connected components in sparse graphs"
    - "approximating edit distance in truly subquadratic time quantum and mapreduce"
    - "sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation"

Connected through hyperedge HE-2 (induced by source paper "massively parallel algorithms for distance approximation and spanners"):
  with members:
    - "walking randomly massively and efficiently"
    - "dynamic algorithms for the massively parallel computation model"
    - "mapreduce meets fine grained complexity mapreduce algorithms for apsp matrix multiplication 3 sum and beyond"
    - "polylogarithmic time deterministic network decomposition and distributed derandomization"
    - "parallel approximate undirected shortest paths via low hop emulators"
    - "faster parallel algorithm for approximate shortest path"
    - "exponentially faster massively parallel maximal matching"
    - "faster algorithms for edge connectivity via random 2 out contractions"

Connected through hyperedge HE-3 (induced by source paper "lsf join locality sensitive filtering for distributed all pairs set similarity under skew"):
  with members:
    - "hardness of bichromatic closest pair with jaccard similarity"
    - "set similarity search for skewed data"
    - "adaptive mapreduce similarity joins"
    - "when hashes met wedges a distributed algorithm for finding high similarity vectors"
    - "scalable and robust set similarity join"
    - "a framework for similarity search with space time tradeoffs using locality sensitive filtering"
    - "on the complexity of inner product similarity join"
    - "lsh ensemble internet scale domain search"

Connected through hyperedge HE-4 (induced by source paper "a fault tolerance shim for serverless computing"):
  with members:
    - "cloud programming simplified a berkeley view on serverless computing"
    - "serverless computing one step forward two steps back"
    - "occupy the cloud distributed computing for the 99"
    - "serverless computing current trends and open problems"
    - "rethinking serializable multiversion concurrency control"

Connected through hyperedge HE-5 (induced by source paper "instance and output optimal parallel algorithms for acyclic joins"):
  with members:
    - "size bounds and query plans for relational joins"
    - "constraint solving via fractional edge covers"
    - "answering conjunctive queries under updates"
    - "worst case optimal algorithms for parallel query processing"
    - "what do shannon type inequalities submodular width and disjunctive datalog have to do with one another"
    - "it s all a matter of degree using degree information to optimize multiway joins"
    - "the input output complexity of triangle enumeration"
    - "gym a multiround join algorithm in mapreduce"

Connected through hyperedge HE-6 (induced by source paper "topology dependent bounds for faqs"):
  with members:
    - "query to communication lifting for bpp"
    - "juggling functions inside a database"
    - "worst case optimal algorithms for parallel query processing"
    - "tight network topology dependent bounds on rounds of communication"
    - "the range of topological effects on communication"
    - "it s all a matter of degree using degree information to optimize multiway joins"
    - "faq questions asked frequently"
    - "aggregation and ordering in factorised databases"

Connected through hyperedge HE-7 (induced by source paper "simple graph coloring algorithms for congested clique and massively parallel computation"):
  with members:
    - "massively parallel algorithms for finding well connected components in sparse graphs"
    - "sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation"
    - "improved massively parallel computation algorithms for mis matching and vertex cover"
    - "distributed symmetry breaking algorithms for congested cliques"
    - "breaking the linear memory barrier in mpc fast mis on trees with n e memory per machine"
    - "sparse matrix multiplication with bandwidth restricted all to all communication"
    - "greedy and local ratio algorithms in the mapreduce model"
    - "mst in o 1 rounds of the congested clique"

Connected through hyperedge HE-8 (induced by source paper "breaking the linear memory barrier in mpc fast mis on trees with strongly sublinear memory"):
  with members:
    - "matching and mis for uniformly sparse graphs in the low memory mpc model"
    - "massively parallel algorithms for finding well connected components in sparse graphs"
    - "sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation"
    - "brief announcement semi mapreduce meets congested clique"
    - "massively parallel symmetry breaking on sparse graphs mis and maximal matching"
    - "round compression for parallel graph algorithms in strongly sublinear space"
    - "coresets meet edcs algorithms for matching and vertex cover on massive graphs"
    - "simple round compression for parallel vertex cover"

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.DB(Databases)