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: "inductive analysis of the internet protocol tls"
  Abstract: Internet browsers use security protocols to protect sensitive messages. An inductive analysis of TLS (a descendant of SSL 3.0) has been performed using the theorem prover Isabelle. Proofs are based on higher-order logic and make no assumptions concerning beliefs of finiteness. All the obvious security goals can be proved; session resumption appears to be secure even if old session keys are compromised. The proofs suggest minor changes to simplify the analysis.   TLS, even at an abstract level, is much more complicated than most protocols verified by researchers. Session keys are negotiated rather than distributed, and the protocol has many optional parts. Netherless, the resources needed to verify TLS are modest: six man-weeks of effort and three minutes of processor time.

Connected through hyperedge HE-1 (induced by source paper "security privacy and trust for smart mobile internet of things m iot a survey"):
  with members:
    - "a framework for mitigating zero day attacks in iot"
    - "nhad neuro fuzzy based horizontal anomaly detection in online social networks"
    - "mobile edge computing fog et al a survey and analysis of security threats and challenges"
    - "advertising in the iot era vision and challenges"
    - "managing service heterogeneity using osmotic computing"
    - "extension of mih to support fpmipv6 for optimized heterogeneous handover"
    - "securing wireless communications of the internet of things from the physical layer an overview"
    - "traffic aware patching for cyber security in mobile iot"

Connected through hyperedge HE-2 (induced by source paper "formal methods and cybersecurity"):
  with members:
    - "how reliable is the crowdsourced knowledge of security implementation"
    - "a uk case study on cybersecurity education and accreditation"

Connected through hyperedge HE-3 (induced by source paper "computational logic its origins and applications"):
  with members:
    - "formalization of the fundamental group in untyped set theory using auto2"
    - "a formally verified proof of the central limit theorem"
    - "natural deduction as higher order resolution"
    - "the foundation of a generic theorem prover"
    - "isabelle the next 700 theorem provers"

Connected through hyperedge HE-4 (induced by source paper "verifying cryptographic security implementations in c using automated model extraction"):
  with members:
    - "guiding a general purpose c verifier to prove cryptographic protocols"
    - "extracting and verifying cryptographic models from c protocol code by symbolic execution"
    - "a formally verified compiler back end"
    - "automatic verification of correspondences for security protocols"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-5 (induced by source paper "proving properties of rich internet applications"):
  with members:
    - "state event based versus purely action or state based logics"
    - "concur an algorithm for merging concurrent changes without conflicts"

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)