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: "incremental cardinality constraints for maxsat"
  Abstract: Maximum Satisfiability (MaxSAT) is an optimization variant of the Boolean Satisfiability (SAT) problem. In general, MaxSAT algorithms perform a succession of SAT solver calls to reach an optimum solution making extensive use of cardinality constraints. Many of these algorithms are non-incremental in nature, i.e. at each iteration the formula is rebuilt and no knowledge is reused from one iteration to another. In this paper, we exploit the knowledge acquired across iterations using novel schemes to use cardinality constraints in an incremental fashion. We integrate these schemes with several MaxSAT algorithms. Our experimental results show a significant performance boost for these algorithms as compared to their non-incremental counterparts. These results suggest that incremental cardinality constraints could be beneficial for other constraint solving domains.

Connected through hyperedge HE-1 (induced by source paper "on symbolic approaches for computing the matrix permanent"):
  with members:
    - "addmc exact weighted model counting with algebraic decision diagrams"
    - "exponential time complexity of the permanent and the tutte polynomial"
    - "understanding model counting for beta acyclic cnf formulas"
    - "a new direction for counting perfect matchings"
    - "counting based search branching heuristics for constraint satisfaction problems"

Connected through hyperedge HE-2 (induced by source paper "approximation strategies for incomplete maxsat"):
  with members:
    - "automated synthesis of semantic malware signatures using maximum satisfiability"
    - "generalized totalizer encoding for pseudo boolean constraints"
    - "solving linux upgradeability problems using boolean optimization"
    - "cause clue clauses error localization using maximum satisfiability"

Connected through hyperedge HE-3 (induced by source paper "on tackling the limits of resolution in sat solving"):
  with members:
    - "on using unsatisfiability for solving maximum satisfiability"
    - "a logical approach to efficient max sat solving"

Connected through hyperedge HE-4 (induced by source paper "generalized totalizer encoding for pseudo boolean constraints"):
  with members:
    - "a new look at bdds for pseudo boolean constraints"
    - "solving linux upgradeability problems using boolean optimization"
    - "algorithms for weighted boolean optimization"

Connected through hyperedge HE-5 (induced by source paper "exploiting resolution based representations for maxsat solving"):
  with members:
    - "cause clue clauses error localization using maximum satisfiability"
    - "on using unsatisfiability for solving maximum satisfiability"

Connected through hyperedge HE-6 (induced by source paper "property driven fence insertion using reorder bounded model checking"):
  with members:
    - "don t sit on the fence a static analysis approach to automatic fence insertion"
    - "software verification for weak memory via program transformation"

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.LO(Logic in Computer Science)