human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "polynomial invariant theory and shape enumerator of self dual codes in the nrt metric"):
  Abstract: In this paper we consider self-dual NRT-codes, that is, self-dual codes in the metric space endowed with the Niederreiter-Rosenbloom-Tsfasman (NRT-metric). We use polynomial invariant theory to describe the shape enumerator of a binary self-dual, doubly even self-dual, and doubly-doubly even self dual NRT-code $C\subseteq M_{n,2}(\mathbb{F}_{2})$. Motivated by these results we describe the number of invariant polinomials that we must find to describe the shape enumerator of a self-dual NRT-code of $M_{n,s}(\mathbb{F}_{2})$. We define the ordered flip of a matrix $A\in M_{k,ns}(\mathbb{F}_{q})$ and present some constructions of self-dual NRT-codes over $\mathbb{F}_{q}$. We further give an application of ordered flip to the classification of bidimensional self-dual NRT-codes.

Includes members:
  Member "a standard form for generator matrices with respect to the niederreiter rosenbloom tsfasman metric":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "canonical form of linear subspaces and coding invariants the poset metric point of view")
  Member "algebraic independence and blackbox identity testing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a generalized sylvester gallai type theorem for quadratic polynomials")
  Member "bounds on ordered codes and orthogonal arrays":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "linear codes on posets with extension property")

Question: Please tell me which class the source paper 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)