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: "a discrete choquet integral for ordered systems"
  Abstract: A model for a Choquet integral for arbitrary finite set systems is presented. The model includes in particular the classical model on the system of all subsets of a finite set. The general model associates canonical non-negative and positively homogeneous superadditive functionals with generalized belief functions relative to an ordered system, which are then extended to arbitrary valuations on the set system. It is shown that the general Choquet integral can be computed by a simple Monge-type algorithm for so-called intersection systems, which include as a special case weakly union-closed families. Generalizing Lovasz' classical characterization, we give a characterization of the superadditivity of the Choquet integral relative to a capacity on a union-closed system in terms of an appropriate model of supermodularity of such capacities.

Connected through hyperedge HE-1 (induced by source paper "the core of games on ordered structures and graphs"):
  with members:
    - "ensuring the boundedness of the core of games with restricted cooperation"

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)