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: "measuring communication complexity using instance complexity with oracles"
  Abstract: Abstract—We establish a connection between non-deterministiccommunication complexity and instance complexity, a measureof information based on algorithmic entropy. Let x, y and Y 1 (x)be respectively the input known by Alice, the input known byBob, and the set of all values of y such that f(x,y) = 1; a stringis a witness of the non-deterministic communication protocol iffit is a program p that “corresponds exactly” to the instancecomplexity ic f,t (y : Y 1 (x)). I. I NTRODUCTION In a general scenario of communication complexity there aretwo parties, Alice and Bob, and the goal is to ﬁnd the minimalquantity of information, measured in number of bits, thatthey must exchange in order to compute the value of a givenfunction of their inputs, f : X × Y → {0,1}. The instancecomplexity ic O,t (x : A), is a rigorous measure of information,based on algorithmic entropy, is the length of the shortestprogram with access to the oracle O that, in time t,1) answers correctly the question “x ∈ A?”;2) does not “lie” about the set A(the program may howeveranswer “I don’t know” by outputting ⊥).Thus, the communication complexity measures the communi-cation costs while instance complexity is related with compu-tational complexity. The objective of this paper is to establish arelationship between these two apparently unrelated measuresof complexity.Let x and y be the inputs of size n of Alice and Bobrespectively. Consider Y

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)