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 "message transmission over classical quantum channels with a jammer with side information correlation as resource and common randomness generating"):
  Abstract: In this paper we analyze the capacity of a general model for arbitrarily varying classical-quantum channels when the sender and the receiver use a weak resource. In this model a jammer has side information about the channel input. We determine the correlation assisted capacity of AVCQCs with a jammer knowing the channel input. We deliver a single letter formula for the correlation assisted capacity. This formula as a function of the channel parameters is Turing computable. The single letter characterization is surprising, on the one hand because correlation is the weakest resource in the hierarchy of resources, on the other hand because the deterministic capacity formula for arbitrarily varying channels with informed jammer is still an open problem, even for classical arbitrarily varying channels, where the well-know Shannon's zero-error capacity is contained as a special case of this scenario. As an application,we determine the correlation assisted common randomness capacity. We also analyze these both capacities when only a small amount of correlation is available. For the correlation assisted common randomness capacity we show a further interesting aspect: For a sufficient amount of "public communication", common randomness capacity is Turing computable, however without this public communication's constrain, the correlation assisted common randomnesscapacity is in general not Banach-Mazur computable and thus not Turing computable.

Includes members:
  Member "message transmission over classical quantum channels with a jammer with side information message transmission capacity and resources":
    also connected through other hyperedges:
      (none)
  Member "secret message transmission over quantum channels under adversarial quantum noise secrecy capacity and super activation":
    also connected through other hyperedges:
      (none)
  Member "classical quantum arbitrarily varying wiretap channel secret message transmission under jamming attacks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "message transmission over classical quantum channels with a jammer with side information message transmission capacity and resources")
  Member "classical quantum arbitrarily varying wiretap channel ahlswede dichotomy positivity resources super activation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "classical quantum arbitrarily varying wiretap channel secret message transmission under jamming attacks")
  Member "classical quantum arbitrarily varying wiretap channel common randomness assisted code and continuity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "message transmission over classical quantum channels with a jammer with side information message transmission capacity and resources")
  Member "classical quantum arbitrarily varying wiretap channel a capacity formula with ahlswede dichotomy resources":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "classical quantum arbitrarily varying wiretap channel secret message transmission under jamming attacks")

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)