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

Connected through hyperedge HE-1 (induced by source paper "exploiting database management systems and treewidth for counting"):
  with members:
    - "exploiting treewidth for projected model counting and its limits"
    - "experimental evaluation of parameterized algorithms for feedback vertex set"
    - "practical access to dynamic programming on tree decompositions"
    - "distribution aware sampling and weighted model counting for sat"
    - "uniform solution sampling using a constraint solver as an oracle"
    - "probabilistic planning via heuristic forward search and weighted model counting"

Connected through hyperedge HE-2 (induced by source paper "fast counting with tensor networks"):
  with members:
    - "solving and sampling with many solutions satisfiability and other hard problems"
    - "tensor networks for dimensionality reduction and large scale optimization part 2 applications and future perspectives"
    - "tensor networks for dimensionality reduction and large scale optimization part 1 low rank tensor decompositions"
    - "approximation algorithms for polynomial expansion and low density graphs"
    - "aslib a benchmark library for algorithm selection"
    - "recent advances in graph partitioning"
    - "satzilla portfolio based algorithm selection for sat"
    - "a knowledge compilation map"

Connected through hyperedge HE-3 (induced by source paper "allsat compressed with wildcards from cnf s to orthogonal dnf s by imposing the clauses one by one"):
  with members:
    - "computing the output distribution and selection probabilities of a stack filter from the dnf of its positive boolean function"
    - "counting or producing all fixed cardinality transversals"
    - "compactly generating all satisfying truth assignments of a horn formula"

Connected through hyperedge HE-4 (induced by source paper "supervisor obfuscation against actuator enablement attack"):
  with members:
    - "synthesis of successful actuator attackers on supervisors"
    - "supervisory control of discrete event systems under attacks"
    - "a formal approach to cyber physical attacks"
    - "supervisor synthesis to thwart cyber attack with bounded sensor reading alterations"

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)