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 "geohyperbolic routing and addressing schemes"):
  Abstract: The key requirement to routing in any telecommunication network, and especially in Internet-of-Things (IoT) networks, is scalability. Routing must route packets between any source and destination in the network without incurring unmanageable routing overhead that grows quickly with increasing network size and dynamics. Here we present an addressing scheme and a coupled network topology design scheme that guarantee essentially optimal routing scalability. The FIB sizes are as small as they can be, equal to the number of adjacencies a node has, while the routing control overhead is minimized as nearly zero routing control messages are exchanged even upon catastrophic failures in the network. The key new ingredient is the addressing scheme, which is purely local, based only on geographic coordinates of nodes and a centrality measure, and does not require any sophisticated non-local computations or global network topology knowledge for network embedding. The price paid for these benefits is that network topology cannot be arbitrary but should follow a specific design, resulting in Internet-like topologies. The proposed schemes can be most easily deployed in overlay networks, and also in other network deployments, where geolocation information is available, and where network topology can grow following the design specifications.

Includes members:
  Member "greedy routing and the algorithmic small world phenomenom":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "average distance in a general class of scale free networks with underlying geometry")
  Member "generating massive complex networks with hyperbolic geometry faster in practice":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "recent advances in scalable network generation")
  Member "an experimental investigation of hyperbolic routing with a smart forwarding plane in ndn":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "link persistence and conditional distances in multiplex networks")
  Member "sampling geometric inhomogeneous random graphs in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "understanding the effectiveness of data reduction in public transportation networks")
  Member "network mapping by replaying hyperbolic growth":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "social centralization and semantic collapse hyperbolic embeddings of networks and text")
  Member "geometric inhomogeneous random graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "recent advances in scalable network generation")
  Member "network geometry inference using common neighbors":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hyperkg hyperbolic knowledge graph embeddings for knowledge base completion")
  Member "sustaining the internet with hyperbolic mapping":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "hyperkg hyperbolic knowledge graph embeddings for knowledge base completion")

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.NI(Networking and Internet Architecture)