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: "minimum entropy combinatorial optimization problems"
  Abstract: We survey recent results on combinatorial optimization problems in which the objective function is the entropy of a discrete distribution. These include the minimum entropy set cover, minimum entropy orientation, and minimum entropy coloring problems.

Connected through hyperedge HE-1 (induced by source paper "on the entropy of couplings"):
  with members:
    - "some properties of renyi entropy over countably infinite alphabets"
    - "entropy bounds for discrete random variables via maximal coupling"
    - "on the hardness of entropy minimization and related problems"
    - "finding the maximizers of the information divergence from an exponential family"
    - "a metric between probability distributions on finite sets of different cardinalities and applications to order reduction"

Connected through hyperedge HE-2 (induced by source paper "minimum entropy submodular optimization and fairness in cooperative games"):
  with members:
    - "a parametric worst case approach to fairness in tu cooperative games"
    - "partition reduction for lossy data compression problem"
    - "interactive submodular set cover"
    - "adaptive submodularity theory and applications in active learning and stochastic optimization"
    - "minimum entropy orientations"
    - "information inequalities for joint distributions with interpretations and applications"

Connected through hyperedge HE-3 (induced by source paper "improved approximation algorithms for low density instances of the minimum entropy set cover problem"):
  with members:
    - "minimum entropy submodular optimization and fairness in cooperative games"
    - "a parametric worst case approach to fairness in tu cooperative games"
    - "set covering problems with general objective functions"
    - "minimum entropy orientations"

Connected through hyperedge HE-4 (induced by source paper "a parametric worst case approach to fairness in tu cooperative games"):
  with members:
    - "set covering problems with general objective functions"
    - "minimum entropy orientations"

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.DS(Data Structures and Algorithms)