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 "quadratically constrained two way adversarial channels"):
  Abstract: We study achievable rates of reliable communication in a power-constrained two-way additive interference channel over the real alphabet where communication is disrupted by a power-constrained jammer. This models the wireless communication scenario where two users Alice and Bob, operating in the full duplex mode, wish to exchange messages with each other in the presence of a jammer, James. Alice and Bob simultaneously transmit their encodings $ \underline{x}_A $ and $\underline{x}_B $ over $ n $ channel uses. It is assumed that James can choose his jamming signal $ \underline{s} $ as a noncausal randomized function of $ \underline{x}_A $ and $ \underline{x}_B $, and the codebooks used by Alice and Bob. Alice and Bob observe $ \underline{x}_A+\underline{x}_B +\underline{s}$, and must recover each others' messages reliably. In this article, we give upper and lower bounds on the capacity of this channel which match each other in the high-$\mathsf{SNR}$ (signal to noise ratios, defined as the ratio of the power constraints of the users to the power constraint of the jammer) regime. We give a code construction based on lattice codes, and derive achievable rates for large $\mathsf{SNR}$. We also present upper bounds based on two specific attack strategies for James. For the converse, we also derive general properties of capacity-achieving codes for memoryless channels, which might be of independent interest.

Includes members:
  Member "the capacity region of the arbitrarily varying mac with and without constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "list decoding for oblivious arbitrarily varying macs constrained and gaussian")
  Member "byzantine multiple access":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the capacity region of the arbitrarily varying mac with and without constraints")
  Member "quadratically constrained myopic adversarial channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "authentication against a myopic adversary")
  Member "on avcs with quadratic constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "quadratically constrained myopic adversarial channels")
  Member "a simple proof for the existence of good pairs of nested lattices":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private information retrieval over gaussian mac")
  Member "mutual information games in multi user channels with correlated jamming":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "quadratically constrained myopic adversarial channels")

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)