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: "deterministic parallel algorithms for bilinear objective functions"
  Abstract: Many randomized algorithms can be derandomized efficiently using either the method of conditional expectations or probability spaces with low independence. A series of papers, beginning with work by Luby (1988), showed that in many cases these techniques can be combined to give deterministic parallel (NC) algorithms for a variety of combinatorial optimization problems, with low time- and processor-complexity. #R##N#We extend and generalize a technique of Luby for efficiently handling bilinear objective functions. One noteworthy application is an NC algorithm for maximal independent set (MIS) with $\tilde O(\log^2 n)$ time and $(m + n) n^{o(1)}$ processors; this is nearly the same as the best randomized parallel algorithms. Previous NC algorithms required either $\log^{2.5} n$ time or $mn$ processors. Other applications of our technique include algorithms of Berger (1997) for maximum acyclic subgraph and Gale-Berlekamp switching games. #R##N#This bilinear factorization also gives better algorithms for problems involving discrepancy. An important application of this is to automata-fooling probability spaces, which are the basis of a notable derandomization technique of Sivakumar (2002). Previous algorithms have had very high processor complexity. We are able to greatly reduce this, with applications to set balancing and the Johnson-Lindenstrauss Lemma.

Connected through hyperedge HE-1 (induced by source paper "graph sparsification for derandomizing massively parallel computation with low space"):
  with members:
    - "walking randomly massively and efficiently"
    - "parallel approximate undirected shortest paths via low hop emulators"
    - "deterministic distributed dominating set approximation in the congest model"
    - "efficient deterministic distributed coloring with small bandwidth"
    - "exponentially faster massively parallel maximal matching"
    - "congested clique algorithms for graph spanners"
    - "massively parallel algorithms for finding well connected components in sparse graphs"
    - "sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation"

Connected through hyperedge HE-2 (induced by source paper "deterministic algorithms for the lovasz local lemma simpler more general and more parallel"):
  with members:
    - "algorithms for weighted independent transversals and strong colouring"
    - "sublogarithmic distributed algorithms for lov asz local lemma and the complexity hierarchy"
    - "lopsidependency in the moser tardos framework beyond the lopsided lovasz local lemma"
    - "deterministic parallel algorithms for fooling polylogarithmic juntas and the lovasz local lemma"
    - "algorithmic and enumerative aspects of the moser tardos distribution"
    - "parallel algorithms and concentration bounds for the lovasz local lemma via witness dags"
    - "new constructive aspects of the lovasz local lemma"
    - "deterministic algorithms for the lovasz local lemma"

Connected through hyperedge HE-3 (induced by source paper "derandomizing the lovasz local lemma via log space statistical tests"):
  with members:
    - "sublogarithmic distributed algorithms for lov asz local lemma and the complexity hierarchy"
    - "deterministic parallel algorithms for fooling polylogarithmic juntas and the lovasz local lemma"
    - "parallel algorithms and concentration bounds for the lovasz local lemma via witness dags"

Connected through hyperedge HE-4 (induced by source paper "deterministic parallel algorithms for fooling polylogarithmic juntas and the lovasz local lemma"):
  with members:
    - "sublogarithmic distributed algorithms for lov asz local lemma and the complexity hierarchy"
    - "parallel algorithms and concentration bounds for the lovasz local lemma via witness dags"
    - "deterministic algorithms for the lovasz local lemma"
    - "a constructive proof of the general lovasz local lemma"

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.DS(Data Structures and Algorithms)