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: "capacity of a class of modulo sum relay channels"
  Abstract: This paper characterizes the capacity of a class of modulo additive noise relay channels, in which the relay observes a corrupted version of the noise and has a separate channel to the destination. The capacity is shown to be strictly below the cut-set bound in general and achievable using a quantize-and-forward strategy at the relay. This result confirms a conjecture by Ahlswede and Han about the capacity of channels with rate limited state information at the destination for this particular class of channels.

Connected through hyperedge HE-1 (induced by source paper "a new coding paradigm for the primitive relay channel"):
  with members:
    - "capacity achieving rate compatible polar codes"
    - "asymmetric error correction and flash memory rewriting using polar codes"
    - "capacity of a class of state dependent orthogonal relay channels"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "how to achieve the capacity of asymmetric channels"
    - "soft decoding based strategies for relay and interference channels analysis and achievable rates using ldpc codes"
    - "universal polar codes"
    - "wireless network information flow a deterministic approach"

Connected through hyperedge HE-2 (induced by source paper "capacity upper bounds for the relay channel via reverse hypercontractivity"):
  with members:
    - "the capacity of the relay channel solution to cover s problem in the gaussian case"
    - "brascamp lieb inequality and its reverse an information theoretic view"
    - "cut set bound is loose for gaussian relay networks"
    - "secret key generation with one communicator and a one shot converse via hypercontractivity"
    - "wasserstein continuity of entropy and outer bounds for interference channels"

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"
    - "reliability in source coding with side information"

Connected through hyperedge HE-4 (induced by source paper "strong converse theorems for classes of multimessage multicast networks a renyi divergence approach"):
  with members:
    - "on the reliability function of the discrete memoryless relay channel"
    - "renyi divergence and kullback leibler divergence"
    - "wireless network information flow a deterministic approach"
    - "slepian wolf coding over cooperative relay networks"

Connected through hyperedge HE-5 (induced by source paper "improving on the cut set bound via geometric analysis of typical sets"):
  with members:
    - "cut set bound is loose for gaussian relay networks"
    - "wireless network information flow a deterministic approach"
    - "compute and forward harnessing interference through structured codes"
    - "communication requirements for generating correlated random variables"

Connected through hyperedge HE-6 (induced by source paper "cut set bound is loose for gaussian relay networks"):
  with members:
    - "cover s open problem the capacity of the relay channel"
    - "improving on the cut set bound via geometric analysis of typical sets"
    - "wasserstein continuity of entropy and outer bounds for interference channels"
    - "improved capacity approximations for gaussian relay networks"
    - "achieving the capacity of the n relay gaussian diamond network within log n bits"
    - "a unified relay framework with both d f and c f relay nodes"
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the gaussian n relay diamond network"

Connected through hyperedge HE-7 (induced by source paper "a stochastic geometry based approach to modeling interference correlation in cooperative relay networks"):
  with members:
    - "managing interference correlation through random medium access"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "heterogeneous cellular networks with flexible cell association a comprehensive downlink sinr analysis"
    - "diversity loss due to interference correlation"
    - "a tractable approach to coverage and rate in cellular networks"
    - "noisy network coding"
    - "spatial and temporal correlation of the interference in aloha ad hoc networks"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-8 (induced by source paper "capacity of a class of state dependent orthogonal relay channels"):
  with members:
    - "cooperative binning for semideterministic channels"
    - "relay channel with orthogonal components and structured interference known at the source"
    - "bounds on the capacity of the relay channel with noncausal state at source"
    - "message and state cooperation in a relay channel when only the relay knows the state"
    - "bounds on the capacity of the relay channel with noncausal state information at source"
    - "capacity of a class of diamond channels"
    - "capacity of a class of deterministic relay channels"

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)