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 self dual mrd codes"
  Abstract: We determine the automorphism group of Gabidulin codes of full length and characterise when these codes are equivalent to self-dual codes.

Connected through hyperedge HE-1 (induced by source paper "partitions of matrix spaces with an application to q rook polynomials"):
  with members:
    - "a polymatroid approach to generalized weights of rank metric codes"
    - "rank metric codes and q polymatroids"
    - "maximal ferrers diagram codes constructions and genericity considerations"
    - "codes endowed with the rank metric"
    - "adversarial network coding"
    - "relative generalized matrix weights of matrix codes for universal security on wire tap networks"
    - "algebraic structures of mrd codes"
    - "duality of codes supported on regular lattices with an application to enumerative combinatorics"

Connected through hyperedge HE-2 (induced by source paper "on the list decodability of self orthogonal rank metric codes"):
  with members:
    - "on the list decodability of random linear rank metric codes"
    - "on the list decodability of random self orthogonal codes"
    - "bounds on list decoding of rank metric codes"
    - "bounds on list decoding gabidulin codes"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"
    - "packing and covering properties of rank metric codes"

Connected through hyperedge HE-3 (induced by source paper "on dually almost mrd codes"):
  with members:
    - "algebraic structures of mrd codes"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "rank weight hierarchy of some classes of cyclic codes"
    - "generalized weights an anticode approach"
    - "rank metric codes and their duality theory"
    - "generalized rank weights a duality statement"
    - "universal secure network coding via rank metric codes"
    - "on metrics for error correction in network coding"

Connected through hyperedge HE-4 (induced by source paper "how to obtain lattices from f sigma delta codes via a generalization of construction a"):
  with members:
    - "on skew polynomial codes and lattices from quotients of cyclic division algebras"
    - "information bit error rate and false positives in an mds code"
    - "finite nonassociative algebras obtained from twisted polynomials over chain rings"
    - "a note on linear codes and nonassociative algebras obtained from skew polynomial rings"
    - "the nonassociative algebras used to build fast decodable space time block codes"
    - "a circulant approach to skew constacyclic codes"
    - "quotients of orders in cyclic algebras and space time codes"
    - "iterated space time code constructions from cyclic algebras"

Connected through hyperedge HE-5 (induced by source paper "automorphism groups of gabidulin like codes"):
  with members:
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "rank metric codes and their duality theory"
    - "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-6 (induced by source paper "algebraic structures of mrd codes"):
  with members:
    - "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"
    - "good random matrices over finite fields"

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)