human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "recent advances on the log rank conjecture in communication complexity"):
  Abstract: The log-rank conjecture is one of the fundamental open problems in communication complexity. It speculates that the deterministic communication complexity of any two-party function is equal to the log of the rank of its associated matrix, up to polynomial factors. Despite much research, we still know very little about this conjecture. Recently, there has been renewed interest in this conjecture and its relations to other fundamental problems in complexity theory. This survey describes some of the recent progress, and hints at potential directions for future research.

Includes members:
  Member "communication is bounded by root of rank":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "alternation sparsity and sensitivity bounds and exponential gaps")
  Member "efficient quantum protocols for xor functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improved bounds on fourier entropy and min entropy")
  Member "tight bounds on communication complexity of symmetric xor functions in one way and smp models":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sensitivity conjecture and log rank conjecture for functions with small alternating numbers")
  Member "on the parity complexity measures of boolean functions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "approximate mathbb f _2 sketching of valuation functions")
  Member "on the communication complexity of xor functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximate mathbb f _2 sketching of valuation functions")

Question: Please tell me which class the source paper 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)