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: "using ldgm codes and sparse syndromes to achieve digital signatures"
  Abstract: In this paper, we address the problem of achieving efficient code-based digital signatures with small public keys. The solution we propose exploits sparse syndromes and randomly designed low-density generator matrix codes. Based on our evaluations, the proposed scheme is able to outperform existing solutions, permitting to achieve considerable security levels with very small public keys.

Connected through hyperedge HE-1 (induced by source paper "wave a new family of trapdoor one way preimage sampleable functions based on codes"):
  with members:
    - "ternary syndrome decoding with large weight"
    - "two attacks on rank metric code based schemes ranksign and an identity based encryption scheme"
    - "the problem with the surf scheme"

Connected through hyperedge HE-2 (induced by source paper "wave a new code based signature scheme"):
  with members:
    - "ternary syndrome decoding with large weight"
    - "the problem with the surf scheme"

Connected through hyperedge HE-3 (induced by source paper "cryptanalysis of a one time code based digital signature scheme"):
  with members:
    - "design and implementation of a digital signature scheme based on low density generator matrix codes"

Connected through hyperedge HE-4 (induced by source paper "design and implementation of a digital signature scheme based on low density generator matrix codes"):
  with members:
    - "optimization of the parity check matrix density in qc ldpc code based mceliece cryptosystems"

Connected through hyperedge HE-5 (induced by source paper "the problem with the surf scheme"):
  with members:
    - "quantum information set decoding algorithms"
    - "code based cryptosystems using generalized concatenated codes"
    - "on the complexity of the rank syndrome decoding problem"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-6 (induced by source paper "a new signature scheme based on punctured reed muller code with random insertion"):
  with members:
    - "recursive decoding and its performance for low rate reed muller 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.CR(Cryptography and Security)