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: "tight bounds on communication complexity of symmetric xor functions in one way and smp models"
  Abstract: We study the communication complexity of symmetric XOR functions, namely functions f : {0, 1}n × {0, 1}n → {0, 1} that can be formulated as f(x, y) = D(|x ⊕ y|) for some predicate D : {0, 1, ..., n} → {0, 1}, where |x ⊕ y| is the Hamming weight of the bitwise XOR of x and y. We give a public-coin randomized protocol in the Simultaneous Message Passing (SMP) model, with the communication cost matching the known lower bound for the quantum and two-way model up to a logarithm factor. As a corollary, this closes a quadratic gap between the previous quantum lower bound and the randomized upper bound in the one-way model. This answers an open question raised in Shi and Zhang [SZ09], and disqualifies the problem from being a candidate to separate randomized and quantum one-way communication complexities.

Connected through hyperedge HE-1 (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-2 (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"
    - "on the parity complexity measures of boolean functions"
    - "on the communication complexity of xor functions"

Connected through hyperedge HE-3 (induced by source paper "efficient quantum protocols for xor functions"):
  with members:
    - "fourier sparsity spectral norm and the log rank conjecture"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "fourier sparsity spectral norm and the log rank conjecture"):
  with members:
    - "spectral norm of symmetric functions"
    - "an entropic proof of chang s inequality"
    - "on the parity complexity measures of boolean functions"
    - "on the communication complexity of xor functions"

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)