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: "twisted reed solomon codes"
  Abstract: We present a new general construction of MDS codes over a finite field $\mathbb{F}_q$. We describe two explicit subclasses which contain new MDS codes of length at least $q/2$ for all values of $q \ge 11$. Moreover, we show that most of the new codes are not equivalent to a Reed--Solomon code.

Connected through hyperedge HE-1 (induced by source paper "cryptanalysis of a system based on twisted reed solomon codes"):
  with members:
    - "twisted gabidulin codes in the gpt cryptosystem"
    - "structural properties of twisted reed solomon codes with applications to cryptography"
    - "recovering short secret keys of rlce in polynomial time"
    - "an efficient structural attack on nist submission dags"
    - "quantum resistant random linear code based public key encryption scheme rlce"
    - "cryptanalysis of mceliece cryptosystem based on algebraic geometry codes and their subcodes"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"

Connected through hyperedge HE-2 (induced by source paper "structural properties of twisted reed solomon codes with applications to cryptography"):
  with members:
    - "fast computation of the roots of polynomials over the ring of power series"
    - "squares of random linear codes"
    - "faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "on products and powers of linear codes under componentwise multiplication"
    - "key reduction of mceliece s cryptosystem using list decoding"

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)