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: "integrating tabu search and vlsn search to develop enhanced algorithms a case study using bipartite boolean quadratic programs"
  Abstract: The bipartite boolean quadratic programming problem (BBQP) is a generalization of the well studied boolean quadratic programming problem. The model has a variety of real life applications; however, empirical studies of the model are not available in the literature, except in a few isolated instances. In this paper, we develop efficient heuristic algorithms based on tabu search, very large scale neighborhood (VLSN) search, and a hybrid algorithm that integrates the two. The computational study establishes that effective integration of simple tabu search with VLSN search results in superior outcomes, and suggests the value of such an integration in other settings. Complexity analysis and implementation details are provided along with conclusions drawn from experimental analysis. In addition, we obtain solutions better than the best previously known for almost all medium and large size benchmark instances.

Connected through hyperedge HE-1 (induced by source paper "a tutorial on formulating and using qubo models"):
  with members:
    - "detecting multiple communities using quantum annealing on the d wave system"
    - "computing wasserstein distance for persistence diagrams on a quantum computer"
    - "nonnegative binary matrix factorization with a d wave quantum annealer"
    - "logical and inequality implications for reducing the size and complexity of quadratic unconstrained binary optimization problems"

Connected through hyperedge HE-2 (induced by source paper "bilinear assignment problem large neighborhoods and experimental analysis of algorithms"):
  with members:
    - "heuristic algorithms for the bipartite unconstrained 0 1 quadratic programming problem"

Connected through hyperedge HE-3 (induced by source paper "markov chain methods for the bipartite boolean quadratic programming problem"):
  with members:
    - "heuristic algorithms for the bipartite unconstrained 0 1 quadratic programming problem"
    - "inapproximability of maximum weighted edge biclique and its applications"

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)