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: "a light weight forwarding plane for content centric networks"
  Abstract: We present CCN-DART, a more efficient forwarding approach for content-centric networking (CCN) than named data networking (NDN) that substitutes Pending Interest Tables (PIT) with Data Answer Routing Tables (DART) and uses a novel approach to eliminate forwarding loops. The forwarding state required at each router using CCN-DART consists of segments of the routes between consumers and content providers that traverse a content router, rather than the Interests that the router forwards towards content providers. Accordingly, the size of a DART is proportional to the number of routes used by Interests traversing a router, rather than the number of Interests traversing a router. We show that CCN-DART avoids forwarding loops by comparing distances to name prefixes reported by neighbors, even when routing loops exist. Results of simulation experiments comparing CCN-DART with NDN using the ndnSIM simulation tool show that CCN-DART incurs 10 to 20 times less storage overhead.

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"
    - "characterizing interest aggregation in content centric networks"
    - "content centric networking at internet scale through the integration of name resolution and routing"
    - "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:
    - "characterizing interest aggregation in 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"
    - "characterizing interest aggregation in 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:
    - "characterizing interest aggregation in 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"

Connected through hyperedge HE-5 (induced by source paper "characterizing interest aggregation in content centric networks"):
  with members:
    - "impact of traffic mix on caching performance in a content centric network"
    - "a versatile and accurate approximation for lru cache performance"

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)