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 "linear in delta lower bounds in the local model"):
  Abstract: By prior work, there is a distributed algorithm that finds a maximal fractional matching (maximal edge packing) in $O(\Delta)$ rounds, where $\Delta$ is the maximum degree of the graph. We show that this is optimal: there is no distributed algorithm that finds a maximal fractional matching in $o(\Delta)$ rounds. #R##N#Our work gives the first linear-in-$\Delta$ lower bound for a natural graph problem in the standard model of distributed computing---prior lower bounds for a wide range of graph problems have been at best logarithmic in $\Delta$.

Includes members:
  Member "no sublogarithmic time approximation scheme for bipartite vertex cover":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the complexity of local distributed graph problems")
  Member "lower bounds for local approximation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a breezing proof of the kmw bound")
  Member "distributed maximal matching greedy is optimal":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "truly tight in delta bounds for bipartite maximal matching and variants")
  Member "the locality of distributed symmetry breaking":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed maximum matching verification in congest")
  Member "local computation lower and upper bounds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)