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 "smaller cuts higher lower bounds"):
  Abstract: This paper proves strong lower bounds for distributed computing in the CONGEST model, by presenting the bit-gadget: a new technique for constructing graphs with small cuts. #R##N#The contribution of bit-gadgets is twofold. First, developing careful sparse graph constructions with small cuts extends known techniques to show a near-linear lower bound for computing the diameter, a result previously known only for dense graphs. Moreover, the sparseness of the construction plays a crucial role in applying it to approximations of various distance computation problems, drastically improving over what can be obtained when using dense graphs. #R##N#Second, small cuts are essential for proving super-linear lower bounds, none of which were known prior to this work. In fact, they allow us to show near-quadratic lower bounds for several problems, such as exact minimum vertex cover or maximum independent set, as well as for coloring a graph with its chromatic number. Such strong lower bounds are not limited to NP-hard problems, as given by two simple graph problems in P which are shown to require a quadratic and near-quadratic number of rounds. All of the above are optimal up to logarithmic factors. In addition, in this context, the complexity of the all-pairs-shortest-paths problem is discussed. #R##N#Finally, it is shown that graph constructions for CONGEST lower bounds translate to lower bounds for the semi-streaming model, despite being very different in its nature.

Includes members:
  Member "a faster deterministic distributed algorithm for weighted apsp through pipelining":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a deterministic distributed algorithm for exact weighted all pairs shortest paths in tilde o n 3 2 rounds")
  Member "a deterministic distributed algorithm for exact weighted all pairs shortest paths in tilde o n 3 2 rounds":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fast approximate shortest paths in the congested clique")
  Member "distributed exact weighted all pairs shortest paths in near linear time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "simple and fast distributed computation of betweenness centrality")
  Member "optimal distributed coloring algorithms for planar graphs in the local model":
    also connected through other hyperedges:
      (none)
  Member "distributed exact shortest paths in sublinear time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed edge connectivity in sublinear time")
  Member "a time hierarchy theorem for the local model":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed graph problems through an automata theoretic lens")
  Member "a 2 ϵ approximation for maximum weight matching in the semi streaming model":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "two player hidden pointer chasing and multi pass lower bounds in turnstile streams")
  Member "quadratic and near quadratic lower bounds for the congest model":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "distributed maximum matching verification in congest")

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)