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 asymptotically good ramp secret sharing schemes"
  Abstract: We coin the term of asymptotically good sequences of ramp secret sharing schemes. These are sequences such that when the number of participants goes to infinity, the information rate approaches some fixed positive number while the worst case information leakage of a fixed fraction of information, relative to the number of participants, attains another fixed number. A third fixed positive number describes the ratio of participants that are guaranteed to be able to recover all – or almost all – of the secret. By a non-constructive proof we demonstrate the existence of asymptotically good sequences of schemes with parameters arbitrarily close to the optimal ones. Moreover, we demonstrate how to concretely construct asymptotically good sequences of schemes from sequences of algebraic geometric codes related to a tower of function fields. Our study involves a detailed treatment of the relative generalized Hamming weights of the involved codes.

Connected through hyperedge HE-1 (induced by source paper "subquadratic time encodable codes beating the gilbert varshamov bound"):
  with members:
    - "communication efficient and strongly secure secret sharing schemes based on algebraic geometry codes"
    - "powers of tensors and fast matrix multiplication"

Connected through hyperedge HE-2 (induced by source paper "relative generalized hamming weights of cyclic codes"):
  with members:
    - "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"
    - "relative generalized hamming weights of one point algebraic geometric 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"

Connected through hyperedge HE-3 (induced by source paper "refined analysis of rghws of code pairs coming from garcia stichtenoth s second tower"):
  with members:
    - "relative generalized hamming weights of one point algebraic geometric codes"

Connected through hyperedge HE-4 (induced by source paper "relative generalized hamming weights of q ary reed muller codes"):
  with members:
    - "relative generalized hamming weights of cyclic codes"
    - "refined analysis of rghws of code pairs coming from garcia stichtenoth s second tower"
    - "relative generalized hamming weights of one point algebraic geometric codes"
    - "feng rao decoding of primary 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)