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: "keeping authorities honest or bust with decentralized witness cosigning"
  Abstract: The secret keys of critical network authorities - such as time, name, certificate, and software update services - represent high-value targets for hackers, criminals, and spy agencies wishing to use these keys secretly to compromise other hosts. To protect authorities and their clients proactively from undetected exploits and misuse, we introduce CoSi, a scalable witness cosigning protocol ensuring that every authoritative statement is validated and publicly logged by a diverse group of witnesses before any client will accept it. A statement S collectively signed by W witnesses assures clients that S has been seen, and not immediately found erroneous, by those W observers. Even if S is compromised in a fashion not readily detectable by the witnesses, CoSi still guarantees S's exposure to public scrutiny, forcing secrecy-minded attackers to risk that the compromise will soon be detected by one of the W witnesses. Because clients can verify collective signatures efficiently without communication, CoSi protects clients' privacy, and offers the first transparency mechanism effective against persistent man-in-the-middle attackers who control a victim's Internet access, the authority's secret key, and several witnesses' secret keys. CoSi builds on existing cryptographic multisignature methods, scaling them to support thousands of witnesses via signature aggregation over efficient communication trees. A working prototype demonstrates CoSi in the context of timestamping and logging authorities, enabling groups of over 8,000 distributed witnesses to cosign authoritative statements in under two seconds.

Connected through hyperedge HE-1 (induced by source paper "que sera consensus simple asynchronous agreement with private coins and threshold logical clocks"):
  with members:
    - "revisiting fast practical byzantine fault tolerance"
    - "formal verification of multi paxos for distributed consensus"
    - "enhancing bitcoin security and performance with strong consistency via collective signing"
    - "on reducing the complexity of matrix clocks"
    - "randomized protocols for asynchronous consensus"

Connected through hyperedge HE-2 (induced by source paper "fides managing data on untrusted infrastructure"):
  with members:
    - "parblockchain leveraging transaction parallelism in permissioned blockchain systems"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "chainspace a sharded smart contracts platform"
    - "enhancing bitcoin security and performance with strong consistency via collective signing"

Connected through hyperedge HE-3 (induced by source paper "deconstructing blockchains a comprehensive survey on consensus membership and structure"):
  with members:
    - "dfinity technology overview series consensus system"
    - "analysis of the xrp ledger consensus protocol"
    - "hotstuff bft consensus in the lens of blockchain"
    - "evaluating the red belly blockchain"
    - "an empirical analysis of anonymity in zcash"
    - "a survey on security and privacy issues of bitcoin"
    - "blockchains consensus protocols in the wild"
    - "cachezoom how sgx amplifies the power of cache attacks"

Connected through hyperedge HE-4 (induced by source paper "a survey of distributed consensus protocols for blockchain networks"):
  with members:
    - "deconstructing blockchains a comprehensive survey on consensus membership and structure"
    - "a survey on consensus mechanisms and mining strategy management in blockchain networks"
    - "scalable bft consensus mechanism through aggregated signature gossip"
    - "asymmetric distributed trust"
    - "decentralization in bitcoin and ethereum networks"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "scaling nakamoto consensus to thousands of transactions per second"
    - "correctness and fairness of tendermint core blockchains"

Connected through hyperedge HE-5 (induced by source paper "towards global asset management in blockchain systems"):
  with members:
    - "atomic commitment across blockchains"
    - "parblockchain leveraging transaction parallelism in permissioned blockchain systems"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "atomic cross chain swaps"
    - "sidechains decoupled consensus between chains"
    - "blockchains consensus protocols in the wild"
    - "sprites and state channels payment networks that go faster than lightning"
    - "adding concurrency to smart contracts"

Connected through hyperedge HE-6 (induced by source paper "zero knowledge proof of identity sybil resistant anonymous authentication on permissionless blockchains and incentive compatible strictly dominant cryptocurrencies"):
  with members:
    - "diversification across mining pools optimal mining strategies under pow"
    - "sok tools for game theoretic models of security for cryptocurrencies"
    - "impossibility of full decentralization in permissionless blockchains"
    - "dfinity technology overview series consensus system"
    - "a game theoretic analysis of shard based permissionless blockchains"
    - "coconut threshold issuance selective disclosure credentials with applications to distributed ledgers"
    - "be selfish and avoid dilemmas fork after withholding faw attacks on bitcoin"
    - "enhancing bitcoin security and performance with strong consistency via collective signing"

Connected through hyperedge HE-7 (induced by source paper "making speculative bft resilient with trusted monotonic counters"):
  with members:
    - "scalable byzantine consensus via hardware assisted secret sharing"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "sbft a scalable decentralized trust infrastructure for blockchains"
    - "revisiting fast practical byzantine fault tolerance thelma velma and zelma"
    - "a byzantine fault tolerant ordering service for the hyperledger fabric blockchain platform"
    - "enhancing bitcoin security and performance with strong consistency via collective signing"
    - "breaking the o n 2 bit barrier scalable byzantine agreement with an adaptive adversary"

Connected through hyperedge HE-8 (induced by source paper "scalable bft consensus mechanism through aggregated signature gossip"):
  with members:
    - "hotstuff bft consensus in the lens of blockchain"
    - "casper the friendly finality gadget"
    - "enhancing bitcoin security and performance with strong consistency via collective signing"
    - "bitcoin ng a scalable blockchain protocol"

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