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 "the quadratic hull of a code and the geometric view on multiplication algorithms"):
  Abstract: We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by evaluation-interpolation at simple points (i.e. of degree and multiplicity 1) on a naturally associated space, namely the quadratic hull of the corresponding code. This also provides a geometric answer to some questions such as: which linear maps actually are multiplication algorithms, or which codes come from supercodes (as asked by Shparlinski-Tsfasman-Vladut). We illustrate this with examples, in particular we describe the quadratic hull of all the optimal algorithms computed by Barbulescu-Detrey-Estibals-Zimmermann for small algebras. #R##N#In our presentation we actually work with multiplication reductions. This is a generalization of multiplication algorithms, that allows for instance evaluation-interpolation at points of higher degree and/or with multiplicities, and also includes the recently introduced notion of "reverse multiplication-friendly embedding" from Cascudo-Cramer-Xing-Yang. All our results hold in this more general context.

Includes members:
  Member "distinguisher based attacks on public key cryptosystems using reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "encryption scheme based on expanded reed solomon codes")
  Member "on products and powers of linear codes under componentwise multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "squares of matrix product codes")
  Member "bilinear complexity of algebras and the chudnovsky chudnovsky interpolation method":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "squares of random linear codes")

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)