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: "duursma s reduced polynomial"
  Abstract: The weight distribution of a linear code C is put in an explicit bijective correspondence with Duursma's reduced polynomial of C. We prove that the Riemann Hypothesis Analogue for a linear code C requires the formal self-duality of C and imposes an upper bound on the cardinality q of the basic field, depending on the dimension and the minimum distance of C. #R##N#Duursma's reduced polynomial of the function field of a curve X of genus g over the field with q elements is shown to provide a generating function for the numbers of the effective divisors of non-negative degree degree of a virtual function field of a curve of genus g-1 over the same finite field.

Connected through hyperedge HE-1 (induced by source paper "mac williams identities and polarized riemann roch conditions"):
  with members:
    - "fourier reflexive partitions and macwilliams identities for additive codes"
    - "the partition weight enumerator of mds codes and its applications"

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)