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: "bits through bufferless queues"
  Abstract: This paper investigates the capacity of a channel in which information is conveyed by the timing of consecutive packets passing through a queue with independent and identically distributed service times. Such timing channels are commonly studied under the assumption of a work-conserving queue. In contrast, this paper studies the case of a bufferless queue that drops arriving packets while a packet is in service. Under this bufferless model, the paper provides upper bounds on the capacity of timing channels and establishes achievable rates for the case of bufferless M/M/1 and M/G/1 queues. In particular, it is shown that a bufferless M/M/1 queue at worst suffers less than 10% reduction in capacity when compared to an M/M/1 work-conserving queue.

Connected through hyperedge HE-1 (induced by source paper "stabilizing a linear system using phone calls when time is information"):
  with members:
    - "optimal causal rate constrained sampling of the wiener process"
    - "theory and implementation of event triggered stabilization over digital channels"
    - "stabilizing a linear system using phone calls"
    - "tracking and control of gauss markov processes over packet drop channels with acknowledgments"
    - "event triggered stabilization of linear systems under bounded bit rates"
    - "inscribed matter communication part ii"
    - "information theory of molecular communication directions and challenges"
    - "almost practical tree codes"

Connected through hyperedge HE-2 (induced by source paper "stabilizing a linear system using phone calls"):
  with members:
    - "event triggered stabilization of linear systems under bounded bit rates"
    - "inscribed matter communication part ii"
    - "information theory of molecular communication directions and challenges"
    - "almost practical tree codes"
    - "rate cost tradeoffs in control"
    - "dynamic triggering mechanisms for event triggered control"

Connected through hyperedge HE-3 (induced by source paper "capacity of systems with queue length dependent service quality"):
  with members:
    - "work capacity of freelance markets fundamental limits and decentralized schemes"
    - "on the age of information in status update systems with packet management"
    - "queuing models for abstracting interactions in bacterial communities"
    - "reliable crowdsourcing for multi class labeling using coding theory"

Connected through hyperedge HE-4 (induced by source paper "the binary energy harvesting channel with a unit sized battery"):
  with members:
    - "capacity of the energy harvesting channel with a finite battery"
    - "capacity of the awgn channel with random battery recharges"
    - "interactive joint transfer of energy and information"
    - "binary energy harvesting channel with finite energy storage"
    - "awgn channel under time varying amplitude constraints with causal information at the transmitter"

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)