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: "mixed integer quadratic programming is in np"
  Abstract: Mixed-integer quadratic programming is the problem of optimizing a quadratic function over points in a polyhedral set where some of the components are restricted to be integral. In this paper, we prove that the decision version of mixed-integer quadratic programming is in NP, thereby showing that it is NP-complete. This is established by showing that if the decision version of mixed-integer quadratic programming is feasible, then there exists a solution of polynomial size. This result generalizes and unifies classical results that quadratic programming is in NP and integer linear programming is in NP.

Connected through hyperedge HE-1 (induced by source paper "deep hypernetwork based mimo detection"):
  with members:
    - "few shot adversarial learning of realistic neural talking head models"
    - "the roadmap to 6g ai empowered wireless networks"
    - "a model driven deep learning network for mimo detection"
    - "learning feed forward one shot learners"
    - "optimality of large mimo detection via approximate message passing"
    - "adam a method for stochastic optimization"

Connected through hyperedge HE-2 (induced by source paper "simple strategies in multi objective mdps technical report"):
  with members:
    - "multi weighted markov decision processes with reachability objectives"
    - "markov automata with multiple objectives"
    - "threshold constraints with guarantees for parity objectives in markov decision processes"
    - "a storm is coming a modern probabilistic model checker"
    - "multi objective approaches to markov decision processes with uncertain transition parameters"
    - "variations on the stochastic shortest path problem"
    - "percentile queries in multi dimensional markov decision processes"
    - "a survey of multi objective sequential decision making"

Connected through hyperedge HE-3 (induced by source paper "on the decidability of termination for polynomial loops"):
  with members:
    - "termination of triangular integer loops is decidable"
    - "proving non termination via loop acceleration"
    - "termination of linear loops over the integers"
    - "on multiphase linear ranking functions"
    - "geometric nontermination arguments"
    - "ranking templates for linear loops"
    - "on termination of integer linear loops"
    - "deciding conditional termination"

Connected through hyperedge HE-4 (induced by source paper "long run average behavior of vector addition systems with states"):
  with members:
    - "the reachability problem for petri nets is not elementary"
    - "nested weighted limit average automata of bounded width"
    - "average energy games"
    - "long run average behaviour of probabilistic vector addition systems"
    - "reachability games on extended vector addition systems with states"

Connected through hyperedge HE-5 (induced by source paper "computing optimal discrete readout weights in reservoir computing is np hard"):
  with members:
    - "a scalable multicore architecture with heterogeneous memory structures for dynamic neuromorphic asynchronous processors dynaps"
    - "computing with networks of nonlinear mechanical oscillators"
    - "computability and complexity of unconventional computing devices"
    - "dna reservoir computing a novel molecular computing approach"

Connected through hyperedge HE-6 (induced by source paper "adaptive task allocation for mobile edge learning"):
  with members:
    - "price based distributed offloading for mobile edge computing with computation capacity constraints"
    - "a survey on mobile edge computing the communication perspective"
    - "distributed deep neural networks over the cloud the edge and end devices"
    - "joint computation and communication cooperation for mobile edge computing"
    - "staleness aware async sgd for distributed deep learning"

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.DM(Discrete Mathematics)