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 orientations"
  Abstract: We study graph orientations that minimize the entropy of the in-degree sequence. We prove that the minimum entropy orientation problem is NP-hard even if the graph is planar, and that there exists a simple linear-time algorithm that returns an approximate solution with an additive error guarantee of 1 bit.

Connected through hyperedge HE-1 (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"
    - "minimum entropy combinatorial optimization problems"
    - "partition reduction for lossy data compression problem"
    - "interactive submodular set cover"
    - "adaptive submodularity theory and applications in active learning and stochastic optimization"
    - "information inequalities for joint distributions with interpretations and applications"

Connected through hyperedge HE-2 (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"
    - "minimum entropy combinatorial optimization problems"
    - "set covering problems with general objective functions"

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

Connected through hyperedge HE-4 (induced by source paper "minimum entropy combinatorial optimization problems"):
  with members:
    - "an efficient algorithm for partial order production"

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)