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 "throughput optimal routing in blockchain based payment systems"):
  Abstract: Cryptocurrency networks such as Bitcoin have emerged as a distributed alternative to traditional centralized financial transaction networks. However, there are major challenges in scaling up the throughput of such networks. Lightning network and Spider network are alternates that build bidirectional payment channels on top of cryptocurrency networks using smart contracts, to enable fast transactions that bypass the Blockchain. #R##N#In this paper, we study the problem of routing transactions in such a payment processing network. We first propose a Stochastic model to study such a system, as opposed to a fluid model that is studied in the literature. Each link in such a model is a two-sided queue, and unlike classical queues, such queues are not stable unless there is an external control. We propose a notion of stability for the payment processing network consisting of such two-sided queues using the notion of on-chain rebalancing. We then characterize the capacity region and propose a throughput optimal algorithm that stabilizes the system under any load within the capacity region. The stochastic model enables us to study closed loop policies, which typically have better queuing/delay performance than the open loop policies (or static split rules) studied in the literature. We investigate this through simulations.

Includes members:
  Member "atomic cross chain swaps":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed cross blockchain transactions")
  Member "high throughput cryptocurrency routing in payment channel networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the strength of connectivity of inhomogeneous random k out graphs")
  Member "settling payments fast and private efficient decentralized routing for path based transactions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "hushrelay a privacy preserving efficient and scalable routing algorithm for off chain payments")
  Member "pricing and optimization in shared vehicle systems an approximation framework":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "putting ridesharing to the test efficient and scalable solutions and the power of dynamic vehicle relocation")
  Member "privacy preserving shortest path computation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a hybrid approach to secure function evaluation using sgx")
  Member "online advertisement optimization and stochastic networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "is deadline oblivious scheduling efficient for controlling real time traffic in cellular downlink systems")

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.DC(Distributed, Parallel, and Cluster Computing)