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 "fast modular subset sum using linear sketching"):
  Abstract: Given n positive integers, the Modular Subset Sum problem asks if a subset adds up to a given target t modulo a given integer m. This is a natural generalization of the Subset Sum problem (where m=+\infty) with ties to additive combinatorics and cryptography. #R##N#Recently, in [Bringmann, SODA'17] and [Koiliaris and Xu, SODA'17], efficient algorithms have been developed for the non-modular case, running in near-linear pseudo-polynomial time. For the modular case, however, the best known algorithm by Koiliaris and Xu [Koiliaris and Xu, SODA'17] runs in time O~(m^{5/4}). #R##N#In this paper, we present an algorithm running in time O~(m), which matches a recent conditional lower bound of [Abboud et al.'17] based on the Strong Exponential Time Hypothesis. Interestingly, in contrast to most previous results on Subset Sum, our algorithm does not use the Fast Fourier Transform. Instead, it is able to simulate the "textbook" Dynamic Programming algorithm much faster, using ideas from linear sketching. This is one of the first applications of sketching-based techniques to obtain fast algorithms for combinatorial problems in an offline setting.

Includes members:
  Member "capacitated dynamic programming faster knapsack and graph algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximating subset sum is equivalent to min plus convolution")
  Member "near optimal linear decision trees for k sum and related problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "all non trivial variants of 3 ldt are equivalent")
  Member "seth based lower bounds for subset sum and bicriteria path":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "scheduling lower bounds via and subset sum")
  Member "proximity results and faster algorithms for integer programming using the steinitz lemma":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "n fold integer programming via lp rounding")
  Member "the decision tree complexity for k sum is at most nearly quadratic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "near optimal linear decision trees for k sum and related problems")
  Member "a near linear pseudopolynomial time algorithm for subset sum":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "scheduling lower bounds via and subset sum")
  Member "strong eth breaks with merlin and arthur short non interactive proofs of batch evaluation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "new algorithms and lower bounds for all pairs max flow in undirected graphs")
  Member "losing weight by gaining edges":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a simple gap producing reduction for the parameterized set cover problem")

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)