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: "every locally characterized affine invariant property is testable"
  Abstract: Let F = F_p for any fixed prime p >= 2. An affine-invariant property is a property of functions on F^n that is closed under taking affine transformations of the domain. We prove that all affine-invariant property having local characterizations are testable. In fact, we show a proximity-oblivious test for any such property P, meaning that there is a test that, given an input function f, makes a constant number of queries to f, always accepts if f satisfies P, and rejects with positive probability if the distance between f and P is nonzero. More generally, we show that any affine-invariant property that is closed under taking restrictions to subspaces and has bounded complexity is testable. #R##N#We also prove that any property that can be described as the property of decomposing into a known structure of low-degree polynomials is locally characterized and is, hence, testable. For example, whether a function is a product of two degree-d polynomials, whether a function splits into a product of d linear polynomials, and whether a function has low rank are all examples of degree-structural properties and are therefore locally characterized. #R##N#Our results depend on a new Gowers inverse theorem by Tao and Ziegler for low characteristic fields that decomposes any polynomial with large Gowers norm into a function of low-degree non-classical polynomials. We establish a new equidistribution result for high rank non-classical polynomials that drives the proofs of both the testability results and the local characterization of degree-structural properties.

Connected through hyperedge HE-1 (induced by source paper "torus polynomials an algebraic approach to acc lower bounds"):
  with members:
    - "nonclassical polynomials as a barrier to polynomial lower bounds"

Connected through hyperedge HE-2 (induced by source paper "using higher order fourier analysis over general fields"):
  with members:
    - "a characterization of locally testable affine invariant properties via decomposition theorems"
    - "estimating the distance from testable affine invariant properties"
    - "algorithmic regularity for polynomials and applications"
    - "testing low complexity affine invariant properties"
    - "a unified framework for testing linear invariant properties"
    - "succinct representation of codes with applications to testing"

Connected through hyperedge HE-3 (induced by source paper "testing properties of functions on finite groups"):
  with members:
    - "a characterization of locally testable affine invariant properties via decomposition theorems"
    - "estimating the distance from testable affine invariant properties"
    - "testing low complexity affine invariant properties"
    - "partially symmetric functions are efficiently isomorphism testable"

Connected through hyperedge HE-4 (induced by source paper "bias vs structure of polynomials in large fields and applications in effective algebraic geometry and coding theory"):
  with members:
    - "using higher order fourier analysis over general fields"
    - "list decoding reed muller codes over small fields"
    - "algorithmic regularity for polynomials and applications"

Connected through hyperedge HE-5 (induced by source paper "gowers norm function limits and parameter estimation"):
  with members:
    - "bias vs structure of polynomials in large fields and applications in effective algebraic geometry and coding theory"
    - "using higher order fourier analysis over general fields"
    - "a characterization of locally testable affine invariant properties via decomposition theorems"
    - "list decoding reed muller codes over small fields"
    - "estimating the distance from testable affine invariant properties"
    - "testing low complexity affine invariant properties"
    - "a unified framework for testing linear invariant properties"

Connected through hyperedge HE-6 (induced by source paper "a characterization of locally testable affine invariant properties via decomposition theorems"):
  with members:
    - "estimating the distance from testable affine invariant properties"
    - "testing low complexity affine invariant properties"
    - "partially symmetric functions are efficiently isomorphism testable"
    - "a unified framework for testing linear invariant properties"

Connected through hyperedge HE-7 (induced by source paper "estimating the distance from testable affine invariant properties"):
  with members:
    - "testing low complexity affine invariant properties"
    - "a unified framework for testing linear invariant properties"

Connected through hyperedge HE-8 (induced by source paper "a unified framework for testing linear invariant properties"):
  with members:
    - "testing low complexity affine invariant properties"
    - "partially symmetric functions are efficiently isomorphism testable"
    - "separations of matroid freeness properties"
    - "succinct representation of codes with applications to testing"
    - "adaptive simulated annealing a near optimal connection between sampling and counting"

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)