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 constant factor approximation algorithm for unsplittable flow on paths"
  Abstract: In the unsplittable flow problem on a path, we are given a capacitated path $P$ and $n$ tasks, each task having a demand, a profit, and start and end vertices. The goal is to compute a maximum profit set of tasks, such that for each edge $e$ of $P$, the total demand of selected tasks that use $e$ does not exceed the capacity of $e$. This is a well-studied problem that has been studied under alternative names, such as resource allocation, bandwidth allocation, resource constrained scheduling, temporal knapsack and interval packing. #R##N#We present a polynomial time constant-factor approximation algorithm for this problem. This improves on the previous best known approximation ratio of $O(\log n)$. The approximation ratio of our algorithm is $7+\epsilon$ for any $\epsilon>0$. #R##N#We introduce several novel algorithmic techniques, which might be of independent interest: a framework which reduces the problem to instances with a bounded range of capacities, and a new geometrically inspired dynamic program which solves a special case of the maximum weight independent set of rectangles problem to optimality. In the setting of resource augmentation, wherein the capacities can be slightly violated, we give a $(2+\epsilon)$-approximation algorithm. In addition, we show that the problem is strongly NP-hard even if all edge capacities are equal and all demands are either~1,~2, or~3.

Connected through hyperedge HE-1 (induced by source paper "breaking the barrier of 2 for the storage allocation problem"):
  with members:
    - "approximating geometric knapsack via l packings"

Connected through hyperedge HE-2 (induced by source paper "approximation schemes for independent set and sparse subsets of polygons"):
  with members:
    - "on approximating maximum independent set of rectangles"
    - "optimal parameterized algorithms for planar facility location problems using voronoi diagrams"
    - "shortest path in a polygon using sublinear space"
    - "approximation schemes for partitioning convex decomposition and surface approximation"
    - "a qptas for the base of the number of triangulations of a planar point set"
    - "quasi polynomial time approximation scheme for sparse subsets of polygons"
    - "a qptas for maximum weight independent set of polygons with polylogarithmically many vertices"
    - "approximation schemes for maximum weight independent set of rectangles"

Connected through hyperedge HE-3 (induced by source paper "general caching is hard even with small pages"):
  with members:
    - "on line file caching"
    - "competitive paging algorithms"

Connected through hyperedge HE-4 (induced by source paper "the inapproximability of maximum single sink unsplittable priority and confluent flow problems"):
  with members:
    - "a polylogarithimic approximation algorithm for edge disjoint paths with congestion 2"
    - "routing in undirected graphs with constant congestion"

Connected through hyperedge HE-5 (induced by source paper "how unsplittable flow covering helps scheduling with job dependent cost functions"):
  with members:
    - "a primal dual approximation algorithm for min sum single machine scheduling problems"
    - "a 4 approximation for scheduling on a single machine with general cost function"
    - "dual techniques for scheduling on a machine with varying speed"
    - "the geometry of scheduling"

Connected through hyperedge HE-6 (induced by source paper "approximation algorithms for covering and packing problems on paths"):
  with members:
    - "scheduling resources for executing a partial set of jobs"

Connected through hyperedge HE-7 (induced by source paper "a qptas for maximum weight independent set of polygons with polylogarithmically many vertices"):
  with members:
    - "approximation schemes for maximum weight independent set of rectangles"
    - "approximation algorithms for maximum independent set of pseudo disks"

Connected through hyperedge HE-8 (induced by source paper "approximation schemes for maximum weight independent set of rectangles"):
  with members:
    - "approximation algorithms for maximum independent set of pseudo disks"

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)