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: "on using unsatisfiability for solving maximum satisfiability"
  Abstract: Maximum Satisfiability (MaxSAT) is a well-known optimization pro- blem, with several practical applications. The most widely known MAXS AT algorithms are ineffective at solving hard problems instances from practical application domains. Recent work proposed using efficient Boolean Satisfiability (SAT) solvers for solving the MaxSAT problem, based on identifying and eliminating unsatisfiable subformulas. However, these algorithms do not scale in practice. This paper analyzes existing MaxSAT algorithms based on unsatisfiable subformula identification. Moreover, the paper proposes a number of key optimizations to these MaxSAT algorithms and a new alternative algorithm. The proposed optimizations and the new algorithm provide significant performance improvements on MaxSAT instances from practical applications. Moreover, the efficiency of the new generation of unsatisfiability-based MaxSAT solvers becomes effectively indexed to the ability of modern SAT solvers to proving unsatisfiability and identifying unsatisfiable subformulas.

Connected through hyperedge HE-1 (induced by source paper "on tackling the limits of resolution in sat solving"):
  with members:
    - "incremental cardinality constraints for maxsat"
    - "a logical approach to efficient max sat solving"

Connected through hyperedge HE-2 (induced by source paper "fuzzy maximum satisfiability"):
  with members:
    - "solving linux upgradeability problems using boolean optimization"
    - "cause clue clauses error localization using maximum satisfiability"
    - "new inference rules for max sat"
    - "a logical approach to efficient max sat solving"

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

Connected through hyperedge HE-4 (induced by source paper "incremental cardinality constraints for maxsat"):
  with members:
    - "incremental qbf solving"
    - "solving linux upgradeability problems using boolean optimization"
    - "cause clue clauses error localization using maximum satisfiability"
    - "algorithms for weighted boolean optimization"

Connected through hyperedge HE-5 (induced by source paper "algorithms for weighted boolean optimization"):
  with members:
    - "new inference rules for max sat"
    - "a logical approach to efficient max sat solving"

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.AI(Artificial Intelligence)