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 "protocol coding through reordering of user resources part i capacity results"):
  Abstract: The vast existing wireless infrastructure features a variety of systems and standards. It is of significant practical value to introduce new features and devices without changing the physical layer/hardware infrastructure, but upgrade it only in software. A way to achieve it is to apply protocol coding: encode information in the actions taken by a certain (existing) communication protocol. In this work we investigate strategies for protocol coding via combinatorial ordering of the labelled user resources (packets, channels) in an existing, primary system. Such a protocol coding introduces a new secondary communication channel in the existing system, which has been considered in the prior work exclusively in a steganographic context. Instead, we focus on the use of secondary channel for reliable communication with newly introduced secondary devices, that are low-complexity versions of the primary devices, capable only to decode the robustly encoded header information in the primary signals. We introduce a suitable communication model, capable to capture the constraints that the primary system operation puts on protocol coding. We have derived the capacity of the secondary channel under arbitrary error models. The insights from the information-theoretic analysis are used in Part II of this work to design practical error-correcting mechanisms for secondary channels with protocol coding.

Includes members:
  Member "bits through deterministic relay cascades with half duplex constraint":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity of the two hop half duplex relay channel")
  Member "coded modulation for power line communications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ulam sphere size analysis for permutation and multipermutation codes correcting translocation errors")
  Member "bits through relay cascades with half duplex constraint":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "achievable rate regions and outer bounds for a multi pair bi directional relay network")

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)