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 "walking on the edge and cosystolic expansion"):
  Abstract: Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional simplicial complexes, which are the high dimensional analogues of graphs, calls for the natural generalization of random walks to higher dimensions. In particular, a high order random walk on a $2$-dimensional simplicial complex moves at random between neighboring edges of the complex, where two edges are considered neighbors if they share a common triangle. We show that if a regular $2$-dimensional simplicial complex is a cosystolic expander and the underlying graph of the complex has a spectral gap larger than $1/2$, then the random walk on the edges of the complex converges rapidly to the uniform distribution on the edges.

Includes members:
  Member "high dimensional random walks and colorful expansion":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spectral independence in high dimensional expanders and applications to the hardcore model")
  Member "high dimensional expanders and property testing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improved analysis of higher order random walks and applications")

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)