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: "principles for measurability in protocol design"
  Abstract: Measurement has become fundamental to the operation of networks and at-scale services---whether for management, security, diagnostics, optimization, or simply enhancing our collective understanding of the Internet as a complex system. Further, measurements are useful across points of view---from end hosts to enterprise networks and data centers to the wide area Internet. We observe that many measurements are decoupled from the protocols and applications they are designed to illuminate. Worse, current measurement practice often involves the exploitation of side-effects and unintended features of the network, or, in other words, the artful piling of hacks atop one another. This state of affairs is a direct result of the relative paucity of diagnostic and measurement capabilities built into today's network stack. #R##N#Given our modern dependence on ubiquitous measurement, we propose measurability as an explicit low-level goal of current protocol design, and argue that measurements should be available to all network protocols throughout the stack. We seek to generalize the idea of measurement within protocols, e.g., the way in which TCP relies on measurement to drive its end-to-end behavior. Rhetorically, we pose the question: what if the stack had been built with measurability and diagnostic support in mind? We start from a set of principles for explicit measurability, and define primitives that, were they supported by the stack, would not only provide a solid foundation for protocol design going forward, but also reduce the cost and increase the accuracy of measuring the network.

Connected through hyperedge HE-1 (induced by source paper "an internet heartbeat"):
  with members:
    - "yarrp ing the internet randomized high speed active topology discovery"
    - "beyond counting new perspectives on the active ipv4 address space"
    - "encore lightweight measurement of web censorship with cross origin requests"

Connected through hyperedge HE-2 (induced by source paper "measurements as first class artifacts"):
  with members:
    - "sonata query driven network telemetry"
    - "the case for data plane timestamping in sdn"
    - "dapper data plane performance diagnosis of tcp"

Connected through hyperedge HE-3 (induced by source paper "a long way to the top significance structure and stability of internet top lists"):
  with members:
    - "an empirical survey on the early adoption of dns certification authority authorization"
    - "on the content security policy violations due to the same origin policy"
    - "loophole timing attacks on shared event loops in chrome"
    - "most websites don t need to vibrate a cost benefit approach to improving browser security"
    - "what s in a name understanding profile name reuse on twitter"
    - "dial one for scam a large scale analysis of technical support scams"
    - "inferring individual attributes from search engine queries and auxiliary information"
    - "filteredweb a framework for the automated search based discovery of blocked urls"

Connected through hyperedge HE-4 (induced by source paper "sdn as active measurement infrastructure"):
  with members:
    - "encore lightweight measurement of web censorship with cross origin requests"

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)