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: "on the parity complexity measures of boolean functions"
  Abstract: The parity decision tree model extends the decision tree model by allowing the computation of a parity function in one step. We prove that the deterministic parity decision tree complexity of any Boolean function is polynomially related to the non-deterministic complexity of the function or its complement. We also show that they are polynomially related to an analogue of the block sensitivity. We further study parity decision trees in their relations with an intermediate variant of the decision trees, as well as with communication complexity.

Connected through hyperedge HE-1 (induced by source paper "approximate mathbb f _2 sketching of valuation functions"):
  with members:
    - "optimality of linear sketching under modular updates"
    - "optimal lower bounds for universal relation and for samplers and finding duplicates in streams"
    - "testing submodularity and other properties of valuation functions"
    - "almost optimal streaming algorithms for coverage problems"
    - "tight bounds for single pass streaming complexity of the set cover problem"
    - "towards tight bounds for the streaming set cover problem"
    - "streaming algorithms for submodular function maximization"
    - "incidence geometries and the pass complexity of semi streaming set cover"

Connected through hyperedge HE-2 (induced by source paper "alternation sparsity and sensitivity bounds and exponential gaps"):
  with members:
    - "on the sensitivity conjecture for disjunctive normal forms"
    - "sensitivity conjecture and log rank conjecture for functions with small alternating numbers"
    - "degree and sensitivity tails of two distributions"
    - "sensitivity versus certificate complexity of boolean functions"
    - "analysis of boolean functions"
    - "learning circuits with few negations"
    - "communication is bounded by root of rank"
    - "fourier sparsity spectral norm and the log rank conjecture"

Connected through hyperedge HE-3 (induced by source paper "fast fourier sparsity testing"):
  with members:
    - "robust estimators in high dimensions without the computational intractability"
    - "analysis of boolean functions"
    - "estimating the distance from testable affine invariant properties"
    - "fourier sparsity spectral norm and the log rank conjecture"
    - "on the structure of boolean functions with small spectral norm"
    - "nearly optimal sparse fourier transform"
    - "on the communication complexity of xor functions"

Connected through hyperedge HE-4 (induced by source paper "sensitivity affine transforms and quantum communication complexity"):
  with members:
    - "sensitivity conjecture and log rank conjecture for functions with small alternating numbers"
    - "degree and sensitivity tails of two distributions"
    - "analysis of boolean functions"
    - "variations on the sensitivity conjecture"
    - "on quantum classical equivalence for composed communication problems"
    - "on the communication complexity of xor functions"
    - "communication complexity lower bounds by polynomials"

Connected through hyperedge HE-5 (induced by source paper "linear sketching over mathbb f_2"):
  with members:
    - "an inequality for the fourier spectrum of parity decision trees"
    - "analysis of boolean functions"
    - "a composition theorem for parity kill number"
    - "improved bounds for the randomized decision tree complexity of recursive majority"
    - "on the structure of boolean functions with small spectral norm"
    - "on the communication complexity of xor functions"

Connected through hyperedge HE-6 (induced by source paper "an inequality for the fourier spectrum of parity decision trees"):
  with members:
    - "a composition theorem for parity kill number"
    - "improved bounds for the randomized decision tree complexity of recursive majority"
    - "on the structure of boolean functions with small spectral norm"
    - "open problems in analysis of boolean functions"

Connected through hyperedge HE-7 (induced by source paper "recent advances on the log rank conjecture in communication complexity"):
  with members:
    - "communication is bounded by root of rank"
    - "efficient quantum protocols for xor functions"
    - "tight bounds on communication complexity of symmetric xor functions in one way and smp models"
    - "on the communication complexity of xor functions"

Connected through hyperedge HE-8 (induced by source paper "a composition theorem for parity kill number"):
  with members:
    - "analysis of boolean functions"
    - "two structural results for low degree polynomials and applications"
    - "communication is bounded by root of rank"
    - "on the structure of boolean functions with small spectral norm"
    - "variations on the sensitivity conjecture"
    - "on the communication complexity of xor functions"
    - "every decision tree has an influential variable"

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)