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: "byzantine multiple access"
  Abstract: We study communication over multiple access channels (MAC) where one of the users is possibly adversarial. When all users are non-adversarial, we want their messages to be decoded reliably. When an adversary is present, we consider two different decoding guarantees. #R##N#In part I, we require that the honest users' messages be decoded reliably. We study the 3-user MAC; 2-user MAC capacity follows from point-to-point AVC capacity. We characterize the capacity region for randomized codes. We also study the capacity region for deterministic codes. We obtain necessary conditions including a new non-symmetrizability condition for the capacity region to be non-trivial. We show that when none of the users are symmetrizable, the randomized coding capacity region is also achievable with deterministic codes. #R##N#In part II, we consider the weaker goal of authenticated communication where we only require that an adversarial user must not be able to cause an undetected error on the honest users' messages. For the 2-user MAC, we show that the following 3-phase scheme is rate-optimal: a standard MAC code is first used to achieve unauthenticated communication followed by two authentication phases where each user authenticates their message treating the other user as a possible adversary. We show that the authentication phases can be very short since this form of authentication itself, when possible, can be achieved for message sets whose size grow doubly exponentially in blocklength. This leads to our result that the authenticated communication capacity region of a discrete memoryless MAC is either zero or the (unauthenticated) MAC capacity region itself. This also, arguably, explains the similar nature of authenticated communication capacity of a discrete memoryless point-to-point adversarial channel recently found by Kosut and Kliewer (ITW, 2018).

Connected through hyperedge HE-1 (induced by source paper "quadratically constrained two way adversarial channels"):
  with members:
    - "the capacity region of the arbitrarily varying mac with and without constraints"
    - "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 "the capacity region of the arbitrarily varying mac with and without constraints"):
  with members:
    - "compound multiple access channel with confidential messages"
    - "the arbitrarily varying multiple access channel with conferencing encoders"
    - "on the deterministic code capacity region of an arbitrarily varying multiple access channel under list decoding"
    - "the compound multiple access channel with partially cooperating encoders"

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)