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 communication complexity of xor functions"
  Abstract: An XOR function is a function of the form g(x;y) = f(x y), for some boolean function f on n bits. We study the quantum and classical communication complexity of XOR functions. In the case of exact protocols, we completely characterise one-way communication complexity for all f. We also show that, when f is monotone, g’s quantum and classical complexities are quadratically related, and that when f is a linear threshold function, g’s quantum complexity is ( n). More generally, we make a structural conjecture about the Fourier spectra of boolean functions which, if true, would imply that the quantum and classical exact communication complexities of all XOR functions are asymptotically equivalent. We give two randomised classical protocols for general XOR functions which are ecient for certain functions, and a third protocol for linear threshold functions with high margin. These protocols operate in the symmetric message passing model with shared randomness.

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

Connected through hyperedge HE-4 (induced by source paper "on the degree of boolean functions as polynomials over mathbb z _m"):
  with members:
    - "a tighter bound on the number of relevant variables in a bounded degree boolean function"
    - "strong direct product theorems for quantum communication and query complexity"
    - "communication lower bounds using dual polynomials"

Connected through hyperedge HE-5 (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-6 (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"
    - "on the parity complexity measures of boolean functions"
    - "variations on the sensitivity conjecture"
    - "on quantum classical equivalence for composed communication problems"
    - "communication complexity lower bounds by polynomials"

Connected through hyperedge HE-7 (induced by source paper "optimality of linear sketching under modular updates"):
  with members:
    - "on estimating maximum matching size in graph streams"
    - "densest subgraph in dynamic graph streams"
    - "parity decision tree complexity and 4 party communication complexity of xor functions are polynomially equivalent"
    - "maximum matching in turnstile streams"
    - "semi streaming algorithms for annotated graph streams"

Connected through hyperedge HE-8 (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"

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)