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: "spectral properties of the google matrix of the world wide web and other directed networks"
  Abstract: We study numerically the spectrum and eigenstate properties of the Google matrix of various examples of directed networks such as vocabulary networks of dictionaries and university World Wide Web networks. The spectra have gapless structure in the vicinity of the maximal eigenvalue for Google damping parameter $\ensuremath{\alpha}$ equal to unity. The vocabulary networks have relatively homogeneous spectral density, while university networks have pronounced spectral structures which change from one university to another, reflecting specific properties of the networks. We also determine specific properties of eigenstates of the Google matrix, including the PageRank. The fidelity of the PageRank is proposed as a characterization of its stability.

Connected through hyperedge HE-1 (induced by source paper "two hop walks indicate pagerank order"):
  with members:
    - "black hole metric overcoming the pagerank normalization problem"
    - "pagerank standing on the shoulders of giants"
    - "delocalization transition for the google matrix"

Connected through hyperedge HE-2 (induced by source paper "spectral properties of google matrix of wikipedia and other networks"):
  with members:
    - "google matrix of twitter"
    - "toward two dimensional search engines"
    - "fractal weyl law for linux kernel architecture"
    - "towards physical laws for software architecture"
    - "two dimensional ranking of wikipedia articles"
    - "delocalization transition for the google matrix"

Connected through hyperedge HE-3 (induced by source paper "spectra of random graphs with arbitrary expected degrees"):
  with members:
    - "graph spectra and the detectability of community structure in networks"

Connected through hyperedge HE-4 (induced by source paper "google matrix of business process management"):
  with members:
    - "fractal weyl law for linux kernel architecture"
    - "towards physical laws for software architecture"
    - "two dimensional ranking of wikipedia articles"
    - "google matrix and ulam networks of intermittency maps"
    - "google matrix dynamical attractors and ulam networks"
    - "delocalization transition for the google matrix"

Connected through hyperedge HE-5 (induced by source paper "fractal weyl law for linux kernel architecture"):
  with members:
    - "towards physical laws for software architecture"
    - "google matrix and ulam networks of intermittency maps"
    - "google matrix dynamical attractors and ulam networks"
    - "delocalization transition for the google matrix"

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.IR(Information Retrieval)