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: "ranksign an efficient signature algorithm based on the rank metric"
  Abstract: In this paper we propose a new approach to code-based signatures that makes use in particular of rank metric codes. When the classical approach consists in finding the unique preimage of a syndrome through a decoding algorithm, we propose to introduce the notion of mixed decoding of erasures and errors for building signature schemes. In that case the difficult problem becomes, as is the case in lattice-based cryptography, finding a preimage of weight above the Gilbert-Varshamov bound (case where many solutions occur) rather than finding a unique preimage of weight below the Gilbert-Varshamov bound. The paper describes RankSign: a new signature algorithm for the rank metric based on a new mixed algorithm for decoding erasures and errors for the recently introduced Low Rank Parity Check (LRPC) codes. We explain how it is possible (depending on choices of parameters) to obtain a full decoding algorithm which is able to find a preimage of reasonable rank weight for any random syndrome with a very strong probability. We study the semantic security of our signature algorithm and show how it is possible to reduce the unforgeability to direct attacks on the public matrix, so that no information leaks through signatures. Finally, we give several examples of parameters for our scheme, some of which with public key of size $11,520$ bits and signature of size $1728$ bits. Moreover the scheme can be very fast for small base fields.

Connected through hyperedge HE-1 (induced by source paper "improved veron identification and signature schemes in the rank metric"):
  with members:
    - "wave a new code based signature scheme"
    - "efficient encryption from random quasi cyclic codes"
    - "new algorithms for decoding in the rank metric and an attack on the lrpc cryptosystem"
    - "a new algorithm for solving ring lpn with a reducible polynomial"
    - "on the complexity of the rank syndrome decoding problem"
    - "a new zero knowledge code based identification scheme with reduced communication"
    - "properties of codes in rank metric"

Connected through hyperedge HE-2 (induced by source paper "an algebraic attack on rank metric code based cryptosystems"):
  with members:
    - "two attacks on rank metric code based schemes ranksign and an identity based encryption scheme"
    - "improved cryptanalysis of rank metric schemes based on gabidulin codes"
    - "powers of tensors and fast matrix multiplication"
    - "on the complexity of the rank syndrome decoding problem"

Connected through hyperedge HE-3 (induced by source paper "on the complexity of the rank syndrome decoding problem"):
  with members:
    - "on the hardness of the decoding and the minimum distance problems for rank codes"
    - "on the complexity of the generalized minrank problem"
    - "a smart approach for gpt cryptosystem based on rank codes"
    - "on improving security of gpt cryptosystems"
    - "properties of codes in rank metric"

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)