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: "hindering reaction attacks by using monomial codes in the mceliece cryptosystem"
  Abstract: In this paper we study recent reaction attacks against QC-LDPC and QC-MDPC code-based cryptosystems, which allow an opponent to recover the private parity-check matrix through its distance spectrum by observing a sufficiently high number of decryption failures. We consider a special class of codes, known as monomial codes, to form private keys with the desirable property of having a unique and complete distance spectrum. We verify that for these codes the problem of recovering the secret key from the distance spectrum is equivalent to that of finding cliques in a graph, and use this equivalence to prove that current reaction attacks are not applicable when codes of this type are used in the McEliece cryptosystem.

Connected through hyperedge HE-1 (induced by source paper "analysis of the error correction capability of ldpc and mdpc codes under parallel bit flipping decoding and application to cryptography"):
  with members:
    - "analysis of reaction and timing attacks against cryptosystems based on sparse parity check codes"
    - "the decoding failure probability of mdpc codes"
    - "ledakem a post quantum key encapsulation mechanism based on qc ldpc codes"
    - "security and complexity of the mceliece cryptosystem based on quasi cyclic low density parity check codes"
    - "on the guaranteed error correction capability of ldpc codes"

Connected through hyperedge HE-2 (induced by source paper "analysis of reaction and timing attacks against cryptosystems based on sparse parity check codes"):
  with members:
    - "the decoding failure probability of mdpc codes"
    - "assessing and countering reaction attacks against post quantum public key cryptosystems based on qc ldpc codes"
    - "ledakem a post quantum key encapsulation mechanism based on qc ldpc codes"

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.IT(Information Theory)