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 "an algorithmic proof of the lopsided lovasz local lemma"):
  Abstract: For any probability space and a collection of events with what we call a lopsided association graph, we give an algorithmic proof of the Lopsided Lovasz Local Lemma, and its stronger known forms. The only algorithmic assumption is the availability of a resampling oracle for each event. The resampling oracles act as an abstraction layer that isolates the details of the proof from the details of the probability space. The number of resamplings performed by the algorithm is bounded by expressions similar to those obtained by Moser and Tardos, and others. The overall computational efficiency depends on the runtime of the resampling oracles. We develop efficient resampling oracles for the known uses of the Lopsided Lovasz Local Lemma, unifying previous algorithmic applications and presenting new results for packings of Latin transversals, rainbow matchings and rainbow spanning trees.

Includes members:
  Member "a constructive proof of the general lovasz local lemma":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "scattering and sparse partitions and their applications")
  Member "a constructive proof of the lovasz local lemma":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computational concentration of measure optimal bounds reductions and more")

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