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: "disjointness is hard in the multi party number on the forehead model"
  Abstract: We show that disjointness requires randomized communication Omega(n^{1/(k+1)}/2^{2^k}) in the general k-party number-on-the-forehead model of complexity. The previous best lower bound for k >= 3 was log(n)/(k-1). Our results give a separation between nondeterministic and randomized multiparty number-on-the-forehead communication complexity for up to k=log log n - O(log log log n) many players. Also by a reduction of Beame, Pitassi, and Segerlind, these results imply subexponential lower bounds on the size of proofs needed to refute certain unsatisfiable CNFs in a broad class of proof systems, including tree-like Lovasz-Schrijver proofs.

Connected through hyperedge HE-1 (induced by source paper "hardness amplification and the approximate degree of constant depth circuits"):
  with members:
    - "distribution independent reliable learning"
    - "dual lower bounds for approximate degree and markov bernstein inequalities"
    - "on arthur merlin games in communication complexity"
    - "a separation of np and conp in multiparty communication complexity"
    - "strong direct product theorems for quantum communication and query complexity"
    - "the intersection of two halfspaces has high threshold degree"
    - "a note on the sign degree of formulas"
    - "optimal bounds for sign representing the intersection of two halfspaces by polynomials"

Connected through hyperedge HE-2 (induced by source paper "dual lower bounds for approximate degree and markov bernstein inequalities"):
  with members:
    - "hardness amplification and the approximate degree of constant depth circuits"
    - "open problems in analysis of boolean functions"
    - "a separation of np and conp in multiparty communication complexity"
    - "the intersection of two halfspaces has high threshold degree"
    - "multiparty communication complexity of disjointness"
    - "a dual polynomial for or"
    - "communication lower bounds using dual polynomials"

Connected through hyperedge HE-3 (induced by source paper "tensor rank and strong quantum nondeterminism in multiparty communication"):
  with members:
    - "tensor rank some lower and upper bounds"
    - "a separation of np and conp in multiparty communication complexity"
    - "nondeterministic quantum query and quantum communication complexities"
    - "communication complexity lower bounds by polynomials"

Connected through hyperedge HE-4 (induced by source paper "a separation of np and conp in multiparty communication complexity"):
  with members:
    - "multiparty communication complexity of disjointness"
    - "separating nof communication complexity classes rp and np"
    - "communication lower bounds using dual polynomials"
    - "rectangle size bounds and threshold covers in communication complexity"

Connected through hyperedge HE-5 (induced by source paper "hardness amplification in proof complexity"):
  with members:
    - "the pattern matrix method journal version"
    - "multiparty communication complexity of disjointness"

Connected through hyperedge HE-6 (induced by source paper "better gap hamming lower bounds via better round elimination"):
  with members:
    - "an optimal lower bound on the communication complexity of gap hamming distance"
    - "a multi round communication lower bound for gap hamming and some consequences"

Connected through hyperedge HE-7 (induced by source paper "communication lower bounds using dual polynomials"):
  with members:
    - "multiparty communication complexity of disjointness"
    - "separating nof communication complexity classes rp and np"
    - "communication complexity lower bounds by polynomials"
    - "bounds for small error and zero error quantum algorithms"

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)