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: "communication is bounded by root of rank"
  Abstract: We prove that any total boolean function of rank $r$ can be computed by a deterministic communication protocol of complexity $O(\sqrt{r} \cdot \log(r))$. Equivalently, any graph whose adjacency matrix has rank $r$ has chromatic number at most $2^{O(\sqrt{r} \cdot \log(r))}$. This gives a nearly quadratic improvement in the dependence on the rank over previous results.

Connected through hyperedge HE-1 (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"
    - "fourier sparsity spectral norm and the log rank conjecture"
    - "on the parity complexity measures of boolean functions"

Connected through hyperedge HE-2 (induced by source paper "theory and practice of data citation"):
  with members:
    - "the challenge and promise of software citation for credit identification discovery and reuse"
    - "new model for datasets citation and extraction reproducibility in vamdc"
    - "analyzing data citation practices using the data citation index"
    - "micropublications a semantic model for claims evidence arguments and annotations in biomedical communications"

Connected through hyperedge HE-3 (induced by source paper "a general private information retrieval scheme for mds coded databases with colluding servers"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "nearly optimal constructions of pir and batch codes"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "private information retrieval schemes for coded data with arbitrary collusion patterns"
    - "multi message private information retrieval capacity results and near optimal schemes"
    - "binary shortened projective reed muller codes for coded private information retrieval"
    - "pir array codes with optimal virtual server rate"
    - "multiround private information retrieval capacity and storage overhead"

Connected through hyperedge HE-4 (induced by source paper "the augmentation property of binary matrices for the binary and boolean rank"):
  with members:
    - "nonnegative rank vs binary rank"

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"
    - "fourier sparsity spectral norm and the log rank conjecture"

Connected through hyperedge HE-6 (induced by source paper "nonnegative rank vs binary rank"):
  with members:
    - "nearly optimal separations between communication or query complexity and partitions"
    - "ordered biclique partitions and communication complexity problems"

Connected through hyperedge HE-7 (induced by source paper "fourier sparsity of gf 2 polynomials"):
  with members:
    - "on the structure of boolean functions with small spectral norm"
    - "spectral norm of symmetric functions"
    - "on the communication complexity of xor functions"

Connected through hyperedge HE-8 (induced by source paper "the corruption bound log rank and communication complexity"):
  with members:
    - "lower bounds on information complexity via zero communication protocols and applications"
    - "the partition bound for classical communication complexity and query complexity"
    - "rectangle size bounds and threshold covers in communication complexity"
    - "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)