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: "capacity and coding for the ising channel with feedback"
  Abstract: The Ising channel, which was introduced in 1990, is a channel with memory that models Inter-Symbol interference. In this paper we consider the Ising channel with feedback and find the capacity of the channel together with a capacity-achieving coding scheme. To calculate the channel capacity, an equivalent dynamic programming (DP) problem is formulated and solved. Using the DP solution, we establish that the feedback capacity is the expression $C=(\frac{2H_b(a)}{3+a})\approx 0.575522$ where $a$ is a particular root of a fourth-degree polynomial and $H_b(x)$ denotes the binary entropy function. Simultaneously, $a=\arg \max_{0\leq x \leq 1} (\frac{2H_b(x)}{3+x})$. Finally, a simple, error-free, capacity-achieving coding scheme is provided together with outlining a strong connection between the DP results and the coding scheme.

Connected through hyperedge HE-1 (induced by source paper "computing the feedback capacity of finite state channels using reinforcement learning"):
  with members:
    - "deepcode feedback codes via deep learning"
    - "feedback capacity and coding for the bibo channel with a no repeated ones input constraint"
    - "a single letter upper bound on the feedback capacity of unifilar finite state channels"
    - "continuous control with deep reinforcement learning"
    - "capacity of a post channel with and without feedback"
    - "finite state channels with time invariant deterministic feedback"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-2 (induced by source paper "computable upper bounds on the capacity of finite state channels"):
  with members:
    - "capacity of burst noise erasure channels with and without feedback and input cost"
    - "feedback capacity and coding for the bibo channel with a no repeated ones input constraint"
    - "an upper bound for the capacity of amplitude constrained scalar awgn channel"
    - "dual capacity upper bounds for noisy runlength constrained channels"
    - "capacity bounds for discrete time amplitude constrained additive white gaussian noise channels"
    - "capacity of a post channel with and without feedback"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-3 (induced by source paper "graph based encoders and their performance for finite state channels with feedback"):
  with members:
    - "feedback capacity and coding for the 0 k rll input constrained bec"
    - "feedback capacity and coding for the bibo channel with a no repeated ones input constraint"
    - "a single letter upper bound on the feedback capacity of unifilar finite state channels"
    - "a comprehensive survey of recent advancements in molecular communication"
    - "write channel model for bit patterned media recording"
    - "optimal feedback communication via posterior matching"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-4 (induced by source paper "feedback capacity and coding for the bibo channel with a no repeated ones input constraint"):
  with members:
    - "asymptotics of input constrained erasure channel capacity"
    - "dual capacity upper bounds for noisy runlength constrained channels"
    - "a single letter upper bound on the feedback capacity of unifilar finite state channels"
    - "an efficient feedback coding scheme with low error probability for discrete memoryless channels"
    - "a simple proof for the optimality of randomized posterior matching"
    - "can feedback increase the capacity of the energy harvesting channel"
    - "extrinsic jensen shannon divergence applications to variable length coding"
    - "optimal feedback communication via posterior matching"

Connected through hyperedge HE-5 (induced by source paper "capacity of burst noise erasure channels with and without feedback and input cost"):
  with members:
    - "feedback capacity and coding for the bibo channel with a no repeated ones input constraint"
    - "asymptotics of input constrained erasure channel capacity"
    - "feedback does not increase the capacity of compound channels with additive noise"
    - "can feedback increase the capacity of the energy harvesting channel"
    - "zero delay sequential transmission of markov sources over burst erasure channels"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "a coding theorem for a class of stationary channels with feedback"
    - "finite state channels with time invariant deterministic feedback"

Connected through hyperedge HE-6 (induced by source paper "feedback capacity and coding for the 0 k rll input constrained bec"):
  with members:
    - "feedback capacity and coding for the bibo channel with a no repeated ones input constraint"
    - "a single letter upper bound on the feedback capacity of unifilar finite state channels"
    - "an efficient feedback coding scheme with low error probability for discrete memoryless channels"
    - "a simple proof for the optimality of randomized posterior matching"
    - "extrinsic jensen shannon divergence applications to variable length coding"
    - "modulation coding for flash memories"
    - "optimal feedback communication via posterior matching"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-7 (induced by source paper "single letter expression of capacity for a class of channels with memory"):
  with members:
    - "information structures of capacity achieving distributions for feedback channels with memory and transmission cost stochastic optimal control variational equalities part i"
    - "capacity of binary state symmetric channel with and without feedback and transmission cost"
    - "information structures for feedback capacity of channels with memory and transmission cost stochastic optimal control variational equalities part i"
    - "capacity of a post channel with and without feedback"
    - "directed information on abstract spaces properties and variational equalities"

Connected through hyperedge HE-8 (induced by source paper "sequential necessary and sufficient conditions for capacity achieving distributions of channels with memory and feedback"):
  with members:
    - "capacity achieving distributions information lossless randomized strategies for feedback channels with memory the lqg theory of directed information part ii"
    - "a single letter upper bound on the feedback capacity of unifilar finite state channels"
    - "information structures of capacity achieving distributions for feedback channels with memory and transmission cost stochastic optimal control variational equalities part i"
    - "capacity of binary state symmetric channel with and without feedback and transmission cost"
    - "information structures for feedback capacity of channels with memory and transmission cost stochastic optimal control variational equalities part i"
    - "capacity of a post channel with and without feedback"
    - "directed information on abstract spaces properties and variational equalities"
    - "directed information on abstract spaces properties and extremum problems"

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)