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 "congestion attacks in payment channel networks"):
  Abstract: Payment channel networks provide a fast and scalable solution to relay funds, acting as a second layer to slower and less scalable blockchain protocols. In this paper, we present an accessible, low-cost attack, in which the attacker paralyzes multiple payment network channels for several days. The attack is based on overloading channels with requests that are kept unresolved until their expiration time. Reaching the maximum allowed unresolved requests (HTLCs) locks the channel for new payments. The attack is in fact inherent to the way off-chain networks are constructed, since limits on the number of unresolved payments are derived from limits on the blockchain. We consider two main versions of the attack: one in which the attacker attempts to block as many high liquidity channels as possible, and one in which it tries to isolate individual nodes from the network. We evaluate the costs of both attacks on Bitcoin's Lightning Network, and compare how changes in the network have affected the cost of attack. Specifically, we consider how recent changes to default parameters in each of the main Lightning implementations contribute to the attack. As we evaluate the attacks, we also look at statistics on parameters in the Lightning Network which are of independent interest and compare the various implementations of Lightning nodes. Finally, we suggest mitigation techniques that make the attack much harder to carry out.

Includes members:
  Member "concurrency and privacy with payment channel networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hushrelay a privacy preserving efficient and scalable routing algorithm for off chain payments")
  Member "privacy utility tradeoffs in routing cryptocurrency over 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 "hijacking routes in payment channel networks a predictability tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "toward active and passive confidentiality attacks on cryptocurrency off chain networks")
  Member "topological analysis of bitcoin s lightning network":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "hushrelay a privacy preserving efficient and scalable routing algorithm for off chain payments")
  Member "discharged payment channels quantifying the lightning network s resilience to topology based attacks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "toward active and passive confidentiality attacks on cryptocurrency off chain networks")
  Member "towards secure and efficient payment channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fail safe watchtowers and short lived assertions for payment channels")
  Member "sprites and state channels payment networks that go faster than lightning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "snappy fast on chain payments with practical collaterals")

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.CR(Cryptography and Security)