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 "subquadratic time encodable codes beating the gilbert varshamov bound"):
  Abstract: We construct explicit algebraic geometry codes built from the Garcia–Stichtenoth function-field tower beating the Gilbert–Varshamov bound for alphabet sizes at least 192. Messages are identified with functions in certain Riemann–Roch spaces associated with divisors supported on multiple places. Encoding amounts to evaluating these functions at degree-one places. By exploiting algebraic structures particular to the Garcia–Stichtenoth tower, we devise an intricate deterministic    $\omega /2    runtime exponent encoding and    $1+\omega /2    expected runtime exponent randomized (unique and list) decoding algorithms. Here    $\omega    is the matrix multiplication exponent. If    $\omega =2$   , as widely believed, the encoding and decoding runtimes are respectively nearly linear and nearly quadratic. Prior to this work, encoding time of code families beating the Gilbert–Varshamov bound were quadratic or worse.

Includes members:
  Member "on asymptotically good ramp secret sharing schemes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "relative generalized hamming weights of cyclic codes")
  Member "communication efficient and strongly secure secret sharing schemes based on algebraic geometry codes":
    also connected through other hyperedges:
      (none)
  Member "powers of tensors and fast matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")

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)