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: "hybrid coding an interface for joint source channel coding and network communication"
  Abstract: A new approach to joint source‐channel coding is presented in the context of communicating correlated sources over multiple access channels. Similar to the separation architecture, the joint source‐ channel coding system architecture in this approach is modular, whereby the source encoding and channel decoding operations are decoupled. However, unlike the separation architecture, the same codeword is used for both source coding and channel coding, which allows the resulting hybrid coding scheme to achieve the performance of the best known joint source‐channel coding schemes. Applications of the proposed architecture to relay communication are also discussed.

Connected through hyperedge HE-1 (induced by source paper "the likelihood encoder for lossy compression"):
  with members:
    - "joint source channel secrecy using hybrid coding"
    - "a rate distortion based secrecy system with side information at the decoders"
    - "a generalized typicality for abstract alphabets"
    - "the likelihood encoder for lossy source compression"
    - "a technique for deriving one shot achievability results in network information theory"
    - "non asymptotic output statistics of random binning and its applications"
    - "a connection between good rate distortion codes and backward dmcs"
    - "the likelihood encoder for source coding"

Connected through hyperedge HE-2 (induced by source paper "distortion bounds for source broadcast over degraded channel"):
  with members:
    - "a source channel separation theorem with application to the source broadcast problem"
    - "comments on approximate characterizations for the gaussian source broadcast distortion region"
    - "outer bounds on the admissible source region for broadcast channels with correlated sources"
    - "achievability proof via output statistics of random binning"
    - "hybrid digital analog codes for source channel broadcast of gaussian sources over gaussian channels"
    - "the achievable distortion region of bivariate gaussian source on gaussian broadcast channel"
    - "on the capacity of the discrete memoryless broadcast channel with feedback"
    - "wyner ziv coding over broadcast channels digital schemes"

Connected through hyperedge HE-3 (induced by source paper "joint source channel secrecy using hybrid coding"):
  with members:
    - "rate distortion based physical layer secrecy with applications to multimode fiber"
    - "a rate distortion based secrecy system with side information at the decoders"
    - "the likelihood encoder for lossy source compression"
    - "the likelihood encoder for source coding"
    - "distributed channel synthesis"
    - "rate distortion theory for secrecy systems"
    - "source channel secrecy with causal disclosure"
    - "secrecy is cheap if the adversary must reconstruct"

Connected through hyperedge HE-4 (induced by source paper "a unified approach for network information theory"):
  with members:
    - "noisy network coding with partial df"
    - "short message noisy network coding with a decode forward option"
    - "simultaneous nonunique decoding is rate optimal"
    - "achievability proof via output statistics of random binning"
    - "wireless network information flow a deterministic approach"
    - "on the capacity of the noncausal relay channel"
    - "interference decoding for deterministic channels"
    - "slepian wolf coding over cooperative relay networks"

Connected through hyperedge HE-5 (induced by source paper "one shot marton inner bound for classical quantum broadcast channel"):
  with members:
    - "one shot mutual covering lemma and marton s inner bound with a common message"
    - "information embedding and the triple role of control"
    - "is non unique decoding necessary"
    - "one shot source coding with coded side information available at the decoder"
    - "simple channel coding bounds"

Connected through hyperedge HE-6 (induced by source paper "the likelihood encoder for lossy source compression"):
  with members:
    - "a generalized typicality for abstract alphabets"
    - "the likelihood encoder for source coding"
    - "distributed channel synthesis"
    - "rate distortion theory for secrecy systems"

Connected through hyperedge HE-7 (induced by source paper "is non unique decoding necessary"):
  with members:
    - "simultaneous nonunique decoding is rate optimal"
    - "capacity region of multiple access channel with states known noncausally at one encoder and only strictly causally at the other encoder"
    - "interference decoding for deterministic channels"
    - "an achievability scheme for the compound channel with state noncausally available at the encoder"
    - "on the optimal compressions in the compress and forward relay schemes"

Connected through hyperedge HE-8 (induced by source paper "achievability proof via output statistics of random binning"):
  with members:
    - "when is it possible to simulate a dmc channel from another"
    - "distributed channel synthesis"
    - "channel simulation via interactive communications"
    - "coordination via a relay"
    - "strongly secure communications over the two way wiretap channel"
    - "strong secrecy from channel resolvability"
    - "construction of slepian wolf source code and broadcast channel code based on hash property"
    - "lecture notes on network information theory"

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)