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 of binary state symmetric channel with and without feedback and transmission cost"
  Abstract: We consider a unit memory channel, called Binary State Symmetric Channel (BSSC), in which the channel state is the modulo2 addition of the current channel input and the previous channel output. We derive closed form expressions for the capacity and corresponding channel input distribution for the BSSC with and without feedback and transmission cost. We also show that the capacity of the BSSC, with or without feedback, is achieved by a first order symmetric Markov process.

Connected through hyperedge HE-1 (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"
    - "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"
    - "capacity and coding for the ising channel with feedback"

Connected through hyperedge HE-2 (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"
    - "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"
    - "capacity and coding for the ising channel with feedback"

Connected through hyperedge HE-3 (induced by source paper "information structures of extremum problems of feedback capacity for general 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 a post channel with and without feedback"
    - "directed information on abstract spaces properties and extremum problems"
    - "a coding theorem for a class of stationary channels with feedback"
    - "finite state channels with time invariant deterministic feedback"
    - "feedback capacity of stationary gaussian channels"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-4 (induced by source paper "information structures of maximizing distributions of feedback capacity for general channels with memory applications"):
  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 a post channel with and without feedback"
    - "directed information on abstract spaces properties and extremum problems"
    - "a coding theorem for a class of stationary channels with feedback"
    - "finite state channels with time invariant deterministic feedback"
    - "feedback capacity of stationary gaussian channels"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-5 (induced by source paper "capacity achieving distributions information lossless randomized strategies for feedback channels with memory the lqg theory of directed information part ii"):
  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 a post channel with and without feedback"
    - "a coding theorem for a class of stationary channels with feedback"
    - "finite state channels with time invariant deterministic feedback"
    - "feedback capacity of stationary gaussian channels"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-6 (induced by source paper "information structures for feedback capacity of channels with memory and transmission cost stochastic optimal control variational equalities part i"):
  with members:
    - "sequential necessary and sufficient conditions for capacity achieving distributions of channels with memory and feedback"
    - "capacity achieving distributions information lossless randomized strategies for feedback channels with memory the lqg theory of directed information part ii"
    - "capacity of a post channel with and without feedback"
    - "finite state channels with time invariant deterministic feedback"
    - "feedback capacity of stationary gaussian channels"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-7 (induced by source paper "information structures of capacity achieving distributions for feedback channels with memory and transmission cost stochastic optimal control variational equalities part i"):
  with members:
    - "capacity of a post channel with and without feedback"
    - "finite state channels with time invariant deterministic feedback"
    - "feedback capacity of stationary gaussian channels"
    - "the capacity of channels with feedback"

Connected through hyperedge HE-8 (induced by source paper "directed information on abstract spaces properties and variational equalities"):
  with members:
    - "sequential necessary and sufficient conditions for capacity achieving distributions of channels with memory and feedback"
    - "capacity achieving distributions information lossless randomized strategies for feedback channels with memory the lqg theory of directed information part ii"
    - "optimal nonanticipative estimation schemes for time varying gauss markov processes"
    - "information nonanticipative rate distortion function and its applications"
    - "information structures for feedback capacity of channels with memory and transmission cost stochastic optimal control variational equalities part i"
    - "nonanticipative rate distortion function and relations to filtering theory"
    - "capacity of a post channel with and without feedback"
    - "optimal nonstationary reproduction distribution for nonanticipative rdf on abstract alphabets"

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)