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 "sufficiently myopic adversaries are blind"):
  Abstract: In this work we consider a communication problem in which a sender, Alice, wishes to communicate with a receiver, Bob, over a channel controlled by an adversarial jammer, James, who is {\em myopic}. Roughly speaking, for blocklength $n$, the codeword $X^n$ transmitted by Alice is corrupted by James who must base his adversarial decisions (of which locations of $X^n$ to corrupt and how to corrupt them) not on the codeword $X^n$ but on $Z^n$, an image of $X^n$ through a noisy memoryless channel. More specifically, our communication model may be described by two channels. A memoryless channel $p(z|x)$ from Alice to James, and an {\it Arbitrarily Varying Channel} from Alice to Bob, $p(y|x,s)$ governed by a state $X^n$ determined by James. In standard adversarial channels the states $S^n$ may depend on the codeword $X^n$, but in our setting $S^n$ depends only on James's view $Z^n$. #R##N#The myopic channel captures a broad range of channels and bridges between the standard models of memoryless and adversarial (zero-error) channels. In this work we present upper and lower bounds on the capacity of myopic channels. For a number of special cases of interest we show that our bounds are tight. We extend our results to the setting of {\em secure} communication in which we require that the transmitted message remain secret from James. For example, we show that if (i) James may flip at most a $p$ fraction of the bits communicated between Alice and Bob, and (ii) James views $X^n$ through a binary symmetric channel with parameter $q$, then once James is "sufficiently myopic" (in this case, when $q>p$), then the optimal communication rate is that of an adversary who is "blind" (that is, an adversary that does not see $X^n$ at all), which is $1-H(p)$ for standard communication, and $H(q)-H(p)$ for secure communication. A similar phenomenon exists for our general model of communication.

Includes members:
  Member "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "semantic security and the second largest eigenvalue of biregular graphs")
  Member "on the capacity of the binary adversarial wiretap channel":
    also connected through other hyperedges:
      (none)
  Member "arbitrarily varying wiretap channels with type constrained states":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the arbitrarily varying channel with colored gaussian noise")
  Member "the arbitrarily varying wiretap channel secret randomness stability and super activation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the arbitrarily varying channel with colored gaussian noise")
  Member "coding against a limited view adversary the effect of causality and feedback":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "stealthy communication over adversarially jammed multipath networks")
  Member "semantic security capacity for wiretap channels of type ii":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "the arbitrarily varying wiretap channel deterministic and correlated random coding capacities under the strong secrecy criterion":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "message transmission over classical quantum channels with a jammer with side information message transmission capacity and resources")
  Member "a characterization of the capacity of online causal binary channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "list decoding for oblivious arbitrarily varying macs constrained and gaussian")

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)