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 "parallel maximum clique algorithms with applications to network analysis and storage"):
  Abstract: We propose a fast, parallel maximum clique algorithm for large sparse graphs that is designed to exploit characteristics of social and information networks. The method exhibits a roughly linear runtime scaling over real-world networks ranging from 1000 to 100 million nodes. In a test on a social network with 1.8 billion edges, the algorithm finds the largest clique in about 20 minutes. Our method employs a branch and bound strategy with novel and aggressive pruning techniques. For instance, we use the core number of a vertex in combination with a good heuristic clique finder to efficiently remove the vast majority of the search space. In addition, we parallelize the exploration of the search tree. During the search, processes immediately communicate changes to upper and lower bounds on the size of maximum clique, which occasionally results in a super-linear speedup because vertices with large search spaces can be pruned by other processes. We apply the algorithm to two problems: to compute temporal strong components and to compress graphs.

Includes members:
  Member "fast algorithms for the maximum clique problem on massive sparse graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed attack robust submodular maximization for multi robot planning")
  Member "social structure of facebook networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "compressive sensing for cut improvement and local clustering")
  Member "exact algorithms for maximum clique a computational study":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "replicable parallel branch and bound search")
  Member "exact algorithms for maximum clique a computational study":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "replicable parallel branch and bound search")
  Member "listing all maximal cliques in large sparse real world graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "shared memory parallel maximal clique enumeration from static and dynamic graphs")
  Member "listing all maximal cliques in sparse graphs in near optimal time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "teaser fast and certifiable point cloud registration")
  Member "layered label propagation a multiresolution coordinate free ordering for compressing social networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "2ps high quality edge partitioning with two phase streaming")
  Member "community structure in large networks natural cluster sizes and the absence of large well defined clusters":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "certified robustness of community detection against adversarial structural perturbation via randomized smoothing")

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.SI(Social and Information Networks)