human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a general characterization of sync word for asynchronous communication"):
  Abstract: We study a problem of sequential frame synchronization for a frame transmitted uniformly in $A$ slots. For a discrete memoryless channel (DMC), Venkat Chandar et al showed that the frame length $N$ must scale with $A$ as $e^{N \alpha(Q)} > A$ for the frame synchronization error to go to zero (asymptotically with $A$). Here, $Q$ denotes the transition probabilities of the DMC and $\alpha(Q)$, defined as the synchronization threshold, characterizes the scaling needed of $N$ for asymptotic error free frame synchronization. We show that the asynchronous communication framework permits a natural tradeoff between the sync frame length $N$ and the channel (usually parameterised by the input). For an AWGN channel, we study this tradeoff between the sync frame length $N$ and the input symbol power $P$ and characterise the scaling needed of the sync frame energy $E = N P$ for optimal frame synchronisation.

Includes members:
  Member "communication under strong asynchronism":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the reliability function of distributed hypothesis testing under optimal detection")
  Member "optimal sequential frame synchronization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the strongly asynchronous massive access channel")

Question: Please tell me which class the source paper 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)