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: "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$.

Connected through hyperedge HE-1 (induced by source paper "lower bounds for maximal matchings and maximal independent sets"):
  with members:
    - "an automatic speedup theorem for distributed problems"
    - "hardness of minimal symmetry breaking in distributed computing"
    - "the complexity of distributed edge coloring with small palettes"
    - "improved deterministic distributed matching via rounding"
    - "an exponential separation between randomized and deterministic complexity in the local model"
    - "local conflict coloring"
    - "an improved distributed algorithm for maximal independent set"
    - "a lower bound for the distributed lov asz local lemma"

Connected through hyperedge HE-2 (induced by source paper "a time hierarchy theorem for the local model"):
  with members:
    - "the complexity of distributed edge coloring with small palettes"
    - "lcl problems on grids"
    - "lopsidependency in the moser tardos framework beyond the lopsided lovasz local lemma"
    - "polynomial lower bound for distributed graph coloring in a weak local model"
    - "distributed degree splitting edge coloring and orientations"
    - "survey of distributed decision"
    - "an exponential separation between randomized and deterministic complexity in the local model"
    - "on the complexity of local distributed graph problems"

Connected through hyperedge HE-3 (induced by source paper "improved deterministic distributed matching via rounding"):
  with members:
    - "distributed degree splitting edge coloring and orientations"
    - "an exponential separation between randomized and deterministic complexity in the local model"
    - "on the complexity of local distributed graph problems"
    - "an improved distributed algorithm for maximal independent set"
    - "toward more localized local algorithms removing assumptions concerning global knowledge"
    - "distributed maximal matching greedy is optimal"
    - "the locality of distributed symmetry breaking"
    - "local computation lower and upper bounds"

Connected through hyperedge HE-4 (induced by source paper "polynomial lower bound for distributed graph coloring in a weak local model"):
  with members:
    - "distributed delta 1 coloring in sublogarithmic rounds"
    - "an exponential separation between randomized and deterministic complexity in the local model"
    - "local conflict coloring"
    - "weak models of distributed computing with connections to modal logic"
    - "a lower bound for the distributed lov asz local lemma"
    - "no sublogarithmic time approximation scheme for bipartite vertex cover"
    - "the locality of distributed symmetry breaking"
    - "deterministic distributed vertex coloring in polylogarithmic time"

Connected through hyperedge HE-5 (induced by source paper "local conflict coloring"):
  with members:
    - "an exponential separation between randomized and deterministic complexity in the local model"
    - "toward more localized local algorithms removing assumptions concerning global knowledge"
    - "a local computation approximation scheme to maximum matching"
    - "distributed maximal matching greedy is optimal"
    - "the locality of distributed symmetry breaking"
    - "converting online algorithms to local computation algorithms"
    - "fast local computation algorithms"
    - "deterministic distributed vertex coloring in polylogarithmic time"

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.DC(Distributed, Parallel, and Cluster Computing)