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: "base collapse of holographic algorithms"
  Abstract: A holographic algorithm solves a problem in domain of size $n$, by reducing it to counting perfect matchings in planar graphs. It may simulate a $n$-value variable by a bunch of $t$ matchgate bits, which has $2^t$ values. The transformation in the simulation can be expressed as a $n \times 2^t$ matrix $M$, called the base of the holographic algorithm. We wonder whether more matchgate bits bring us more powerful holographic algorithms. In another word, whether we can solve the same original problem, with a collapsed base of size $n \times 2^{r}$, where $r<t$. #R##N#Base collapse was discovered for small domain $n=2,3,4$. For $n=3, 4$, the base collapse was proved under the condition that there is a full rank generator. We prove for any $n$, the base collapse to a $r\leq \lfloor \log n \rfloor$, with some similar conditions. One of them is that the original problem is defined by one symmetric function. In the proof, we utilize elementary matchgate transformations instead of matchgate identities.

Connected through hyperedge HE-1 (induced by source paper "clifford gates in the holant framework"):
  with members:
    - "dichotomy for real holant c problems"
    - "the complexity of holant problems over boolean domain with non negative weights"
    - "basis collapse for holographic algorithms over all domain sizes"
    - "a holant dichotomy is the fkt algorithm universal"
    - "holographic algorithms beyond matchgates"
    - "a complete dichotomy rises from the capture of vanishing signatures"

Connected through hyperedge HE-2 (induced by source paper "on blockwise symmetric matchgate signatures and higher domain csp"):
  with members:
    - "holographic algorithm with matchgates is universal for planar csp over boolean domain"
    - "basis collapse for holographic algorithms over all domain sizes"
    - "the complexity of planar boolean csp with complex weights"

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)