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: "relative generalized hamming weights of one point algebraic geometric codes"
  Abstract: Security of linear ramp secret sharing schemes can be characterized by the relative generalized Hamming weights of the involved codes [26, 24]. In this paper we elaborate on the implication of these parameters and we devise a method to estimate their value for general one-point algebraic geometric codes. As it is demonstrated, for Hermitian codes our bound is often tight. Furthermore, for these codes the relative generalized Hamming weights are often much larger than the corresponding generalized Hamming weights.

Connected through hyperedge HE-1 (induced by source paper "on asymptotically good ramp secret sharing schemes"):
  with members:
    - "new lower bounds on the generalized hamming weights of ag codes"
    - "squares of random linear codes"
    - "new asymptotic metrics for relative generalized hamming weight"
    - "strongly secure ramp secret sharing schemes for general access structures"

Connected through hyperedge HE-2 (induced by source paper "improved constructions of nested code pairs"):
  with members:
    - "on the distance of stabilizer quantum codes from j affine variety codes"
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
    - "xing ling codes duals of their subcodes and good asymmetric quantum codes"
    - "quantum codes from affine variety codes and their subfield subcodes"
    - "new quantum codes from evaluation and matrix product codes"
    - "feng rao decoding of primary codes"
    - "css like constructions of asymmetric quantum codes"
    - "pure asymmetric quantum mds codes from css construction a complete characterization"

Connected through hyperedge HE-3 (induced by source paper "relative generalized matrix weights of matrix codes for universal security on wire tap networks"):
  with members:
    - "on defining generalized rank weights"
    - "unifying notions of generalized weights for universal security on wire tap networks"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "on the similarities between generalized rank and hamming weights and their applications to network coding"
    - "generalized weights an anticode approach"
    - "rank metric codes and their duality theory"
    - "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"
    - "generalized rank weights a duality statement"

Connected through hyperedge HE-4 (induced by source paper "unifying notions of generalized weights for universal security on wire tap networks"):
  with members:
    - "on defining generalized rank weights"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "on the similarities between generalized rank and hamming weights and their applications to network coding"
    - "generalized weights an anticode approach"
    - "rank metric codes and their duality theory"
    - "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"
    - "generalized rank weights a duality statement"
    - "universal secure network coding via rank metric codes"

Connected through hyperedge HE-5 (induced by source paper "fast algorithms for the computation of the minimum distance of a random linear code"):
  with members:
    - "decoding of matrix product codes"
    - "list decoding of matrix product codes from nested codes an application to quasi cyclic codes"
    - "new linear codes from matrix product codes with polynomial units"

Connected through hyperedge HE-6 (induced by source paper "communication efficient and strongly secure secret sharing schemes based on algebraic geometry codes"):
  with members:
    - "minimizing latency for secure distributed computing"
    - "staircase codes for secret sharing with optimal communication and read overheads"

Connected through hyperedge HE-7 (induced by source paper "on the similarities between generalized rank and hamming weights and their applications to network coding"):
  with members:
    - "on defining generalized rank weights"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "rank weight hierarchy of some classes of cyclic codes"
    - "generalized rank weights a duality statement"
    - "generalized rank weights duality and griesmer bound"
    - "universal secure network coding via rank metric codes"
    - "on metrics for error correction in network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-8 (induced by source paper "relative generalized hamming weights of cyclic codes"):
  with members:
    - "on asymptotically good ramp secret sharing schemes"
    - "the weight hierarchy of some reducible cyclic codes"
    - "relative generalized hamming weights of q ary reed muller codes"
    - "generalized hamming weights of irreducible cyclic codes"
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"
    - "the weight distribution of a class of cyclic codes related to hermitian forms graphs"
    - "a class of three weight cyclic codes"
    - "hamming weights in irreducible cyclic codes"

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)