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: "yarrp ing the internet randomized high speed active topology discovery"
  Abstract: Obtaining a "snapshot" of the Internet topology remains an elusive task. Existing active topology discovery techniques and systems require significant probing time -- time during which the underlying network may experience transient dynamics. This work considers how active probing can gather the Internet topology in minutes rather than days. Conventional approaches to active topology mapping face two primary speed and scale impediments: i) per-trace state maintenance; and ii) a low-degree of parallelism. Based on this observation, we develop Yarrp (Yelling at Random Routers Progressively), a new traceroute technique designed for high-rate, Internet-scale probing. Yarrp is stateless, reconstituting all necessary information from ICMP replies as they arrive asynchronously. To avoid overloading routers or links with probe traffic, Yarrp randomly permutes an input IP X TTL space. We run Yarrp at 100Kpps, a rate at which the paths to all IPv4 /24's can be mapped in approximately one hour from a single vantage point. We compare Yarrp against existing systems, and present examples of topological dynamics exposed via the high sampling rates Yarrp enables.

Connected through hyperedge HE-1 (induced by source paper "discovering the ipv6 network periphery"):
  with members:
    - "eui 64 considered harmful"
    - "in the ip of the beholder strategies for active ipv6 topology discovery"
    - "clusters in the expanse understanding and unbiasing ipv6 hitlists"
    - "entropy ip uncovering structure in ipv6 addresses"
    - "temporal and spatial classification of active ipv6 addresses"

Connected through hyperedge HE-2 (induced by source paper "an internet heartbeat"):
  with members:
    - "principles for measurability in protocol design"
    - "beyond counting new perspectives on the active ipv4 address space"
    - "encore lightweight measurement of web censorship with cross origin requests"

Connected through hyperedge HE-3 (induced by source paper "tnt watch me explode a light in the dark for revealing mpls tunnels"):
  with members:
    - "efficient algorithms for large scale topology discovery"

Connected through hyperedge HE-4 (induced by source paper "in the ip of the beholder strategies for active ipv6 topology discovery"):
  with members:
    - "clusters in the expanse understanding and unbiasing ipv6 hitlists"
    - "kip a measured approach to ipv6 address anonymization"
    - "entropy ip uncovering structure in ipv6 addresses"
    - "scanning the ipv6 internet towards a comprehensive hitlist"
    - "temporal and spatial classification of active ipv6 addresses"
    - "efficient algorithms for large scale topology discovery"

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)