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 "the dof of two way butterfly networks"):
  Abstract: This letter studies the two-way butterfly network, a class of two-way four-unicast networks. We first show that bidirectional links do not increase the degrees of freedom for this network, thus giving the first example of a network to the best of our knowledge, where bidirectional links do not increase the degrees of freedom. Furthermore, we show that sufficient caching at the relays or increasing the number of antennas at the relays can double the degrees of freedom for the two-way butterfly network.

Includes members:
  Member "sprout a functional caching approach to minimize service latency in erasure coded storage":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity of distributed storage systems with clusters and separate nodes")
  Member "on the capacity regions of two way diamond channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the dof of two way 2 2 2 relay networks with or without relay caching")
  Member "beyond one way communication degrees of freedom of multi way relay mimo interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "degrees of freedom of the mimo three way channel with node intermittency")
  Member "real interference alignment exploiting the potential of single antenna systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multi antenna coded content delivery with caching a low complexity solution")
  Member "caching eliminates the wireless bottleneck in video aware wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "individual preference aware caching policy design in wireless d2d networks")
  Member "design and characterization of a full duplex multiantenna system for wifi networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "nested lattice codes for gaussian two way relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the dof of two way 2 2 2 relay networks with or without relay caching")
  Member "lattice coding for the two way two relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the dof of two way 2 2 2 relay networks with or without relay caching")

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)