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: "towards an economic analysis of routing in payment channel networks"
  Abstract: Payment channel networks are supposed to overcome technical scalability limitations of blockchain infrastructure by employing a special overlay network with fast payment confirmation and only sporadic settlement of netted transactions on the blockchain. However, they introduce economic routing constraints that limit decentralized scalability and are currently not well understood. In this paper, we model the economic incentives for participants in payment channel networks. We provide the first formal model of payment channel economics and analyze how the cheapest path can be found. Additionally, our simulation assesses the long-term evolution of a payment channel network. We find that even for small routing fees, sometimes it is cheaper to settle the transaction directly on the blockchain.

Connected through hyperedge HE-1 (induced by source paper "snappy fast on chain payments with practical collaterals"):
  with members:
    - "dfinity technology overview series consensus system"
    - "gosig scalable byzantine consensus on adversarial wide area network for blockchains"
    - "sprites and state channels payment networks that go faster than lightning"
    - "consensus in the age of blockchains"
    - "casper the friendly finality gadget"
    - "strong federations an interoperable blockchain solution to centralized third party risks"

Connected through hyperedge HE-2 (induced by source paper "a cryptoeconomic traffic analysis of bitcoins lightning network"):
  with members:
    - "privacy utility tradeoffs in routing cryptocurrency over payment channel networks"
    - "topological analysis of bitcoin s lightning network"
    - "the evolution of lightning network s topology during its first year and the influence over its core values"
    - "payment networks as creation games"
    - "discharged payment channels quantifying the lightning network s resilience to topology based attacks"
    - "ant routing algorithm for the lightning network"
    - "payment network design with fees"
    - "sprites and state channels payment networks that go faster than lightning"

Connected through hyperedge HE-3 (induced by source paper "how to profit from payments channels"):
  with members:
    - "discharged payment channels quantifying the lightning network s resilience to topology based attacks"
    - "celer network bring internet scale to every blockchain"
    - "payment network design with fees"
    - "sprites and state channels payment networks that go faster than lightning"
    - "how to charge lightning"
    - "improving the betweenness centrality of a node by adding links"
    - "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.CE(Computational Engineering, Finance, and Science)