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: "simultaneous nonunique decoding is rate optimal"
  Abstract: It is shown that simultaneous nonunique decoding is rate-optimal for the general K-sender, L-receiver discrete memoryless interference channel when encoding is restricted to randomly generated codebooks, superposition coding, and time sharing. This result implies that the Han-Kobayashi inner bound for the two-user-pair interference channel cannot be improved simply by using a better decoder such as the maximum likelihood decoder. It also generalizes and extends previous results by Baccelli, El Gamal, and Tse on Gaussian interference channels with point-to-point Gaussian random codebooks and shows that the Cover-van der Meulen inner bound with no common auxiliary random variable on the capacity region of the broadcast channel can be improved to include the superposition coding inner bound simply by using simultaneous nonunique decoding. The key to proving the main result is to show that after a maximal set of messages has been recovered, the remaining signal at each receiver is distributed essentially independently and identically.

Connected through hyperedge HE-1 (induced by source paper "an index coding approach to caching with uncoded cache placement"):
  with members:
    - "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded caching with shared caches fundamental limits with uncoded prefetching"
    - "benefits of cache assignment on degraded broadcast channels"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "improved converses and gap results for coded caching"
    - "on the capacity for distributed index coding"
    - "coded caching for a large number of users"

Connected through hyperedge HE-2 (induced by source paper "harnessing correlations in distributed erasure coded key value stores"):
  with members:
    - "on coding for cache aided delivery of dynamic correlated content"
    - "storage efficient shared memory emulation"
    - "a layered architecture for erasure coded consistent distributed storage"
    - "multi version coding for consistent distributed storage of correlated data updates"
    - "communication cost for updating linear functions when message updates are sparse connections to maximally recoverable codes"
    - "correlation aware distributed caching and coded delivery"
    - "information theoretic lower bounds on the storage cost of shared memory emulation"
    - "multi version coding an information theoretic perspective of consistent distributed storage"

Connected through hyperedge HE-3 (induced by source paper "on off switched interference alignment for diversity multiplexing tradeoff improvement in the 2 user x network with two antennas"):
  with members:
    - "advanced coordinated beamforming for the downlink of future lte cellular networks"
    - "interference aligned space time transmission with diversity for the 2 times 2 x network"
    - "interference alignment with diversity for the 2 times 2 x network with four antennas"
    - "maximum rate transmission with improved diversity gain for interference networks"
    - "secure degrees of freedom of mimo x channels with output feedback and delayed csit"
    - "interference alignment and the degrees of freedom for the k user interference channel"

Connected through hyperedge HE-4 (induced by source paper "a novel index coding scheme and its application to coded caching"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on the capacity for distributed index coding"
    - "information theoretic caching the multi user case"
    - "local partial clique covers for index coding"
    - "a rate distortion approach to caching"
    - "on caching with more users than files"
    - "on the optimality of uncoded cache placement"
    - "a rate distortion approach to index coding"

Connected through hyperedge HE-5 (induced by source paper "multi version coding for consistent distributed storage of correlated data updates"):
  with members:
    - "correlation aware distributed caching and coded delivery"
    - "multi version coding an information theoretic perspective of consistent distributed storage"
    - "file updates under random arbitrary insertions and deletions"
    - "fundamental limits on communication for oblivious updates in storage networks"
    - "a family of optimal locally recoverable codes"
    - "is non unique decoding necessary"
    - "a compression algorithm using mis aligned side information"

Connected through hyperedge HE-6 (induced by source paper "compute forward multiple access cfma practical code design"):
  with members:
    - "gaussian multiple access via compute and forward"
    - "an algebraic approach to physical layer network coding"
    - "compute and forward harnessing interference through structured codes"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-7 (induced by source paper "multi user cognitive interference channels a survey and new capacity results"):
  with members:
    - "the two user causal cognitive interference channel novel outer bounds and constant gap result for the symmetric gaussian noise channel in weak interference"
    - "on the capacity region of the two user interference channel with a cognitive relay"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "on the capacity of the two user gaussian causal cognitive interference channel"
    - "on the gaussian interference channel with half duplex causal cognition"
    - "multiuser cognitive radio networks an information theoretic perspective"
    - "approximate sum capacity of k user cognitive interference channels with cumulative message sharing"
    - "three user cognitive interference channel capacity region with strong interference"

Connected through hyperedge HE-8 (induced by source paper "multicoding schemes for interference channels"):
  with members:
    - "on the capacity of the two user gaussian causal cognitive interference channel"
    - "on the achievable rate regions for state dependent gaussian interference channel"
    - "a comparison of superposition coding schemes"
    - "wireless network information flow a deterministic approach"
    - "the state dependent semideterministic broadcast channel"
    - "interference channels with source cooperation"
    - "interference channels with destination cooperation"
    - "interference mitigation through limited transmitter cooperation"

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)