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: "asynchronous capacity per unit cost"
  Abstract: The capacity per unit cost, or equivalently minimum cost to transmit one bit, is a well-studied quantity. It has been studied under the assumption of full synchrony between the transmitter and the receiver. In many applications, such as sensor networks, transmissions are very bursty, with small amounts of bits arriving infrequently at random times. In such scenarios, the cost of acquiring synchronization is significant and one is interested in the fundamental limits on communication without assuming a priori synchronization. In this paper, we show that the minimum cost to transmit B bits of information asynchronously is (B + \bar{H})k_sync, where k_sync is the synchronous minimum cost per bit and \bar{H} is a measure of timing uncertainty equal to the entropy for most reasonable arrival time distributions. This result holds when the transmitter can stay idle at no cost and is a particular case of a general result which holds for arbitrary cost functions.

Connected through hyperedge HE-1 (induced by source paper "concurrent coding a reason to think differently about encoding against noise burst errors and jamming"):
  with members:
    - "concurrent codes a holographic type encoding robust against noise and loss"

Connected through hyperedge HE-2 (induced by source paper "second order asymptotics for communication under strong asynchronism"):
  with members:
    - "sampling constrained asynchronous communication how to sleep efficiently"
    - "channel detection in coded communication"
    - "asynchronous communication capacity bounds and suboptimality of training"
    - "communication under strong asynchronism"
    - "optimal sequential frame synchronization"

Connected through hyperedge HE-3 (induced by source paper "on the capacity of the slotted strongly asynchronous channel with a bursty user"):
  with members:
    - "energy and sampling constrained asynchronous communication"
    - "asynchronous communication capacity bounds and suboptimality of training"
    - "optimal sequential frame synchronization"

Connected through hyperedge HE-4 (induced by source paper "a cross layer approach for distributed energy efficient power control in interference networks"):
  with members:
    - "green power control in cognitive wireless networks"
    - "implicit cooperation in distributed energy efficient networks"
    - "cross layer design for green power control"
    - "energy efficient precoding for multiple antenna terminals"
    - "on the base station selection and base station sharing in self configuring networks"
    - "introducing hierarchy in energy games"
    - "competitive design of multiuser mimo systems based on game theory a unified view"
    - "energy efficient communications in cdma networks a game theoretic analysis considering operating costs"

Connected through hyperedge HE-5 (induced by source paper "sampling constrained asynchronous communication how to sleep efficiently"):
  with members:
    - "energy and sampling constrained asynchronous communication"
    - "asynchronous communication capacity bounds and suboptimality of training"
    - "communication under strong asynchronism"
    - "optimal sequential frame synchronization"

Connected through hyperedge HE-6 (induced by source paper "energy efficient communication over the unsynchronized gaussian diamond network"):
  with members:
    - "using superposition codebooks and partial decode and forward in low snr parallel relay networks"
    - "achievable rates for channels with deletions and insertions"
    - "energy efficient communication in the presence of synchronization errors"
    - "modeling and information rates for synchronization error channels"
    - "the approximate capacity of the gaussian n relay diamond network"
    - "on the deletion channel with small deletion probability"

Connected through hyperedge HE-7 (induced by source paper "energy and sampling constrained asynchronous communication"):
  with members:
    - "energy efficient communication in the presence of synchronization errors"
    - "asynchronous communication capacity bounds and suboptimality of training"
    - "communication under strong asynchronism"
    - "optimal sequential frame synchronization"

Connected through hyperedge HE-8 (induced by source paper "an energy efficient framework for the analysis of mimo slow fading channels"):
  with members:
    - "energy efficient precoding for multiple antenna terminals"
    - "methodologies for analyzing equilibria in wireless games"
    - "energy efficient resource allocation in multiuser mimo systems a game theoretic framework"
    - "multiuser mimo achievable rates with downlink training and channel state feedback"

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)