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: "zero error capacity of a class of timing channels"
  Abstract: We analyze the problem of zero-error communication through timing channels that can be interpreted as discrete-time queues with bounded waiting times. The channel model includes the following assumptions: 1) Time is slotted, 2) at most $ N $ "particles" are sent in each time slot, 3) every particle is delayed in the channel for a number of slots chosen randomly from the set $ \{0, 1, \ldots, K\} $, and 4) the particles are identical. It is shown that the zero-error capacity of this channel is $ \log r $, where $ r $ is the unique positive real root of the polynomial $ x^{K+1} - x^{K} - N $. Capacity-achieving codes are explicitly constructed, and a linear-time decoding algorithm for these codes devised. In the particular case $ N = 1 $, $ K = 1 $, the capacity is equal to $ \log \phi $, where $ \phi = (1 + \sqrt{5}) / 2 $ is the golden ratio, and the constructed codes give another interpretation of the Fibonacci sequence.

Connected through hyperedge HE-1 (induced by source paper "variable length coding for zero error channel capacity"):
  with members:
    - "zero error capacity of duplication channels"
    - "bounds on the reliability of typewriter channels"
    - "zero error capacity of p ary shift channels and fifo queues"
    - "the rho capacity of a graph"
    - "uncertain wiretap channels and secure estimation"
    - "rate distance tradeoff for codes above graph capacity"
    - "secure estimation and zero error secrecy capacity"
    - "graph information ratio"

Connected through hyperedge HE-2 (induced by source paper "runlength limited sequences and shift correcting codes asymptotic analysis"):
  with members:
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "a note on parallel asynchronous channels with arbitrary skews"
    - "zero error capacity of p ary shift channels and fifo queues"
    - "constant weight and constant charge binary run length limited codes"

Connected through hyperedge HE-3 (induced by source paper "the crossover distance for isi correcting decoding of convolutional codes in diffusion based molecular communications"):
  with members:
    - "a comprehensive survey of recent advancements in molecular communication"

Connected through hyperedge HE-4 (induced by source paper "zero error capacity of p ary shift channels and fifo queues"):
  with members:
    - "a note on parallel asynchronous channels with arbitrary skews"
    - "a comprehensive survey of recent advancements in molecular communication"
    - "asymptotic estimates in information theory with non vanishing error probabilities"

Connected through hyperedge HE-5 (induced by source paper "a note on parallel asynchronous channels with arbitrary skews"):
  with members:
    - "zero error capacity of p ary shift channels and fifo queues"

Connected through hyperedge HE-6 (induced by source paper "information theory of molecular communication directions and challenges"):
  with members:
    - "shannon capacity of signal transduction for multiple independent receptors"
    - "capacity limits of diffusion based molecular timing channels"
    - "comprehensive reactive receiver modeling for diffusive molecular communication systems reversible binding molecule degradation and finite number of receptors"
    - "type based sign modulation for molecular communication"
    - "a comprehensive survey of recent advancements in molecular communication"
    - "information friction and its implications on minimum energy required for communication"
    - "a perspective on future research directions in information theory"
    - "upper bound on the capacity of a cascade of nonlinear and noisy channels"

Connected through hyperedge HE-7 (induced by source paper "a comprehensive survey of recent advancements in molecular communication"):
  with members:
    - "molecular mimo from theory to prototype"
    - "molecular communications channel model and physical layer techniques"
    - "a universal channel model for molecular communication systems with metal oxide detectors"
    - "design and optimizing of on chip kinesin substrates for molecular communication"
    - "improving receiver performance of diffusive molecular communication with enzymes"
    - "a molecular communication link for monitoring in confined environments"
    - "relaying in diffusion based molecular communication"
    - "effect of receptor density and size on signal reception in molecular communication via diffusion with an absorbing receiver"

Connected through hyperedge HE-8 (induced by source paper "zero error shift correcting and shift detecting codes"):
  with members:
    - "a comprehensive survey of recent advancements in molecular communication"
    - "asymptotic estimates in information theory with non vanishing error probabilities"

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)