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 "uniformity is weaker than semi uniformity for some membrane systems"):
  Abstract: We investigate computing models that are presented as families of finite computing devices with a uniformity condition on the entire family. Examples of such models include Boolean circuits, membrane systems, DNA computers, chemical reaction networks and tile assembly systems, and there are many others. However, in such models there are actually two distinct kinds of uniformity condition. The first is the most common and well-understood, where each input length is mapped to a single computing device (e.g. a Boolean circuit) that computes on the finite set of inputs of that length. The second, called semi-uniformity, is where each input is mapped to a computing device for that input (e.g. a circuit with the input encoded as constants). The former notion is well-known and used in Boolean circuit complexity, while the latter notion is frequently found in literature on nature-inspired computation from the past 20 years or so. Are these two notions distinct? For many models it has been found that these notions are in fact the same, in the sense that the choice of uniformity or semi-uniformity leads to characterisations of the same complexity classes. In other related work, we showed that these notions are actually distinct for certain classes of Boolean circuits. Here, we give analogous results for membrane systems by showing that certain classes of uniform membrane systems are strictly weaker than the analogous semi-uniform classes. This solves a known open problem in the theory of membrane systems. We then go on to present results towards characterising the power of these semi-uniform and uniform membrane models in terms of NL and languages reducible to the unary languages in NL, respectively.

Includes members:
  Member "more tight bounds for active self assembly using an insertion primitive":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parallel computation using active self assembly")
  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 "active self assembly of algorithmic shapes and patterns in polylogarithmic time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "simulation of programmable matter systems using active tile based self assembly")
  Member "and and or or uniform polynomial size circuits":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "parallel computation using active self assembly")
  Member "on acceptance conditions for membrane systems characterisations of l and nl":
    also connected through other hyperedges:
      (none)
  Member "complexity of self assembled shapes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the program size complexity of self assembled paths")
  Member "the computational power of benenson automata":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "exploring programmable self assembly in non dna based molecular computing")

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.CC(Computational Complexity)