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 "more tight bounds for active self assembly using an insertion primitive"):
  Abstract: We prove several limits on the behavior of a model of self-assembling particles introduced by Dabby and Chen (SODA 2013), called insertion systems, where monomers insert themselves into the middle of a growing linear polymer. First, we prove that the expressive power of these systems is equal to context-free grammars, answering a question posed by Dabby and Chen. #R##N#Second, we give tight bounds on the maximum length and minimum expected time of constructed polymers in systems of three increasingly restricted classes. We prove that systems of $k$ monomer types can deterministically construct polymers of length $n = 2^{\Theta(k^{3/2})}$ in $O(\log^{5/3}(n))$ expected time. We also prove that if non-deterministic construction of a finite number of polymers is permitted, then the expected construction time can be reduced to $O(\log^{3/2}(n))$ at the trade-off of decreasing the length to $2^{\Theta(k)}$. If the system is allowed to construct an infinite number of polymers, then constructing polymers of unbounded length in $O(\log{n})$ expected time is possible. We follow these positive results with a set of lower bounds proving that these are the best possible polymer lengths and expected construction times.

Includes members:
  Member "parallel computation using active self assembly":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the runtime of universal coating for programmable matter")
  Member "fast algorithmic self assembly of simple shapes using random agitation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improved leader election for self organizing programmable matter")
  Member "signal transmission across tile assemblies 3d static tiles simulate active self assembly by 2d signal passing tiles":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "simulation of programmable matter systems using active tile based self assembly")
  Member "active self assembly of algorithmic shapes and patterns in polylogarithmic time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "simulation of programmable matter systems using active tile based self assembly")
  Member "fast arithmetic in algorithmic self assembly":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "covert computation in self assembled circuits")
  Member "asynchronous signal passing for tile self assembly fuel efficient computation and efficient assembly of shapes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the program size complexity of self assembled paths")
  Member "parallelism and time in hierarchical self assembly":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hierarchical growth is necessary and sometimes sufficient to self assemble discrete self similar fractals")
  Member "the tile assembly model is intrinsically universal":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the program size complexity of self assembled paths")

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)