human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a strongly polynomial algorithm for linear exchange markets"):
  Abstract: We present a strongly polynomial algorithm for computing an equilibrium in Arrow-Debreu exchange markets with linear utilities. The main measure of progress is identifying a set of edges that must correspond to best bang-per-buck ratios in every equilibrium, called the revealed edge set. We use a variant of the combinatorial algorithm by Duan and Mehlhorn to identify a new revealed edge in a strongly polynomial number of iterations. Every time a new edge is found, we use a subroutine to identify an approximately best possible solution corresponding to the current revealed edge set. Finding the best solution can be reduced to solving a linear program. Even though we are unable to solve this LP in strongly polynomial time, we show that it can be approximated by a simpler LP with two variables per inequality that is solvable in strongly polynomial time.

Includes members:
  Member "a simpler and faster strongly polynomial algorithm for generalized flow maximization":
    also connected through other hyperedges:
      (none)
  Member "improved balanced flow computation using parametric flow":
    also connected through other hyperedges:
      (none)
  Member "an improved combinatorial polynomial algorithm for the linear arrow debreu market":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "proportional dynamics in exchange economies")
  Member "a strongly polynomial algorithm for generalized flow maximization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "approximating apsp without scaling equivalence of approximate min plus and exact min max")
  Member "a rational convex program for linear arrow debreu markets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "proportional dynamics in exchange economies")
  Member "a combinatorial polynomial algorithm for the linear arrow debreu market":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "proportional dynamics in exchange economies")
  Member "concave generalized flows with applications to market equilibria":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "algorithms for competitive division of chores")

Question: Please tell me which class the source paper 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)