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: "fourier sparsity spectral norm and the log rank conjecture"
  Abstract: We study Boolean functions with sparse Fourier coefficients or small spectral norm, and show their applications to the Log-rank Conjecture for XOR functions f(x\oplus y) --- a fairly large class of functions including well studied ones such as Equality and Hamming Distance. The rank of the communication matrix M_f for such functions is exactly the Fourier sparsity of f. Let d be the F2-degree of f and D^CC(f) stand for the deterministic communication complexity for f(x\oplus y). We show that 1. D^CC(f) = O(2^{d^2/2} log^{d-2} ||\hat f||_1). In particular, the Log-rank conjecture holds for XOR functions with constant F2-degree. 2. D^CC(f) = O(d ||\hat f||_1) = O(\sqrt{rank(M_f)}\logrank(M_f)). We obtain our results through a degree-reduction protocol based on a variant of polynomial rank, and actually conjecture that its communication cost is already \log^{O(1)}rank(M_f). The above bounds also hold for the parity decision tree complexity of f, a measure that is no less than the communication complexity (up to a factor of 2). #R##N#Along the way we also show several structural results about Boolean functions with small F2-degree or small spectral norm, which could be of independent interest. For functions f with constant F2-degree: 1) f can be written as the summation of quasi-polynomially many indicator functions of subspaces with \pm-signs, improving the previous doubly exponential upper bound by Green and Sanders; 2) being sparse in Fourier domain is polynomially equivalent to having a small parity decision tree complexity; 3) f depends only on polylog||\hat f||_1 linear functions of input variables. For functions f with small spectral norm: 1) there is an affine subspace with co-dimension O(||\hat f||_1) on which f is a constant; 2) there is a parity decision tree with depth O(||\hat f||_1 log ||\hat f||_0).

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"
    - "on the parity complexity measures of boolean functions"

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"
    - "on the structure of boolean functions with small spectral norm"
    - "nearly optimal sparse fourier transform"
    - "on the parity complexity measures of boolean functions"
    - "on the communication complexity of xor functions"

Connected through hyperedge HE-4 (induced by source paper "improved bounds on fourier entropy and min entropy"):
  with members:
    - "on the fourier entropy influence conjecture for extremal classes"
    - "improved lower bounds for the fourier entropy influence conjecture via lexicographic functions"
    - "nearly optimal separations between communication or query complexity and partitions"
    - "low sensitivity functions from unambiguous certificates"
    - "degree and sensitivity tails of two distributions"
    - "polynomial bounds for decoupling with applications"
    - "almost quadratic gap between partition complexity and query communication complexity"
    - "analysis of boolean functions"

Connected through hyperedge HE-5 (induced by source paper "sensitivity conjecture and log rank conjecture for functions with small alternating numbers"):
  with members:
    - "smooth boolean functions are easy efficient algorithms for low sensitivity functions"
    - "sensitivity versus certificate complexity of boolean functions"
    - "size of sets with small sensitivity a generalization of simon s lemma"
    - "parity decision tree complexity and 4 party communication complexity of xor functions are polynomially equivalent"
    - "tighter relations between sensitivity and other complexity measures"
    - "learning circuits with few negations"
    - "a composition theorem for parity kill number"
    - "communication is bounded by root of rank"

Connected through hyperedge HE-6 (induced by source paper "pseudorandomness and fourier growth bounds for width 3 branching programs"):
  with members:
    - "pseudorandomness for regular branching programs via fourier analysis"
    - "on the structure of boolean functions with small spectral norm"
    - "spectral norm of symmetric functions"
    - "better pseudorandom generators from milder pseudorandom restrictions"

Connected through hyperedge HE-7 (induced by source paper "sub linear upper bounds on fourier dimension of boolean functions in terms of fourier sparsity"):
  with members:
    - "analysis of boolean functions"
    - "on the structure of boolean functions with small spectral norm"

Connected through hyperedge HE-8 (induced by source paper "efficient quantum protocols for xor functions"):
  with members:
    - "tight bounds on communication complexity of symmetric xor functions in one way and smp models"
    - "on the parity complexity measures of boolean functions"
    - "an optimal lower bound on the communication complexity of gap hamming distance"
    - "on the communication complexity of xor functions"
    - "communication complexity lower bounds by polynomials"

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)