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 "bead best effort autonomous deletion in content centric networking"):
  Abstract: A core feature of Content-Centric Networking (CCN) is opportunistic content caching in routers. It enables routers to satisfy content requests with in-network cached copies, thereby reducing bandwidth utilization, decreasing congestion, and improving overall content retrieval latency. #R##N#One major drawback of in-network caching is that content producers have no knowledge about where their content is stored. This is problematic if a producer wishes to delete its content. In this paper, we show how to address this problem with a protocol called BEAD (Best-Effort Autonomous Deletion). BEAD achieves content deletion via small and secure packets that resemble current CCN messages. We discuss several methods of routing BEAD messages from producers to caching routers with varying levels of network overhead and efficacy. We assess BEAD performance via simulations and provide a detailed analysis of its properties.

Includes members:
  Member "enabling correct interest forwarding and retransmissions in a content centric network":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adn an information centric networking architecture for the internet of things")
  Member "to nack or not to nack negative acknowledgments in information centric networking":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "security and privacy analysis of nsf future internet architectures")
  Member "interest based access control for content centric networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "krb ccn lightweight authentication access control for private content centric networks")
  Member "cost aware caching optimizing cache provisioning and object placement in icn":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the 5g cellular backhaul management dilemma to cache or to serve")
  Member "network layer trust in named data networking":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "security privacy and access control in information centric networking a survey")
  Member "poseidon mitigating interest flooding ddos attacks in named data networking":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "expect more from the networking ddos mitigation by fitt in named data networking")
  Member "dos and ddos in named data networking":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "expect more from the networking ddos mitigation by fitt in named data networking")

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.NI(Networking and Internet Architecture)