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 "size separable tile self assembly a tight bound for temperature 1 mismatch free systems"):
  Abstract: We introduce a new property of tile self-assembly systems that we call size-separability. A system is size-separable if every terminal assembly is a constant factor larger than any intermediate assembly. Size-separability is motivated by the practical problem of filtering completed assemblies from a variety of incomplete "garbage" assemblies using gel electrophoresis or other mass-based filtering techniques. #R##N#Here we prove that any system without cooperative bonding assembling a unique mismatch-free terminal assembly can be used to construct a size-separable system uniquely assembling the same shape. The proof achieves optimal scale factor and temperature for the size-separable system. As part of the proof, we obtain two results of independent interest on mismatch-free temperature-1 two-handed systems.

Includes members:
  Member "staged self assembly and polyomino context free grammars":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "verification in staged tile self assembly")
  Member "producibility in hierarchical self assembly":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "verification in staged tile self assembly")
  Member "intrinsic universality in tile self assembly requires cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the program size complexity of self assembled paths")
  Member "the self assembly of paths and squares at temperature 1":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a pumping lemma for non cooperative 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-5 (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-6 (induced by source paper "hierarchical growth is necessary and sometimes sufficient to self assemble discrete self similar fractals")
  Member "strong fault tolerance for self assembly with fuzzy temperature":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the program size complexity of self assembled paths")
  Member "limitations of self assembly at temperature 1":
    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.CG(Computational Geometry)