human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "the capacity region of the arbitrarily varying mac with and without constraints"
  Abstract: We determine both the random code capacity region and the deterministic code capacity region of the arbitrarily varying multiple access channel (AVMAC) under input and state constraints. As in the single user case, the boundary of the deterministic code capacity region is a discontinuous function of the input constraint. For the AVMAC without constraints, the characterization due to Ahlswede and Cai is complete except for two cases, pointed out in the literature as an open problem. The missing piece is obtained as a special case of our results.

Connected through hyperedge HE-1 (induced by source paper "quadratically constrained two way adversarial channels"):
  with members:
    - "byzantine multiple access"
    - "quadratically constrained myopic adversarial channels"
    - "on avcs with quadratic constraints"
    - "a simple proof for the existence of good pairs of nested lattices"
    - "mutual information games in multi user channels with correlated jamming"

Connected through hyperedge HE-2 (induced by source paper "list decoding for oblivious arbitrarily varying macs constrained and gaussian"):
  with members:
    - "list decodable robust mean estimation and learning mixtures of spherical gaussians"
    - "a characterization of the capacity of online causal binary channels"

Connected through hyperedge HE-3 (induced by source paper "the arbitrarily varying channel with colored gaussian noise"):
  with members:
    - "the arbitrarily varying relay channel"
    - "minimax theorems for finite blocklength lossy joint source channel coding over an avc"
    - "the arbitrarily varying gaussian relay channel with sender frequency division"
    - "communication over an arbitrarily varying channel under a state myopic encoder"
    - "arbitrarily varying wiretap channel with state sequence known or unknown at the receiver"
    - "semi robust communications over a broadcast channel"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"

Connected through hyperedge HE-4 (induced by source paper "byzantine multiple access"):
  with members:
    - "the arbitrarily varying multiple access channel with conferencing encoders"
    - "polytope codes against adversaries in networks"
    - "robust network coding in the presence of untrusted nodes"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"

Question: Please tell me which class the center node 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)