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 "partial updates losing information for freshness"):
  Abstract: We consider an information updating system where a source produces updates as requested by a transmitter. The transmitter further processes these updates in order to generate $partial$ $updates$, which have smaller information compared to the original updates, to be sent to a receiver. We study the problem of generating partial updates, and finding their corresponding real-valued codeword lengths, in order to minimize the average age experienced by the receiver, while maintaining a desired level of mutual information between the original and partial updates. This problem is NP hard. We relax the problem and develop an alternating minimization based iterative algorithm that generates a pmf for the partial updates, and the corresponding age-optimal real-valued codeword length for each update. We observe that there is a tradeoff between the attained average age and the mutual information between the original and partial updates.

Includes members:
  Member "optimal selective encoding for timely updates":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "who should google scholar update more often")
  Member "trading off computation with transmission in status update systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "who should google scholar update more often")
  Member "on timely channel coding with hybrid arq":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal selective encoding for timely updates")
  Member "reducing age of information for computation intensive messages via packet replacement":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "who should google scholar update more often")
  Member "timely distributed computation with stragglers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "who should google scholar update more often")
  Member "age of information in multicast networks with multiple update streams":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "who should google scholar update more often")
  Member "age of information for updates with distortion":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "who should google scholar update more often")
  Member "using erasure feedback for online timely updating with an energy harvesting sensor":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "who should google scholar update more often")

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)