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: "coding in the fork network in the framework of kolmogorov complexity"
  Abstract: Many statements from the classic information theory (the theory of Shannon's entropy) have natural counterparts in the algorithmic information theory (in the framework of Kolmogorov complexity). In this paper we discuss one simple instance of the parallelism between Shannon's and Kolmogorov's theories: we prove in the setting of Kolmogorov complexity a version of Wolf's characterization of admissible rates for the fork network.

Connected through hyperedge HE-1 (induced by source paper "universal almost optimal compression and slepian wolf coding in probabilistic polynomial time"):
  with members:
    - "kolmogorov complexity version of slepian wolf coding"
    - "short lists with short programs in short time"
    - "short lists with short programs in short time a short proof"
    - "linear list approximation for short programs or the power of a few random bits"
    - "short lists for shortest descriptions in short time"
    - "variations on muchnik s conditional complexity theorem"

Connected through hyperedge HE-2 (induced by source paper "distributed compression through the lens of algorithmic information theory a primer"):
  with members:
    - "kolmogorov complexity version of slepian wolf coding"

Connected through hyperedge HE-3 (induced by source paper "kolmogorov complexity version of slepian wolf coding"):
  with members:
    - "short lists with short programs in short time"
    - "short lists with short programs in short time a short proof"
    - "linear list approximation for short programs or the power of a few random bits"
    - "short lists for shortest descriptions in short time"
    - "complexity of complexity and strings with maximal plain and prefix kolmogorov complexity"
    - "variations on muchnik s conditional complexity theorem"

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)