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 "steering macro scale network community structure by micro scale features"):
  Abstract: Network science plays an increasingly important role to model complex data in many scientific disciplines. One notable feature of network organization is community structure, which refers to clusters of tightly interconnected nodes. A prominent problem is how to investigate the relationship between macro-scale modules that are retrieved by optimizing global network measures, and micro-scale structure that are defined by specific queries of the analysis (e.g., nodal features). By generalizing fundamental concepts of joint space-frequency localization to network theory, here we propose a flexible framework to study interactions between micro- and macro-structure. Similar to pointing and focusing a magnifying glass, the analysis can be directed to specific micro-scale structure, while the degree of interaction with the macro-scale community structure can be seamlessly controlled. In addition, the method is computationally efficient as a result of the underlying low-dimensional optimization problem.

Includes members:
  Member "discrete signal processing on graphs sampling theory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximating spectral clustering via sampling a review")
  Member "deep community detection":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "incremental eigenpair computation for graph laplacian matrices theory and applications")
  Member "a spectral graph uncertainty principle":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "graph signal processing part ii processing and analyzing signals on graphs")
  Member "the emerging field of signal processing on graphs extending high dimensional data analysis to networks and other irregular domains":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "approximating spectral clustering via sampling a review")

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)