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: "efficient system enforced deterministic parallelism"
  Abstract: Deterministic execution offers many benefits for debugging, fault tolerance, and security. Running parallel programs deterministically is usually difficult and costly, however - especially if we desire system-enforced determinism, ensuring precise repeatability of arbitrarily buggy or malicious software. Determinator is a novel operating system that enforces determinism on both multithreaded and multi-process computations. Determinator's kernel provides only single-threaded, "shared-nothing" address spaces interacting via deterministic synchronization. An untrusted user-level runtime uses distributed computing techniques to emulate familiar abstractions such as Unix processes, file systems, and shared memory multithreading. The system runs parallel applications deterministically both on multicore PCs and across nodes in a cluster. Coarse-grained parallel benchmarks perform and scale comparably to - sometimes better than - conventional systems, though determinism is costly for fine-grained parallel applications.

Connected through hyperedge HE-1 (induced by source paper "streambox tz secure stream analytics at the edge with trustzone"):
  with members:
    - "securestreams a reactive middleware framework for secure data stream processing"
    - "trustshadow secure execution of unmodified applications with arm trustzone"
    - "c flat control flow attestation for embedded systems software"
    - "armageddon cache attacks on mobile devices"
    - "massively parallel sort merge joins in main memory multi core database systems"

Connected through hyperedge HE-2 (induced by source paper "ireplayer in situ and identical record and replay for multithreaded applications"):
  with members:
    - "doubletake fast and precise error detection via evidence based dynamic analysis"

Connected through hyperedge HE-3 (induced by source paper "parallel wavelet tree construction"):
  with members:
    - "parallelism in randomized incremental algorithms"
    - "parallel local graph clustering"
    - "sorting with asymmetric read and write costs"
    - "efficient algorithms with asymmetric read and write costs"
    - "wavelet trees meet suffix trees"
    - "counting triangles in massive graphs with mapreduce"
    - "parallel graph decompositions using random shifts"
    - "skew strikes back new developments in the theory of join algorithms"

Connected through hyperedge HE-4 (induced by source paper "deterministically deterring timing attacks in deterland"):
  with members:
    - "determinating timing channels in compute clouds"

Connected through hyperedge HE-5 (induced by source paper "optimistic parallel state machine replication"):
  with members:
    - "rethinking state machine replication for parallelism"

Connected through hyperedge HE-6 (induced by source paper "plugging side channel leaks with timing information flow control"):
  with members:
    - "determinating timing channels in compute clouds"

Connected through hyperedge HE-7 (induced by source paper "determinating timing channels in compute clouds"):
  with members:
    - "deterministic consistency a programming model for shared memory parallelism"

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.OS(Operating Systems)