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 "broadcast function computation with complementary side information"):
  Abstract: We consider the function computation problem in a three node network with one encoder and two decoders. The encoder has access to two correlated sources $X$ and $Y$. The encoder encodes $X^n$ and $Y^n$ into a message which is given to two decoders. Decoder 1 and decoder 2 have access to $X$ and $Y$ respectively, and they want to compute two functions $f(X,Y)$ and $g(X,Y)$ respectively using the encoded message and their respective side information. We want to find the optimum (minimum) encoding rate under the zero error and $\epsilon$-error (i.e. vanishing error) criteria. For the special case of this problem with $f(X,Y) = Y$ and $g(X,Y) = X$, we show that the $\epsilon$-error optimum rate is also achievable with zero error. This result extends to a more general `complementary delivery index coding' problem with arbitrary number of messages and decoders. For other functions, we show that the cut-set bound is achievable under $\epsilon$-error if $X$ and $Y$ are binary, or if the functions are from a special class of `compatible' functions which includes the case $f=g$.

Includes members:
  Member "structural properties of index coding capacity using fractional graph theory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cooperative multi sender index coding")
  Member "zero error function computation through a bidirectional relay":
    also connected through other hyperedges:
      (none)
  Member "an equivalence between network coding and index coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "embedded index coding")
  Member "index coding an interference alignment perspective":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "network coding is zero error always possible":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lossless source coding in the point to point multiple access and random access scenarios")
  Member "universal coding for correlated sources with complementary delivery":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "function computation through a bidirectional relay")

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)