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 "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.

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 "squares of random linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "squares of matrix product codes")
  Member "relative generalized hamming weights of one point algebraic geometric codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "improved constructions of nested code pairs")
  Member "new asymptotic metrics for relative generalized hamming weight":
    also connected through other hyperedges:
      (none)
  Member "strongly secure ramp secret sharing schemes for general access structures":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secret sharing for cloud data security a survey")

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)