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 "isometry dual flags of ag codes"):
  Abstract: Consider a complete flag $\{0\} = C_0   2g+2$ rational points is isometry-dual if and only if the last code $C_n$ in the flag is defined with functions of pole order at most $n+2g-1$. Using a different approach, we extend this characterization to all subsets of size $n \geq 2g+2$. Moreover we show that this is best possible by giving examples of isometry-dual flags with $n=2g+1$ such that $C_n$ is generated by functions of pole order at most $n+2g-2$. We also prove a necessary condition, formulated in terms of maximum sparse ideals of the Weierstrass semigroup of $Q$, under which a flag of punctured one-point AG codes inherits the isometry-dual property from the original unpunctured flag.

Includes members:
  Member "new lower bounds on the generalized hamming weights of ag codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "weight distributions and weight hierarchies of two classes of binary linear codes")
  Member "on the order bounds for one point ag codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "vard o hus codes polar codes based on castle curves kernels")

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)