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 "semi finite length analysis for information theoretic tasks"):
  Abstract: We focus on the optimal value for various information-theoretical tasks. There are several studies for the asymptotic expansion for these optimal values up to the order $\sqrt{n}$ or $\log n$. However, these expansions have errors of the order $o(\sqrt{n})$ or $o(\log n)$, which does not goes to zero asymptotically. To resolve this problem, we derive the asymptotic expansion up to the constant order for upper and lower bounds of these optimal values. While the expansions of upper and lower bonds do not match, they clarify the ranges of these optimal values, whose errors go to zero asymptotically.

Includes members:
  Member "physical layer security for rf satellite channels in the finite length regime":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "two way physical layer security protocol for gaussian channels")
  Member "uniform random number generation from markov chains non asymptotic and asymptotic analyses":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "operational interpretation of renyi information measures via composite hypothesis testing against product and markov distributions")
  Member "strong converse for a degraded wiretap channel via active hypothesis testing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "two way physical layer security protocol for gaussian channels")
  Member "a tight upper bound for the third order asymptotics for most discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finite sample analysis of image registration")
  Member "non asymptotic and asymptotic analyses of information processing on markov chains":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secrecy and robustness for active attack in secure network coding and its application to network quantum key distribution")
  Member "the log volume of optimal codes for memoryless channels asymptotically within a few nats":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finite sample analysis of image registration")
  Member "exponential decreasing rate of leaked information in universal random privacy amplification":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "communication for generating correlation a unifying survey")
  Member "information spectrum approach to second order coding rate in channel coding":
    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)