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 "overflow probability of variable length codes with codeword cost"):
  Abstract: Lossless variable-length source coding with codeword cost is considered for general sources. The problem setting, where we impose on unequal costs on code symbols, is called the variable-length coding with codeword cost. In this problem, the infimum of average codeword cost have been determined for general sources. On the other hand, overflow probability, which is defined as the probability of codeword cost being above a threshold, have not been considered yet. In this paper, we determine the infimum of achievable threshold in the first-order sense and the second-order sense for general sources and compute it for some special sources such as i.i.d. sources and mixed sources. A relationship between the overflow probability of variable-length coding and the error probability of fixed-length coding is also revealed. Our analysis is based on the information-spectrum methods.

Includes members:
  Member "variable length coding with cost allowing non vanishing error probability":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimum overflow thresholds in variable length source coding allowing non vanishing error probability")
  Member "asymptotics and non asymptotics for universal fixed to variable source coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "finite sample analysis of image registration")
  Member "channels with cost constraints strong converse and dispersion":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finite sample analysis of image registration")
  Member "second order resolvability intrinsic randomness and fixed length source coding for mixed sources information spectrum approach":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "interval algorithm for random number generation information spectrum approach")
  Member "on the relationships among optimal symmetric fix free codes":
    also connected through other hyperedges:
      (none)
  Member "information spectrum approach to overflow probability of variable length codes with conditional cost function":
    also connected through other hyperedges:
      (none)
  Member "second order asymptotics in fixed length source coding and intrinsic randomness":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)