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 "information spectrum approach to strong converse theorems for degraded wiretap channels"):
  Abstract: We consider block codes for degraded wiretap channels in which the legitimate receiver decodes the message with an asymptotic error probability no larger than $\varepsilon$ but the leakage to the eavesdropper vanishes. For discrete memoryless and Gaussian wiretap channels, we show that the maximum rate of transmission does not depend on $\varepsilon\in [0,1)$, i.e., such channels possess the partial strong converse property. Furthermore, we derive sufficient conditions for the partial strong converse property to hold for memoryless but non-stationary symmetric and degraded wiretap channels. Our proof techniques leverage the information spectrum method, which allows us to establish a necessary and sufficient condition for the partial strong converse to hold for general wiretap channels without any information stability assumptions.

Includes members:
  Member "converses for secret key agreement and secure computing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication")
  Member "strong converse and second order asymptotics of channel resolvability":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "communication for generating correlation a unifying survey")
  Member "secret key agreement general capacity and second order asymptotics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a capacity achieving one message key agreement with finite blocklength analysis")
  Member "second order coding rates for channels with state":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "second order and moderate deviation analysis of a block fading channel with deterministic and energy harvesting power constraints")
  Member "strong converse for a degraded wiretap channel via active hypothesis testing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "two way physical layer security protocol for gaussian channels")
  Member "fixed error asymptotics for erasure and list decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "energy efficient coded random access for the wireless uplink")
  Member "a tight upper bound for the third order asymptotics for most discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "finite sample analysis of image registration")
  Member "how many queries will resolve common randomness":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "secret key capacity for multipleaccess channel with public feedback")

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)