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: "a polynomial time attack against algebraic geometry code based public key cryptosystems"
  Abstract: We give a polynomial time attack on the McEliece public key cryptosystem based on algebraic geometry codes. Roughly speaking, this attacks runs in $O(n^4)$ operations in $\mathbb F_q$, where $n$ denotes the code length. Compared to previous attacks, allows to recover a decoding algorithm for the public key even for codes from high genus curves.

Connected through hyperedge HE-1 (induced by source paper "mcnie a code based public key cryptosystem"):
  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-2 (induced by source paper "cryptanalysis of a public key encryption scheme based on qc ldpc and qc mdpc codes"):
  with members:
    - "worst case qc mdpc decoder for mceliece cryptosystem"
    - "quantum resistant random linear code based public key encryption scheme rlce"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "an efficient attack of a mceliece cryptosystem variant based on convolutional codes"

Connected through hyperedge HE-3 (induced by source paper "variations of the mceliece cryptosystem"):
  with members:
    - "soft mceliece mdpc code based mceliece cryptosystems with very compact keys through real valued intentional errors"
    - "spatially coupled ldpc codes constructed from protographs"
    - "a polynomial time attack on the bbcrs scheme"
    - "spatially coupled sparse codes on graphs theory and practice"
    - "cryptanalysis of public key cryptosystems that use subcodes of algebraic geometry codes"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "error correcting pairs for a public key cryptosystem"

Connected through hyperedge HE-4 (induced by source paper "algebraic properties of polar codes from a new polynomial formalism"):
  with members:
    - "the fractality of polar and reed muller codes"
    - "reed muller codes achieve capacity on erasure channels"
    - "reed muller codes achieve capacity on the binary erasure channel under map decoding"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "on products and powers of linear codes under componentwise multiplication"
    - "how to construct polar codes"
    - "performance and construction of polar codes on symmetric binary input memoryless channels"

Connected through hyperedge HE-5 (induced by source paper "a polynomial time attack on the bbcrs scheme"):
  with members:
    - "squares of random linear codes"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "error correcting pairs for a public key cryptosystem"
    - "enhanced public key security for the mceliece cryptosystem"

Connected through hyperedge HE-6 (induced by source paper "quantum resistant random linear code based public key encryption scheme rlce"):
  with members:
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "error correcting pairs for a public key cryptosystem"

Connected through hyperedge HE-7 (induced by source paper "polynomial time attack on wild mceliece over quadratic extensions"):
  with members:
    - "linear independence of rank 1 matrices and the dimension of products of codes"
    - "squares of random linear codes"
    - "a polynomial time attack on the bbcrs scheme"
    - "cryptanalysis of mceliece cryptosystem based on algebraic geometry codes and their subcodes"
    - "cryptanalysis of public key cryptosystems that use subcodes of algebraic geometry codes"
    - "folding alternant and goppa codes with non trivial automorphism groups"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "an efficient attack of a mceliece cryptosystem variant based on convolutional codes"

Connected through hyperedge HE-8 (induced by source paper "cryptanalysis of mceliece cryptosystem based on algebraic geometry codes and their subcodes"):
  with members:
    - "squares of random linear codes"
    - "a polynomial time attack on the bbcrs scheme"
    - "cryptanalysis of public key cryptosystems that use subcodes of algebraic geometry codes"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "feng rao decoding of primary codes"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "on products and powers of linear codes under componentwise multiplication"

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)