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: "routing cryptocurrency with the spider network"
  Abstract: With the growing usage of Bitcoin and other cryptocurrencies, many scalability challenges have emerged. A promising scaling solution, exemplified by the Lightning Network, uses a network of bidirectional payment channels that allows fast transactions between two parties. However, routing payments on these networks efficiently is non-trivial, since payments require finding paths with sufficient funds, and channels can become unidirectional over time blocking further transactions through them. Today's payment channel networks exacerbate these problems by attempting to deliver all payments atomically. In this paper, we present the Spider network, a new packet-switched architecture for payment channel networks. Spider splits payments into transaction units and transmits them over time across different paths. Spider uses congestion control, payment scheduling, and imbalance-aware routing to optimize delivery of payments. Our results show that Spider improves the volume and number of successful payments on the network by 10-45% and 5-40% respectively compared to state-of-the-art approaches.

Connected through hyperedge HE-1 (induced by source paper "hushrelay a privacy preserving efficient and scalable routing algorithm for off chain payments"):
  with members:
    - "concurrency and privacy with payment channel networks"
    - "topological analysis of bitcoin s lightning network"
    - "ant routing algorithm for the lightning network"
    - "consensus in the age of blockchains"
    - "towards a concurrent and distributed route selection for payment channel networks"
    - "casper the friendly finality gadget"
    - "settling payments fast and private efficient decentralized routing for path based transactions"
    - "voute virtual overlays using tree embeddings"

Connected through hyperedge HE-2 (induced by source paper "ant routing scalability for the lightning network"):
  with members:
    - "topological analysis of bitcoin s lightning network"
    - "imbalance measure and proactive channel rebalancing algorithm for the lightning network"
    - "ant routing algorithm for the lightning network"
    - "txprobe discovering bitcoin s network topology using orphan transactions"
    - "high throughput cryptocurrency routing in payment channel networks"
    - "double spend races"
    - "settling payments fast and private efficient decentralized routing for path based transactions"

Connected through hyperedge HE-3 (induced by source paper "a secure consensus protocol for sidechains"):
  with members:
    - "selfish mining in ethereum"
    - "flash efficient dynamic routing for offchain networks"
    - "proteus a scalable bft consesus protocol for blockchains"
    - "sbft a scalable and decentralized trust infrastructure"
    - "hotstuff bft consensus in the lens of blockchain"
    - "a scale out blockchain for value transfer with spontaneous sharding"
    - "window based bft blockchain consensus"
    - "sprites and state channels payment networks that go faster than lightning"

Connected through hyperedge HE-4 (induced by source paper "privacy utility tradeoffs in routing cryptocurrency over payment channel networks"):
  with members:
    - "concurrency and privacy with payment channel networks"
    - "celer network bring internet scale to every blockchain"
    - "ohie blockchain scaling made simple"
    - "high throughput cryptocurrency routing in payment channel networks"
    - "dandelion redesigning the bitcoin network for anonymity"
    - "settling payments fast and private efficient decentralized routing for path based transactions"
    - "deanonymisation of clients in bitcoin p2p network"
    - "extremal mechanisms for local differential privacy"

Connected through hyperedge HE-5 (induced by source paper "boomerang redundancy improves latency and throughput in payment networks"):
  with members:
    - "flash efficient dynamic routing for offchain networks"
    - "speeding up distributed machine learning using codes"
    - "sprites and state channels payment networks that go faster than lightning"
    - "settling payments fast and private efficient decentralized routing for path based transactions"

Connected through hyperedge HE-6 (induced by source paper "imbalance measure and proactive channel rebalancing algorithm for the lightning network"):
  with members:
    - "boomerang redundancy improves latency and throughput in payment networks"
    - "ant routing algorithm for the lightning network"
    - "high throughput cryptocurrency routing in payment channel networks"

Connected through hyperedge HE-7 (induced by source paper "flash efficient dynamic routing for offchain networks"):
  with members:
    - "settling payments fast and private efficient decentralized routing for path based transactions"

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