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 "no sublogarithmic time approximation scheme for bipartite vertex cover"):
  Abstract: Konig's theorem states that on bipartite graphs the size of a maximum matching equals the size of a minimum vertex cover. It is known from prior work that for every $$\epsilon > 0$$ ∈ > 0 there exists a constant-time distributed algorithm that finds a $$(1+\epsilon )$$ ( 1 + ∈ ) -approximation of a maximum matching on bounded-degree graphs. In this work, we show--somewhat surprisingly--that no sublogarithmic-time approximation scheme exists for the dual problem: there is a constant $$\delta > 0$$ ? > 0 so that no randomised distributed algorithm with running time $$o(\log n)$$ o ( log n ) can find a $$(1+\delta )$$ ( 1 + ? ) -approximation of a minimum vertex cover on 2-coloured graphs of maximum degree 3. In fact, a simple application of the Linial---Saks (Combinatorica 13:441---454, 1993) decomposition demonstrates that this run-time lower bound is tight. Our lower-bound construction is simple and, to some extent, independent of previous techniques. Along the way we prove that a certain cut minimisation problem, which might be of independent interest, is hard to approximate locally on expander graphs.

Includes members:
  Member "lower bounds for local approximation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a breezing proof of the kmw bound")
  Member "local algorithms in weakly coloured graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on the expressive power of graph neural networks")
  Member "local computation lower and upper bounds":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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)