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: "extracting the kolmogorov complexity of strings and sequences from sources with limited independence"
  Abstract: An infinite binary sequence has randomness rate at least $\sigma$ if, for almost every $n$, the Kolmogorov complexity of its prefix of length $n$ is at least $\sigma n$. It is known that for every rational $\sigma \in (0,1)$, on one hand, there exists sequences with randomness rate $\sigma$ that can not be effectively transformed into a sequence with randomness rate higher than $\sigma$ and, on the other hand, any two independent sequences with randomness rate $\sigma$ can be transformed into a sequence with randomness rate higher than $\sigma$. We show that the latter result holds even if the two input sequences have linear dependency (which, informally speaking, means that all prefixes of length $n$ of the two sequences have in common a constant fraction of their information). The similar problem is studied for finite strings. It is shown that from any two strings with sufficiently large Kolmogorov complexity and sufficiently small dependence, one can effectively construct a string that is random even conditioned by any one of the input strings.

Connected through hyperedge HE-1 (induced by source paper "space bounded kolmogorov extractors"):
  with members:
    - "possibilities and impossibilities in kolmogorov complexity extraction"
    - "symmetry of information and bounds on nonuniform randomness extraction via kolmogorov extractors"
    - "on the optimal compression of sets in pspace"
    - "pseudo random graphs and bit probe schemes with one sided error"
    - "impossibility of independence amplification in kolmogorov complexity theory"
    - "improving the space bounded version of muchnik s conditional complexity theorem via naive derandomization"
    - "two sources are better than one for increasing the kolmogorov complexity of infinite sequences"

Connected through hyperedge HE-2 (induced by source paper "symmetry of information a closer look"):
  with members:
    - "possibilities and impossibilities in kolmogorov complexity extraction"
    - "symmetry of information and bounds on nonuniform randomness extraction via kolmogorov extractors"
    - "counting dependent and independent strings"

Connected through hyperedge HE-3 (induced by source paper "possibilities and impossibilities in kolmogorov complexity extraction"):
  with members:
    - "counting dependent and independent strings"
    - "impossibility of independence amplification in kolmogorov complexity theory"
    - "algorithmically independent sequences"
    - "two sources are better than one for increasing the kolmogorov complexity of infinite sequences"
    - "constructive dimension and turing degrees"
    - "dimension extractors and optimal decompression"

Connected through hyperedge HE-4 (induced by source paper "improving the space bounded version of muchnik s conditional complexity theorem via naive derandomization"):
  with members:
    - "space bounded kolmogorov extractors"
    - "symmetry of information and bounds on nonuniform randomness extraction via kolmogorov extractors"
    - "on the optimal compression of sets in pspace"
    - "pseudo random graphs and bit probe schemes with one sided error"
    - "impossibility of independence amplification in kolmogorov complexity theory"
    - "variations on muchnik s conditional complexity theorem"

Connected through hyperedge HE-5 (induced by source paper "counting dependent and independent strings"):
  with members:
    - "possibilities and impossibilities in kolmogorov complexity extraction"
    - "impossibility of independence amplification in kolmogorov complexity theory"
    - "on generating independent random strings"
    - "two sources are better than one for increasing the kolmogorov complexity of infinite sequences"

Connected through hyperedge HE-6 (induced by source paper "impossibility of independence amplification in kolmogorov complexity theory"):
  with members:
    - "on generating independent random strings"
    - "two sources are better than one for increasing the kolmogorov complexity of infinite sequences"
    - "constructive dimension and turing degrees"

Connected through hyperedge HE-7 (induced by source paper "on generating independent random strings"):
  with members:
    - "algorithmically independent sequences"
    - "two sources are better than one for increasing the kolmogorov complexity of infinite sequences"

Connected through hyperedge HE-8 (induced by source paper "two sources are better than one for increasing the kolmogorov complexity of infinite sequences"):
  with members:
    - "algorithmically independent sequences"
    - "constructive dimension and turing degrees"
    - "dimension extractors and optimal decompression"
    - "the dimensions of individual strings and sequences"

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)