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: "on the hardness of the decoding and the minimum distance problems for rank codes"
  Abstract: In this paper we give a randomized reduction for the Rank Syndrome Decoding problem and Rank Minimum Distance problem for rank codes. Our results are based on an embedding from linear codes equipped with Hamming distance unto linear codes over an extension field equipped with the rank metric. We prove that if both previous problems for rank metric are in ZPP = RP$\cap$coRP, then we would have NP=ZPP. We also give complexity results for the respective approximation problems in rank metric.

Connected through hyperedge HE-1 (induced by source paper "ranksign an efficient signature algorithm based on the rank metric"):
  with members:
    - "on the complexity of the rank syndrome decoding problem"
    - "communication over finite field matrix channels"
    - "properties of codes in rank metric"

Connected through hyperedge HE-2 (induced by source paper "ranksynd a prng based on rank metric"):
  with members:
    - "new algorithms for decoding in the rank metric and an attack on the lrpc cryptosystem"
    - "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:
    - "ranksign an efficient signature algorithm based on the rank metric"
    - "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.CC(Computational Complexity)