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: "every sequence is decompressible from a random one"
  Abstract: Kucera and Gacs independently showed that every infinite sequence is Turing reducible to a Martin-Lof random sequence. This result is extended by showing that every infinite sequence S is Turing reducible to a Martin-Lof random sequence R such that the asymptotic number of bits of R needed to compute n bits of S, divided by n, is precisely the constructive dimension of S. It is shown that this is the optimal ratio of query bits to computed bits achievable with Turing reductions. As an application of this result, a new characterization of constructive dimension is given in terms of Turing reduction compression ratios.

Connected through hyperedge HE-1 (induced by source paper "compression of data streams down to their information content"):
  with members:
    - "forbidden information"
    - "lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers"
    - "short lists with short programs in short time"
    - "linear list approximation for short programs or the power of a few random bits"
    - "short lists for shortest descriptions in short time"
    - "some theorems on the algorithmic approach to probability theory and information theory"
    - "dimension extractors and optimal decompression"

Connected through hyperedge HE-2 (induced by source paper "lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers"):
  with members:
    - "optimal redundancy in computations from random oracles"
    - "integer valued betting strategies and turing degrees"
    - "how to gamble against all odds"
    - "how powerful are integer valued martingales"

Connected through hyperedge HE-3 (induced by source paper "optimal redundancy in computations from random oracles"):
  with members:
    - "forbidden information"
    - "lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers"

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

Connected through hyperedge HE-5 (induced by source paper "dimension extractors and optimal decompression"):
  with members:
    - "finite state dimension and lossy decompressors"
    - "effective strong dimension algorithmic information and computational complexity"
    - "gales suffice for constructive dimension"
    - "dimension in complexity classes"
    - "the dimensions of individual strings and sequences"
    - "gales and supergales are equivalent for defining constructive hausdorff dimension"

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.IT(Information Theory)