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 "geometric properties of satisfying assignments of random epsilon 1 in k sat"):
  Abstract: We study the geometric structure of the set of solutions of random $\epsilon$-1-in-k SAT problem. For $l\geq 1$, two satisfying assignments $A$ and $B$ are $l$-connected if there exists a sequence of satisfying assignments connecting them by changing at most $l$ bits at a time. #R##N#We first prove that w.h.p. two assignments of a random $\epsilon$-1-in-$k$ SAT instance are $O(\log n)$-connected, conditional on being satisfying assignments. Also, there exists $\epsilon_{0}\in (0,\frac{1}{k-2})$ such that w.h.p. no two satisfying assignments at distance at least $\epsilon_{0}\cdot n$ form a "hole" in the set of assignments. We believe that this is true for all $\epsilon >0$, and thus satisfying assignments of a random 1-in-$k$ SAT instance form a single cluster.

Includes members:
  Member "on the solution space geometry of random constraint satisfaction problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quantitative verification of neural networks and its security applications")
  Member "spines of random constraint satisfaction problems definition and connection with computational complexity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interactive particle systems on hypergraphs drift analysis and the walksat algorithm")

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)