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 "generalized hypergraph matching via iterated packing and local ratio"):
  Abstract: In \(k\)-hypergraph matching, we are given a collection of sets of size at most \(k\), each with an associated weight, and we seek a maximum-weight subcollection whose sets are pairwise disjoint. More generally, in \(k\)-hypergraph \(b\)-matching, instead of disjointness we require that every element appears in at most \(b\) sets of the subcollection. Our main result is a linear-programming based \((k-1+\tfrac{1}{k})\)-approximation algorithm for \(k\)-hypergraph \(b\)-matching. This settles the integrality gap when \(k\) is one more than a prime power, since it matches a previously-known lower bound. When the hypergraph is bipartite, we are able to improve the approximation ratio to \(k-1\), which is also best possible relative to the natural LP. These results are obtained using a more careful application of the iterated packing method.

Includes members:
  Member "iterative packing for demand and hypergraph matching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "integrality gaps for bounded color matchings")
  Member "on k column sparse packing programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "random order contention resolution schemes")

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)