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: "high throughput cryptocurrency routing in payment channel networks"
  Abstract: Despite growing adoption of cryptocurrencies, making fast payments at scale remains a challenge. Payment channel networks (PCNs) such as the Lightning Network have emerged as a viable scaling solution. However, completing payments on PCNs is challenging: payments must be routed on paths with sufficient funds. As payments flow over a single channel (link) in the same direction, the channel eventually becomes depleted and cannot support further payments in that direction; hence, naive routing schemes like shortest-path routing can deplete key payment channels and paralyze the system. Today's PCNs also route payments atomically, worsening the problem. In this paper, we present Spider, a routing solution that "packetizes" transactions and uses a multi-path transport protocol to achieve high-throughput routing in PCNs. Packetization allows Spider to complete even large transactions on low-capacity payment channels over time, while the multi-path congestion control protocol ensures balanced utilization of channels and fairness across flows. Through extensive simulations, we show that Spider requires less than 25% of the funds needed by state-of-the-art approaches to successfully route over 95% of the transactions on balanced traffic demands, and requires only one on-chain transaction for every 10K transactions routed to achieve full throughput on imbalanced demands.

Connected through hyperedge HE-1 (induced by source paper "on the strength of connectivity of inhomogeneous random k out graphs"):
  with members:
    - "privacy utility tradeoffs in routing cryptocurrency over payment channel networks"
    - "k connectivity in random key graphs with unreliable links"
    - "towards k connectivity in heterogeneous sensor networks under pairwise key predistribution"
    - "topological analysis of bitcoin s lightning network"
    - "dandelion lightweight cryptocurrency networking with formal anonymity guarantees"
    - "k connectivity of inhomogeneous random key graphs with unreliable links"
    - "toward k connectivity of the random graph induced by a pairwise key predistribution scheme with unreliable links"
    - "modeling the pairwise key predistribution scheme in the presence of unreliable links"

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"
    - "routing cryptocurrency with the spider network"
    - "txprobe discovering bitcoin s network topology using orphan transactions"
    - "double spend races"
    - "settling payments fast and private efficient decentralized routing for path based transactions"

Connected through hyperedge HE-3 (induced by source paper "throughput optimal routing in blockchain based payment systems"):
  with members:
    - "atomic cross chain swaps"
    - "settling payments fast and private efficient decentralized routing for path based transactions"
    - "pricing and optimization in shared vehicle systems an approximation framework"
    - "privacy preserving shortest path computation"
    - "online advertisement optimization and stochastic networks"

Connected through hyperedge HE-4 (induced by source paper "improving sustainability of cryptocurrency payment networks for iot applications"):
  with members:
    - "flash efficient dynamic routing for offchain networks"
    - "settling payments fast and private efficient decentralized routing for path based transactions"

Connected through hyperedge HE-5 (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"
    - "routing cryptocurrency with the spider network"
    - "ohie blockchain scaling made simple"
    - "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-6 (induced by source paper "the strength of connectivity of random graphs induced by pairwise key predistribution schemes implications on security and reliability of heterogeneous sensor networks"):
  with members:
    - "k connectivity in random key graphs with unreliable links"
    - "towards k connectivity in heterogeneous sensor networks under pairwise key predistribution"
    - "k connectivity of inhomogeneous random key graphs with unreliable links"
    - "toward k connectivity of the random graph induced by a pairwise key predistribution scheme with unreliable links"
    - "robustness of complex networks with implications for consensus and contagion"

Connected through hyperedge HE-7 (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"
    - "routing cryptocurrency with the spider network"

Connected through hyperedge HE-8 (induced by source paper "on the limits of byzantine tolerant spanning tree construction in route restricted overlay 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)