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: "a general formula for the mismatch capacity"
  Abstract: The fundamental limits of channels with mismatched decoding are addressed. A general formula is established for the mismatch capacity of a general channel, defined as a sequence of conditional distributions with a general decoding metrics sequence. We deduce an identity between the Verd\'{u}-Han general channel capacity formula, and the mismatch capacity formula applied to Maximum Likelihood decoding metric. Further, several upper bounds on the capacity are provided, and a simpler expression for a lower bound is derived for the case of a non-negative decoding metric. The general formula is specialized to the case of finite input and output alphabet channels with a type-dependent metric. The closely related problem of threshold mismatched decoding is also studied, and a general expression for the threshold mismatch capacity is obtained. As an example of threshold mismatch capacity, we state a general expression for the erasures-only capacity of the finite input and output alphabet channel. We observe that for every channel there exists a (matched) threshold decoder which is capacity achieving. Additionally, necessary and sufficient conditions are stated for a channel to have a strong converse. Csisz\'{a}r and Narayan's conjecture is proved for bounded metrics, providing a positive answer to the open problem introduced in [1], i.e., that the "product-space" improvement of the lower random coding bound, $C_q^{(\infty)}(W)$, is indeed the mismatch capacity of the discrete memoryless channel $W$. We conclude by presenting an identity between the threshold capacity and $C_q^{(\infty)}(W)$ in the DMC case.

Connected through hyperedge HE-1 (induced by source paper "strategic communication with side information at the decoder"):
  with members:
    - "strong coordination of signals and actions over noisy channels with two sided state information"
    - "persuasion with limited communication capacity"
    - "information design for strategic coordination of autonomous devices with non aligned utilities"
    - "information theoretic approach to strategic communication as a hierarchical game"
    - "on the role of side information in strategic communication"
    - "persuasion with limited communication"
    - "algorithmic bayesian persuasion"
    - "empirical coordination with two sided state information and correlated source and state"

Connected through hyperedge HE-2 (induced by source paper "a regression approach to certain information transmission problems"):
  with members:
    - "learning to detect"
    - "mmwave beam prediction with situational awareness a machine learning approach"
    - "deep learning based channel estimation for beamspace mmwave massive mimo systems"
    - "one bit ofdm receivers via deep learning"
    - "deepcode feedback codes via deep learning"
    - "learning the mmse channel estimator"
    - "a model driven deep learning network for mimo detection"
    - "a two step learning and interpolation method for location based channel database"

Connected through hyperedge HE-3 (induced by source paper "ratio list decoding"):
  with members:
    - "converse theorems for the dmc with mismatched decoding"
    - "list decoding random coding exponents and expurgated exponents"
    - "expurgated random coding ensembles exponents refinements and connections"
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "list decoding of polar codes"

Connected through hyperedge HE-4 (induced by source paper "converse theorems for the dmc with mismatched decoding"):
  with members:
    - "multiuser random coding techniques for mismatched decoding"

Connected through hyperedge HE-5 (induced by source paper "gaussian intersymbol interference channels with mismatch"):
  with members:
    - "on the asymptotic equivalence of circulant and toeplitz matrices"
    - "on the evaluation of the polyanskiy poor verdu converse bound for finite block length coding in awgn"
    - "random coding error exponents for the two user interference channel"
    - "universal decoding for gaussian intersymbol interference channels"
    - "erasure list exponents for slepian wolf decoding"
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "analysis of mismatched estimation errors using gradients of partition functions"
    - "universal decoding for arbitrary channels relative to a given class of decoding metrics"

Connected through hyperedge HE-6 (induced by source paper "channel capacity of polar coding with a given polar mismatched successive cancellation decoder"):
  with members:
    - "a simple proof of fast polarization"
    - "on the scaling exponent of polar codes for binary input energy harvesting channels"
    - "a split reduced successive cancellation list decoder for polar codes"
    - "a low latency list successive cancellation decoding implementation for polar codes"
    - "a high throughput list decoder architecture for polar codes"
    - "fast list decoders for polar codes"
    - "symbol decision successive cancellation list decoder for polar codes"
    - "polar coding for processes with memory"

Connected through hyperedge HE-7 (induced by source paper "mismatched multi letter successive decoding for the multiple access channel"):
  with members:
    - "random coding error exponents for the two user interference channel"
    - "re proving channel polarization theorems an extremality and robustness analysis"
    - "polarization as a novel architecture to boost the classical mismatched capacity of b dmcs"
    - "a technique for deriving one shot achievability results in network information theory"
    - "multiuser coding techniques for mismatched decoding"
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "on achievable rates for channels with mismatched decoding"
    - "multiuser random coding techniques for mismatched decoding"

Connected through hyperedge HE-8 (induced by source paper "a counter example to the mismatched decoding converse for binary input discrete memoryless channels"):
  with members:
    - "multiuser coding techniques for mismatched decoding"

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)