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: "sybilcontrol practical sybil defense with computational puzzles"
  Abstract: Many distributed systems are subject to the Sybil attack, where an adversary subverts system operation by emulating behavior of multiple distinct nodes. Most recent work to address this problem leverages social networks to establish trust relationships between users. However, the use of social networks is not appropriate in all systems, as they can be subverted by social engineering techniques, require nodes in a P2P network to maintain and be aware of social network information, and may require overly optimistic assumptions about the fast-mixing nature of social links. #R##N#This paper explores an alternate approach. We present SybilControl, a novel, decentralized scheme for controlling the extent of Sybil attacks. SybilControl is an admission control mechanism for nodes in a distributed system that requires them to periodically solve computational puzzles. SybilControl consists of a distributed protocol to allow nodes to collectively verify the computational work of other nodes, and mechanisms to prevent the malicious influence of misbehaving nodes that do not perform the computational work. We investigate the practical issues involved with deploying SybilControl into existing DHTs, particularly with resilient lookup protocols. We evaluate SybilControl through simulations and find that SybilControl retains low overhead and latency. Additionally, even when the adversary controls 20% of the system's computational resources, SybilControl-enabled DHTs can be configured to maintain lookup performance at over 99% success rate using low communication overhead.

Connected through hyperedge HE-1 (induced by source paper "resource competitive sybil defenses"):
  with members:
    - "proof of work without all the work"
    - "secure one way interactive communication"
    - "torbricks blocking resistant tor bridge distribution"
    - "interactive communication with unknown noise rate"
    - "bitcoin ng a scalable blockchain protocol"
    - "the mason test a defense against sybil attacks in wireless networks without trusted authorities"
    - "self healing computation"
    - "the sybil attacks and defenses a survey"

Connected through hyperedge HE-2 (induced by source paper "foundations properties and security applications of puzzles a survey"):
  with members:
    - "revisiting client puzzles for state exhaustion attacks resilience"
    - "majority is not enough bitcoin mining is vulnerable"
    - "a new bound on the performance of the bandwidth puzzle"

Connected through hyperedge HE-3 (induced by source paper "proof of work without all the work computationally efficient attack resistant systems"):
  with members:
    - "proof of work without all the work"
    - "secure one way interactive communication"
    - "torbricks blocking resistant tor bridge distribution"
    - "interactive communication with unknown noise rate"
    - "the mason test a defense against sybil attacks in wireless networks without trusted authorities"
    - "self healing computation"
    - "the sybil attacks and defenses a survey"
    - "storage and search in dynamic peer to peer networks"

Connected through hyperedge HE-4 (induced by source paper "proof of work without all the work"):
  with members:
    - "algorand the efficient and democratic ledger"
    - "bitcoin ng a scalable blockchain protocol"
    - "the mason test a defense against sybil attacks in wireless networks without trusted authorities"
    - "the sybil attacks and defenses a survey"
    - "uncovering social network sybils in the wild"
    - "breaking the o n 2 bit barrier scalable byzantine agreement with an adaptive adversary"

Connected through hyperedge HE-5 (induced by source paper "tiny groups tackle byzantine adversaries"):
  with members:
    - "proof of work without all the work"
    - "algorand the efficient and democratic ledger"
    - "self healing computation"
    - "storage and search in dynamic peer to peer networks"
    - "breaking the o n 2 bit barrier scalable byzantine agreement with an adaptive adversary"

Connected through hyperedge HE-6 (induced by source paper "a resource competitive jamming defense"):
  with members:
    - "interactive communication with unknown noise rate"
    - "competitive mac under adversarial sinr"
    - "vulnerability of lte to hostile interference"
    - "asynchrony and collusion in the n party bar transfer problem"
    - "making evildoers pay resource competitive broadcast in sensor networks"
    - "a jamming resistant mac protocol for multi hop wireless networks"
    - "netfence preventing internet denial of service from inside out"

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)