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: "characterizing interest aggregation in content centric networks"
  Abstract: The Named Data Networking (NDN) and Content-Centric Networking (CCN) architectures advocate Interest aggregation as a means to reduce end-to-end latency and bandwidth consumption. To enable these benefits, Interest aggregation must be realized through Pending Interest Tables (PIT) that grow in size at the rate of incoming Interests to an extent that may eventually defeat their original purpose. A thorough analysis is provided of the Interest aggregation mechanism using mathematical arguments backed by extensive discrete-event simulation results. We present a simple yet accurate analytical framework for characterizing Interest aggregation in an LRU cache, and use our model to develop an iterative algorithm to analyze the benefits of Interest aggregation in a network of interconnected caches. Our findings reveal that, under realistic assumptions, an insignificant fraction of Interests in the system benefit from aggregation, compromising the effectiveness of using PITs as an integral component of Content-Centric Networks.

Connected through hyperedge HE-1 (induced by source paper "adn an information centric networking architecture for the internet of things"):
  with members:
    - "content centric networking using anonymous datagrams"
    - "content centric networking at internet scale through the integration of name resolution and routing"
    - "a light weight forwarding plane for content centric networks"
    - "enabling correct interest forwarding and retransmissions in a content centric network"
    - "efficient multicasting in content centric networks using datagrams"
    - "backscatter from the data plane threats to stability and security in information centric network infrastructure"
    - "dos and ddos in named data networking"

Connected through hyperedge HE-2 (induced by source paper "boosting the performance of content centric networking using delay tolerant networking mechanisms"):
  with members:
    - "a light weight forwarding plane for content centric networks"
    - "a survey on device to device communication in cellular networks"
    - "content centric routing in wi fi direct multi group networks"

Connected through hyperedge HE-3 (induced by source paper "content centric networking at internet scale through the integration of name resolution and routing"):
  with members:
    - "content centric networking using anonymous datagrams"
    - "a light weight forwarding plane for content centric networks"
    - "enabling correct interest forwarding and retransmissions in a content centric network"
    - "efficient multicasting in content centric networks using datagrams"
    - "backscatter from the data plane threats to stability and security in information centric network infrastructure"
    - "dos and ddos in named data networking"

Connected through hyperedge HE-4 (induced by source paper "efficient multicasting in content centric networks using datagrams"):
  with members:
    - "a light weight forwarding plane for content centric networks"
    - "enabling correct interest forwarding and retransmissions in a content centric network"
    - "backscatter from the data plane threats to stability and security in information centric network infrastructure"
    - "impact of traffic mix on caching performance in a content centric network"
    - "dos and ddos in named data networking"

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)