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 "fuel efficient computation in passive self assembly"):
  Abstract: In this paper we show that passive self-assembly in the context of the tile self-assembly model is capable of performing fuel efficient, universal computation. The tile self-assembly model is a premiere model of self-assembly in which particles are modeled by four-sided squares with glue types assigned to each tile edge. The assembly process is driven by positive and negative force interactions between glue types, allowing for tile assemblies floating in the plane to combine and break apart over time. We refer to this type of assembly model as passive in that the constituent parts remain unchanged throughout the assembly process regardless of their interactions. A computationally universal system is said to be fuel efficient if the number of tiles used up per computation step is bounded by a constant. Work within this model has shown how fuel guzzling tile systems can perform universal computation with only positive strength glue interactions. Recent work has introduced space-efficient, fuel-guzzling universal computation with the addition of negative glue interactions and the use of a powerful non-diagonal class of glue interactions. Other recent work has shown how to achieve fuel efficient computation within active tile self-assembly. In this paper we utilize negative interactions in the tile self-assembly model to achieve the first computationally universal passive tile self-assembly system that is both space and fuel-efficient. In addition, we achieve this result using a limited diagonal class of glue interactions.

Includes members:
  Member "active self assembly of algorithmic shapes and patterns in polylogarithmic time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "simulation of programmable matter systems using active tile based self assembly")
  Member "asynchronous signal passing for tile self assembly fuel efficient computation and efficient assembly of shapes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the program size complexity of self assembled paths")
  Member "two hands are better than one up to constant factors":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (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-5 (induced by source paper "the program size complexity of self assembled paths")
  Member "self assembly with geometric tiles":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the program size complexity of self assembled paths")
  Member "negative interactions in irreversible self assembly":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "geometric tiles and powers and limitations of geometric hindrance in self assembly")
  Member "program size and temperature in self assembly":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "staged self assembly and polyomino context free grammars")

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)