human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "an information spectrum approach to weak variable length source coding with side information"):
  Abstract: This paper studies variable-length (VL) source coding of general sources with side-information. Novel one-shot coding theorems for coding with common side-information available at the encoder and the decoder and Slepian- Wolf (SW) coding (i.e., with side-information only at the decoder) are given, and then, are applied to asymptotic analyses of these coding problems. Especially, a general formula for the infimum of the coding rate asymptotically achievable by weak VL-SW coding (i.e., VL-SW coding with vanishing error probability) is derived. Further, the general formula is applied to investigating weak VL-SW coding of mixed sources. Our results derive and extend several known results on SW coding and weak VL coding, e.g., the optimal achievable rate of VL-SW coding for mixture of i.i.d. sources is given for countably infinite alphabet case with mild condition. In addition, the usefulness of the encoder side-information is investigated. Our result shows that if the encoder side-information is useless in weak VL coding then it is also useless even in the case where the error probability may be positive asymptotically.

Includes members:
  Member "on the reliability function of variable rate slepian wolf coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the reliability function of distributed hypothesis testing under optimal detection")
  Member "on the dispersions of three network information theory problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "gaussian multiple and random access in the finite blocklength regime")
  Member "variable length compression allowing errors extended":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the conditional smooth renyi entropy and its applications in guessing and source coding")
  Member "variable length compression allowing errors":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "asymptotic expansions of smooth r e nyi entropies and their applications")
  Member "optimum trade offs between the error exponent and the excess rate exponent of variable rate slepian wolf coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the reliability function of distributed hypothesis testing under optimal detection")
  Member "universal wyner ziv coding for distortion constrained general side information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "coding for arbitrarily varying remote sources")
  Member "second order slepian wolf coding theorems for non mixed and mixed sources":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lossless source coding in the point to point multiple access and random access scenarios")
  Member "second order asymptotics in fixed length source coding and intrinsic randomness":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "finite sample analysis of image registration")

Question: Please tell me which class the source paper 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)