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: "information flow control in webkit s javascript bytecode"
  Abstract: Websites today routinely combine JavaScript from multiple sources, both trusted and untrusted. Hence, JavaScript security is of paramount importance. A specific interesting problem is information flow control (IFC) for JavaScript. In this paper, we develop, formalize and implement a dynamic IFC mechanism for the JavaScript engine of a production Web browser (specifically, Safari's WebKit engine). Our IFC mechanism works at the level of JavaScript bytecode and hence leverages years of industrial effort on optimizing both the source to bytecode compiler and the bytecode interpreter. We track both explicit and implicit flows and observe only moderate overhead. Working with bytecode results in new challenges including the extensive use of unstructured control flow in bytecode (which complicates lowering of program context taints), unstructured exceptions (which complicate the matter further) and the need to make IFC analysis permissive. We explain how we address these challenges, formally model the JavaScript bytecode semantics and our instrumentation, prove the standard property of termination-insensitive non-interference, and present experimental results on an optimized prototype.

Connected through hyperedge HE-1 (induced by source paper "an empirical study of information flows in real world javascript"):
  with members:
    - "webpol fine grained information flow policies for web browsers"

Connected through hyperedge HE-2 (induced by source paper "tracing information flows between ad exchanges using retargeted ads"):
  with members:
    - "include me out in browser detection of malicious third party content inclusions"
    - "i always feel like somebody s watching me measuring online behavioural advertising"
    - "adscape harvesting and analyzing online display ads"
    - "automated experiments on ad privacy settings a tale of opacity choice and discrimination"
    - "xray enhancing the web s transparency with differential correlation"
    - "social turing tests crowdsourcing sybil detection"

Connected through hyperedge HE-3 (induced by source paper "wpse fortifying web protocols via browser side security monitoring"):
  with members:
    - "analysing the security of google s implementation of openid connect"
    - "spresso a secure privacy respecting single sign on system for the web"

Connected through hyperedge HE-4 (induced by source paper "monitoring hyperproperties"):
  with members:
    - "monitorability of omega regular languages"

Connected through hyperedge HE-5 (induced by source paper "generalizing permissive upgrade in dynamic information flow analysis"):
  with members:
    - "on dynamic flow sensitive floating label systems"

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.CR(Cryptography and Security)