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: "reliability in source coding with side information"
  Abstract: We study error exponents for source coding with side information. Both achievable exponents and converse bounds are obtained for the following two cases: lossless source coding with coded information (SCCSI) and lossy source coding with full side information (Wyner-Ziv). These results recover and extend several existing results on source-coding error exponents and are tight in some circumstances. Our bounds have a natural interpretation as a two-player game between nature and the code designer, with nature seeking to minimize the exponent and the code designer seeking to maximize it. In the Wyner-Ziv problem our analysis exposes a tension in the choice of test channel with the optimal test channel balancing two competing error events. The Gaussian and binary-erasure cases are examined in detail.

Connected through hyperedge HE-1 (induced by source paper "on binary distributed hypothesis testing"):
  with members:
    - "distributed structure joint expurgation for the multiple access channel"
    - "distributed binary detection with lossy data compression"
    - "on the reliability function of variable rate slepian wolf coding"
    - "are slepian wolf rates necessary for distributed parameter estimation"

Connected through hyperedge HE-2 (induced by source paper "second order and moderate deviation asymptotics for successive refinement"):
  with members:
    - "second order region for gray wyner network"
    - "second order asymptotics for the gaussian mac with degraded message sets"
    - "strong successive refinability and rate distortion complexity tradeoff"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "second order coding rates for channels with state"
    - "a case where interference does not affect the channel dispersion"
    - "on the dispersions of three network information theory problems"
    - "on the dispersions of the gel fand pinsker channel and dirty paper coding"

Connected through hyperedge HE-3 (induced by source paper "strong converse theorems for multimessage networks with tight cut set bound"):
  with members:
    - "new strong converse for asymmetric broadcast channels"
    - "achievable rates for gaussian degraded relay channels with non vanishing error probabilities"
    - "strong converse theorems for classes of multimessage multicast networks a renyi divergence approach"
    - "on the reliability function of the discrete memoryless relay channel"
    - "on gaussian channels with feedback under expected power constraints and with non vanishing error probabilities"
    - "strong converse exponent for degraded broadcast channels at rates outside the capacity region"
    - "wireless network information flow a deterministic approach"
    - "capacity of a class of modulo sum relay channels"

Connected through hyperedge HE-4 (induced by source paper "asymptotic estimates in information theory with non vanishing error probabilities"):
  with members:
    - "second order asymptotics for the gaussian mac with degraded message sets"
    - "the third order term in the normal approximation for the awgn channel"
    - "strong converse and second order asymptotics of channel resolvability"
    - "channels with cost constraints strong converse and dispersion"
    - "secret key agreement general capacity and second order asymptotics"
    - "second order coding rates for channels with state"
    - "unequal message protection asymptotic and non asymptotic tradeoffs"
    - "information spectrum approach to strong converse theorems for degraded wiretap channels"

Connected through hyperedge HE-5 (induced by source paper "on the reliability function of the discrete memoryless relay channel"):
  with members:
    - "multiuser coding techniques for mismatched decoding"
    - "multiuser random coding techniques for mismatched decoding"
    - "moderate deviations of lossy source coding for discrete and gaussian sources"
    - "the gelfand pinsker channel strong converse and upper bound for the reliability function"
    - "information spectrum approach to second order coding rate in channel coding"
    - "relations between random coding exponents and the statistical physics of random codes"
    - "capacity and random coding exponents for channel coding with side information"

Connected through hyperedge HE-6 (induced by source paper "information embedding and the triple role of control"):
  with members:
    - "coordination using implicit communication"
    - "multiaccess channels with state known to some encoders and independent messages"

Connected through hyperedge HE-7 (induced by source paper "non asymptotic and second order achievability bounds for coding with side information"):
  with members:
    - "second order asymptotics for the gaussian mac with degraded message sets"
    - "on the dispersions of three network information theory problems"
    - "a technique for deriving one shot achievability results in network information theory"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "non asymptotic output statistics of random binning and its applications"
    - "distributed channel synthesis"
    - "a formula for the capacity of the general gel fand pinsker channel"
    - "achievability proof via output statistics of random binning"

Connected through hyperedge HE-8 (induced by source paper "universal wyner ziv coding for distortion constrained general side information"):
  with members:
    - "channel coding and lossy source coding using a generator of constrained random numbers"
    - "tight exponential analysis of universally composable privacy amplification and its applications"
    - "achievability proof via output statistics of random binning"
    - "rate distortion with side information at many decoders"
    - "the rate distortion function for product of two sources with side information at decoders"
    - "universal source coding over generalized complementary delivery networks"
    - "efficient on line schemes for encoding individual sequences with side information at the decoder"
    - "hash property and coding theorems for sparse matrices and maximum likelihood coding"

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)