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 "implementing efficient all solutions sat solvers"):
  Abstract: All solutions SAT (AllSAT for short) is a variant of the propositional satisfiability problem. AllSAT has been relatively unexplored compared to other variants despite its significance. We thus survey and discuss major techniques of AllSAT solvers. We accurately implemented them and conducted comprehensive experiments using a large number of instances and various types of solvers including a few publicly available software. The experiments revealed the solvers’ characteristics. We made our implemented solvers publicly available so that other researchers can easily develop their solvers by modifying our code and comparing it with existing methods.

Includes members:
  Member "the minimal hitting set generation problem algorithms and computation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "query oriented text summarization based on hypergraph transversals")
  Member "applying formal methods to networking theory techniques and applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a comprehensive survey of interface protocols for software defined networks")
  Member "efficient algorithms for dualizing large scale hypergraphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi hop byzantine reliable broadcast with honest dealer made practical")
  Member "the language of search":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the reasons behind decisions")
  Member "conflict directed backjumping revisited":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "variable and value elimination in binary constraint satisfaction via forbidden patterns")

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)