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 "channel detection in coded communication"):
  Abstract: We consider the problem of block-coded communication, where in each block, the channel law belongs to one of two disjoint sets. The decoder is aimed to decode only messages that have undergone a channel from one of the sets, and thus has to detect the set which contains the prevailing channel. We begin with the simplified case where each of the sets is a singleton. For any given code, 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, and also introduce sub-optimal detection/decoding rules which are simpler to implement. Then, various achievable bounds on the error exponents are derived, including the exact single-letter characterization of the random coding exponents for the optimal detector/decoder. We then extend the random coding analysis to general sets of channels, and show that there exists a universal detector/decoder which performs asymptotically as well as the optimal detector/decoder, when tuned to detect a channel from a specific pair of channels. The case of a pair of binary symmetric channels is discussed in detail.

Includes members:
  Member "quickest transient change detection under a sampling constraint":
    also connected through other hyperedges:
      (none)
  Member "sampling constrained asynchronous communication how to sleep efficiently":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "second order asymptotics for communication under strong asynchronism")
  Member "on zero rate error exponents of finite state channels with input dependent states":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "information theoretic applications of the logarithmic probability comparison bound")
  Member "simplified erasure list decoding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exact error and erasure exponents for the asymmetric broadcast channel")
  Member "list decoding random coding exponents and expurgated exponents":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mismatched guesswork")
  Member "asymptotically optimal decision rules for joint detection and source coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "list decoding random coding exponents and expurgated exponents")
  Member "exact random coding error exponents of optimal bin index decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sharp bounds for mutual covering")
  Member "erasure list random coding error exponents are not universally achievable":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "mismatched guesswork")

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)