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: "practical access to dynamic programming on tree decompositions"
  Abstract: Parameterized complexity theory has lead to a wide range of algorithmic breakthroughs within the last decades, but the practicability of these methods for real-world problems is still not well understood. We investigate the practicability of one of the fundamental approaches of this field: dynamic programming on tree decompositions. Indisputably, this is a key technique in parameterized algorithms and modern algorithm design. Despite the enormous impact of this approach in theory, it still has very little influence on practical implementations. The reasons for this phenomenon are manifold. One of them is the simple fact that such an implementation requires a long chain of non-trivial tasks (as computing the decomposition, preparing it,...). We provide an easy way to implement such dynamic programs that only requires the definition of the update rules. With this interface, dynamic programs for various problems, such as 3-coloring, can be implemented easily in about 100 lines of structured Java code. #R##N#The theoretical foundation of the success of dynamic programming on tree decompositions is well understood due to Courcelle's celebrated theorem, which states that every MSO-definable problem can be efficiently solved if a tree decomposition of small width is given. We seek to provide practical access to this theorem as well, by presenting a lightweight model-checker for a small fragment of MSO. This fragment is powerful enough to describe many natural problems, and our model-checker turns out to be very competitive against similar state-of-the-art tools.

Connected through hyperedge HE-1 (induced by source paper "finding all global minimum cuts in practice"):
  with members:
    - "engineering kernelization for maximum cut"
    - "shared memory branch and reduce for multiterminal cuts"
    - "faster algorithms for edge connectivity via random 2 out contractions"
    - "wegotyoucovered the winning solver from the pace 2019 implementation challenge vertex cover track"
    - "exactly solving the maximum weight independent set problem on large real world graphs"
    - "experimental evaluation of parameterized algorithms for feedback vertex set"
    - "practical minimum cut algorithms"
    - "shared memory exact minimum cuts"

Connected through hyperedge HE-2 (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"
    - "implementing efficient all solutions sat solvers"
    - "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-3 (induced by source paper "positive instance driven dynamic programming for graph searching"):
  with members:
    - "a parameterized strongly polynomial algorithm for block structured integer programs"
    - "faster algorithms for integer programs with block structure"
    - "the complexity landscape of decompositional parameters for ilp"
    - "small resolution proofs for qbf using dependency treewidth"
    - "positive instance driven dynamic programming for treewidth"
    - "a differential approach to inference in bayesian networks"
    - "courcelle s theorem a game theoretic approach"

Connected through hyperedge HE-4 (induced by source paper "parameterized leaf power recognition via embedding into graph products"):
  with members:
    - "polynomial time recognition of 4 steiner powers"
    - "listing all maximal cliques in sparse graphs in near optimal time"
    - "computing crossing numbers in quadratic time"

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)