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 "efficient multicasting in content centric networks using datagrams"):
  Abstract: The Named Data Networking (NDN) and Content-Centric Networking (CCNx) architectures are the leading approaches for content-centric networking, and both require using Interests (requests that elicit content) and maintaining per-Interest forwarding state in Pending Interest Tables (PIT) to store per-Interest forwarding state. To date, PITs have been assumed to be necessary to enable native support for multicasting in the data plane, such that multicast forwarding trees (MFT) are established by the forwarding and aggregation of Interests using PITs. We present a new approach to content-centric networks based on anonymous datagrams that provides native support for multicasting, but does so without the need to maintain per-Interest forwarding state. Simulation experiments are used to show that the proposed new approach attains the same end-to-end delays for multicasting while requiring orders of magnitude fewer forwarding entries.

Includes members:
  Member "characterizing interest aggregation in content centric networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adn an information centric networking architecture for the internet of things")
  Member "a light weight forwarding plane for content centric networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adn an information centric networking architecture for the internet of things")
  Member "enabling correct interest forwarding and retransmissions in a content centric network":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "adn an information centric networking architecture for the internet of things")
  Member "backscatter from the data plane threats to stability and security in information centric network infrastructure":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "gain more for less the surprising benefits of qos management in constrained ndn networks")
  Member "impact of traffic mix on caching performance in a content centric network":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cache optimization models and algorithms")
  Member "dos and ddos 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")

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)