human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "randomized self assembly for exact shapes"
  Abstract: Working in Winfree's abstract tile assembly model, we show that a constant-size tile assembly system can be programmed through relative tile concentrations to build an n x n square with high probability, for any sufficiently large n. This answers an open question of Kao and Schweller (Randomized Self-Assembly for Approximate Shapes, ICALP 2008), who showed how to build an approximately n x n square using tile concentration programming, and asked whether the approximation could be made exact with high probability. We show how this technique can be modified to answer another question of Kao and Schweller, by showing that a constant-size tile assembly system can be programmed through tile concentrations to assemble arbitrary finite *scaled shapes*, which are shapes modified by replacing each point with a c x c block of points, for some integer c. Furthermore, we exhibit a smooth tradeoff between specifying bits of n via tile concentrations versus specifying them via hard-coded tile types, which allows tile concentration programming to be employed for specifying a fraction of the bits of "input" to a tile assembly system, under the constraint that concentrations can only be specified to a limited precision. Finally, to account for some unrealistic aspects of the tile concentration programming model, we show how to modify the construction to use only concentrations that are arbitrarily close to uniform.

Connected through hyperedge HE-1 (induced by source paper "universal simulation of directed systems in the abstract tile assembly model requires undirectedness"):
  with members:
    - "the simulation powers and limitations of higher temperature hierarchical self assembly systems"
    - "computing in continuous space with self assembling polygonal tiles"
    - "doubles and negatives are positive in self assembly"
    - "universal computation with arbitrary polyomino tiles in non cooperative self assembly"
    - "the power of duples in self assembly it s not so hip to be square"
    - "the two handed tile assembly model is not intrinsically universal"
    - "signal transmission across tile assemblies 3d static tiles simulate active self assembly by 2d signal passing tiles"
    - "intrinsic universality in tile self assembly requires cooperation"

Connected through hyperedge HE-2 (induced by source paper "concentration independent random number generation in tile self assembly"):
  with members:
    - "flipping tiles concentration independent coin flips in tile self assembly"
    - "universal computation with arbitrary polyomino tiles in non cooperative self assembly"
    - "fast arithmetic in algorithmic self assembly"
    - "self assembly with geometric tiles"
    - "negative interactions in irreversible self assembly"
    - "the power of nondeterminism in self assembly"
    - "temperature 1 self assembly deterministic assembly in 3d and probabilistic assembly in 2d"
    - "complexity of self assembled shapes"

Connected through hyperedge HE-3 (induced by source paper "size dependent tile self assembly constant height rectangles and stability"):
  with members:
    - "signal transmission across tile assemblies 3d static tiles simulate active self assembly by 2d signal passing tiles"
    - "fuel efficient computation in passive self assembly"
    - "asynchronous signal passing for tile self assembly fuel efficient computation and efficient assembly of shapes"
    - "negative interactions in irreversible self assembly"
    - "self assembly of arbitrary shapes using rnase enzymes meeting the kolmogorov bound with small scale factor extended abstract"
    - "reducing tile complexity for the self assembly of scaled shapes through temperature programming"
    - "staged self assembly nanomanufacture of arbitrary shapes with o 1 glues"
    - "reducing tile complexity for self assembly through temperature programming"

Connected through hyperedge HE-4 (induced by source paper "flipping tiles concentration independent coin flips in tile self assembly"):
  with members:
    - "universal computation with arbitrary polyomino tiles in non cooperative self assembly"
    - "fast arithmetic in algorithmic self assembly"
    - "self assembly with geometric tiles"
    - "negative interactions in irreversible self assembly"
    - "the power of nondeterminism in self assembly"
    - "temperature 1 self assembly deterministic assembly in 3d and probabilistic assembly in 2d"
    - "complexity of self assembled shapes"

Connected through hyperedge HE-5 (induced by source paper "parallel computation using active self assembly"):
  with members:
    - "more tight bounds for active self assembly using an insertion primitive"
    - "the two handed tile assembly model is not intrinsically universal"
    - "signal transmission across tile assemblies 3d static tiles simulate active self assembly by 2d signal passing tiles"
    - "on the equivalence of cellular automata and the tile assembly model"
    - "active self assembly of algorithmic shapes and patterns in polylogarithmic time"
    - "intrinsic universality in tile self assembly requires cooperation"
    - "intrinsic universality and the computational power of self assembly"
    - "and and or or uniform polynomial size circuits"

Connected through hyperedge HE-6 (induced by source paper "staged self assembly and polyomino context free grammars"):
  with members:
    - "the two handed tile assembly model is not intrinsically universal"
    - "combinatorial optimization in pattern assembly"
    - "intrinsic universality and the computational power of self assembly"
    - "approximation of grammar based compression via recompression"
    - "fuel efficient computation in passive self assembly"
    - "one tile to rule them all simulating any turing machine tile assembly system or tiling system with a single puzzle piece"
    - "inapproximability of the smallest superpolyomino problem"
    - "parallelism and time in hierarchical self assembly"

Connected through hyperedge HE-7 (induced by source paper "fast arithmetic in algorithmic self assembly"):
  with members:
    - "the two handed tile assembly model is not intrinsically universal"
    - "intrinsic universality in tile self assembly requires cooperation"
    - "fuel efficient computation in passive self assembly"
    - "the tile assembly model is intrinsically universal"
    - "self assembly with geometric tiles"
    - "the power of nondeterminism in self assembly"
    - "strong fault tolerance for self assembly with fuzzy temperature"
    - "temperature 1 self assembly deterministic assembly in 3d and probabilistic assembly in 2d"

Connected through hyperedge HE-8 (induced by source paper "active self assembly of algorithmic shapes and patterns in polylogarithmic time"):
  with members:
    - "optimizing tile concentrations to minimize errors and time for dna tile self assembly systems"
    - "one tile to rule them all simulating any turing machine tile assembly system or tiling system with a single puzzle piece"
    - "two hands are better than one up to constant factors"
    - "the tile assembly model is intrinsically universal"
    - "negative interactions in irreversible self assembly"
    - "self assembly of arbitrary shapes using rnase enzymes meeting the kolmogorov bound with small scale factor extended abstract"
    - "staged self assembly nanomanufacture of arbitrary shapes with o 1 glues"

Question: Please tell me which class the center node 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.CC(Computational Complexity)