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: "codeword or noise exact random coding exponents for slotted asynchronism"
  Abstract: We consider the problem of slotted asynchronous coded communication, where in each time frame (slot), the transmitter is either silent or transmits a codeword from a given (randomly selected) codebook. The task of the decoder is to decide whether transmission has taken place, and if so, to decode the message. We derive the optimum detection/decoding rule in the sense of the best trade-off among the probabilities of decoding error, false alarm, and misdetection. For this detection/decoding rule, we then derive single-letter characterizations of the exact exponential rates of these three probabilities for the average code in the ensemble.

Connected through hyperedge HE-1 (induced by source paper "exact correct decoding exponent of the wiretap channel decoder"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "the sender excited secret key agreement model capacity reliability and secrecy exponents"
    - "exact random coding error exponents of optimal bin index decoding"
    - "tight exponential analysis of universally composable privacy amplification and its applications"
    - "a cryptographic treatment of the wiretap channel"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "success exponent of wiretapper a tradeoff between secrecy and reliability"

Connected through hyperedge HE-2 (induced by source paper "list decoding random coding exponents and expurgated exponents"):
  with members:
    - "expurgated random coding ensembles exponents refinements and connections"
    - "asymptotically optimal decision rules for joint detection and source coding"

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)