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 "improved distributed degree splitting and edge coloring"):
  Abstract: The degree splitting problem requires coloring the edges of a graph red or blue such that each node has almost the same number of edges in each color, up to a small additive discrepancy. The directed variant of the problem requires orienting the edges such that each node has almost the same number of incoming and outgoing edges, again up to a small additive discrepancy. #R##N#We present deterministic distributed algorithms for both variants, which improve on their counterparts presented by Ghaffari and Su [SODA'17]: our algorithms are significantly simpler and faster, and have a much smaller discrepancy. This also leads to a faster and simpler deterministic algorithm for $(2+o(1))\Delta$-edge-coloring, improving on that of Ghaffari and Su.

Includes members:
  Member "distributed approximation algorithms for maximum matching in graphs and hypergraphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed edge coloring in time quasi polylogarithmic in delta")
  Member "deterministic distributed edge coloring with fewer colors":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed edge coloring in time quasi polylogarithmic in delta")
  Member "deterministic distributed edge coloring via hypergraph maximal matching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed maximum matching verification in congest")
  Member "on derandomizing local distributed algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed maximum matching verification in congest")
  Member "distributed degree splitting edge coloring and orientations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed edge coloring in time quasi polylogarithmic in delta")
  Member "an exponential separation between randomized and deterministic complexity in the local model":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "truly tight in delta bounds for bipartite maximal matching and variants")
  Member "a lower bound for the distributed lov asz local lemma":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "distributed edge coloring in time quasi polylogarithmic in delta")
  Member "distributed deterministic edge coloring using bounded neighborhood independence":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "faster deterministic distributed coloring through recursive list coloring")

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)