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: "subspace evasive sets"
  Abstract: In this work we describe an explicit, simple, construction of large subsets of F^n, where F is a finite field, that have small intersection with every k-dimensional affine subspace. Interest in the explicit construction of such sets, termed subspace-evasive sets, started in the work of Pudlak and Rodl (2004) who showed how such constructions over the binary field can be used to construct explicit Ramsey graphs. More recently, Guruswami (2011) showed that, over large finite fields (of size polynomial in n), subspace evasive sets can be used to obtain explicit list-decodable codes with optimal rate and constant list-size. In this work we construct subspace evasive sets over large fields and use them to reduce the list size of folded Reed-Solomon codes form poly(n) to a constant.

Connected through hyperedge HE-1 (induced by source paper "beyond the guruswami sudan and parvaresh vardy radii folded reed solomon multiplicity and derivative codes"):
  with members:
    - "some remarks on multiplicity codes"
    - "linear algebraic list decoding of folded reed solomon codes"
    - "optimal rate list decoding via derivative codes"
    - "folded algebraic geometric codes from galois extensions"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-2 (induced by source paper "ldpc codes achieve list decoding capacity"):
  with members:
    - "improved list decodability of random linear binary codes"
    - "improved decoding of folded reed solomon and multiplicity codes"
    - "linear time list recovery of high rate expander codes"
    - "analysis of boolean functions"
    - "every list decodable code for high noise has abundant near optimal rate puncturings"
    - "on the list decodability of random linear codes with large error rates"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "folded codes from function field towers and improved optimal rate list decoding"

Connected through hyperedge HE-3 (induced by source paper "improved list decodability of random linear binary codes"):
  with members:
    - "on the list decodability of random linear rank metric codes"
    - "linear time list recovery of high rate expander codes"
    - "it ll probably work out improved list decoding through random operations"
    - "optimal locally repairable codes via rank metric codes"
    - "bounds on list decoding of rank metric codes"
    - "every list decodable code for high noise has abundant near optimal rate puncturings"
    - "on the list decodability of random linear codes with large error rates"
    - "error resilience in distributed storage via rank metric codes"

Connected through hyperedge HE-4 (induced by source paper "improved decoding of folded reed solomon and multiplicity codes"):
  with members:
    - "average radius list recovery of random linear codes it really ties the room together"
    - "linear time list recovery of high rate expander codes"
    - "high rate locally correctable and locally testable codes with sub polynomial query complexity"
    - "list decoding algorithms for lifted codes"
    - "folded codes from function field towers and improved optimal rate list decoding"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-5 (induced by source paper "optimal rate list decoding over bounded alphabets using algebraic geometric codes"):
  with members:
    - "linear algebraic list decoding of folded reed solomon codes"

Connected through hyperedge HE-6 (induced by source paper "a new class of rank metric codes and their list decoding beyond the unique decoding radius"):
  with members:
    - "some gabidulin codes cannot be list decoded efficiently at any radius"
    - "list and unique error erasure decoding of interleaved gabidulin codes with interpolation techniques"
    - "bounds on list decoding of rank metric codes"
    - "list decoding subspace codes from insertions and deletions"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"
    - "folded codes from function field towers and improved optimal rate list decoding"
    - "on identity testing of tensors low rank recovery and compressed sensing"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"

Connected through hyperedge HE-7 (induced by source paper "linear time list recovery of high rate expander codes"):
  with members:
    - "local correctability of expander codes"
    - "folded codes from function field towers and improved optimal rate list decoding"
    - "linear algebraic list decoding of folded reed solomon codes"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"
    - "distance properties of expander codes"

Connected through hyperedge HE-8 (induced by source paper "dimension expanders via rank condensers"):
  with members:
    - "deterministic truncation of linear matroids"
    - "explicit rank metric codes list decodable with optimal redundancy"
    - "pseudorandomness for multilinear read once algebraic branching programs in any order"
    - "folded codes from function field towers and improved optimal rate list decoding"
    - "on identity testing of tensors low rank recovery and compressed sensing"
    - "quasi polynomial hitting set for set depth delta formulas"
    - "fast matrix rank algorithms and applications"
    - "linear algebraic list decoding of folded reed solomon 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.CC(Computational Complexity)