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 "linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence"):
  Abstract: Abstract   The  maximal sum  of a sequence  A  of  n  real numbers is the greatest sum of all elements of any linearly contiguous and possibly empty subsequence of  A . It can be computed in    O  (  n  )    time by means of Kadane's algorithm. Letting      A    (  x  →  p  )      denote the sequence which results from inserting a real number  x  just after element    A  [  p  −  1  ]   , we show how the maximal sum of      A    (  x  →  p  )      can be computed in    O  (  1  )     worst-case  time for any given  x  and  p , provided that an    O  (  n  )    time preprocessing step has already been executed on  A . In particular, this implies that, given  m  pairs    (    x    0    ,    p    0    )  ,  …  ,  (    x    m  −  1    ,    p    m  −  1    )   , we can compute the maximal sums of sequences      A    (    x    0    →    p    0    )    ,  …  ,    A    (    x    m  −  1    →    p    m  −  1    )      optimally in    O  (  n  +  m  )    time, improving on the straightforward and suboptimal strategy of applying Kadane's algorithm to each sequence      A    (    x    i    →    p    i    )     , which takes a total of    Θ  (  n  m  )    time. We also show that the same time bound is attainable when circular subsequences of      A    (  x  →  p  )      are taken into account. Our algorithms are easy to implement in practice, and they were motivated by a buffer minimization problem on wireless mesh networks.

Includes members:
  Member "insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence":
    also connected through other hyperedges:
      (none)
  Member "scheduling links for heavy traffic on interfering routes in wireless mesh networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "scheduling wireless links in the physical interference model by fractional edge coloring")

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)