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: "efficient algorithms for dualizing large scale hypergraphs"
  Abstract: A hypergraph ${\cal F}$ is a set family defined on vertex set $V$. The dual of ${\cal F}$ is the set of minimal subsets $H$ of $V$ such that $F\cap H \ne \emptyset$ for any $F\in {\cal F}$. The computation of the dual is equivalent to many problems, such as minimal hitting set enumeration of a subset family, minimal set cover enumeration, and the enumeration of hypergraph transversals. Although many algorithms have been proposed for solving the problem, to the best of our knowledge, none of them can work on large-scale input with a large number of output minimal hitting sets. This paper focuses on developing time- and space-efficient algorithms for solving the problem. We propose two new algorithms with new search methods, new pruning methods, and fast techniques for the minimality check. The computational experiments show that our algorithms are quite fast even for large-scale input for which existing algorithms do not terminate in a practical time.

Connected through hyperedge HE-1 (induced by source paper "multi hop byzantine reliable broadcast with honest dealer made practical"):
  with members:
    - "multi hop byzantine reliable broadcast made practical"
    - "the minimal hitting set generation problem algorithms and computation"
    - "discovering network topology in the presence of byzantine faults"

Connected through hyperedge HE-2 (induced by source paper "multi hop byzantine reliable broadcast made practical"):
  with members:
    - "the minimal hitting set generation problem algorithms and computation"
    - "discovering network topology in the presence of byzantine faults"

Connected through hyperedge HE-3 (induced by source paper "logical classification of partially ordered data"):
  with members:
    - "dualization in lattices given by ordered sets of irreducibles"

Connected through hyperedge HE-4 (induced by source paper "efficiently enumerating hitting sets of hypergraphs arising in data profiling"):
  with members:
    - "the minimal hitting set generation problem algorithms and computation"
    - "exploiting hidden structure in selecting dimensions that distinguish vectors"
    - "randomised enumeration of small witnesses using a decision oracle"
    - "efficient enumeration of solutions produced by closure operations"
    - "a polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs"
    - "paradigms for parameterized enumeration"
    - "new results on monotone dualization and generating hypergraph transversals"
    - "incremental recompilation of knowledge"

Connected through hyperedge HE-5 (induced by source paper "enumerating models of dnf faster breaking the dependency on the formula size"):
  with members:
    - "a circuit based approach to efficient enumeration"
    - "output polynomial enumeration on graphs of bounded local linear mim width"
    - "efficient generation of stable planar cages for chemistry"
    - "efficient enumeration of solutions produced by closure operations"

Connected through hyperedge HE-6 (induced by source paper "direct and binary direct bases for one set updates of a closure system"):
  with members:
    - "discovery of the d basis in binary tables based on hypergraph dualization"
    - "the joy of implications aka pure horn functions mainly a survey"

Connected through hyperedge HE-7 (induced by source paper "implementing efficient all solutions sat solvers"):
  with members:
    - "the minimal hitting set generation problem algorithms and computation"
    - "applying formal methods to networking theory techniques and applications"
    - "the language of search"
    - "conflict directed backjumping revisited"

Connected through hyperedge HE-8 (induced by source paper "parallelizing asymptotically optimal algorithms for large scale dualization problems"):
  with members:
    - "new results on monotone dualization and generating hypergraph transversals"

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)