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: "improved 8 point approximate dct for image and video compression requiring only 14 additions"
  Abstract: Video processing systems such as HEVC requiring low energy consumption needed for the multimedia market has lead to extensive development in fast algorithms for the efficient approximation of 2-D DCT transforms. The DCT is employed in a multitude of compression standards due to its remarkable energy compaction properties. Multiplier-free approximate DCT transforms have been proposed that offer superior compression performance at very low circuit complexity. Such approximations can be realized in digital VLSI hardware using additions and subtractions only, leading to significant reductions in chip area and power consumption compared to conventional DCTs and integer transforms. In this paper, we introduce a novel 8-point DCT approximation that requires only 14 addition operations and no multiplications. The proposed transform possesses low computational complexity and is compared to state-of-the-art DCT approximations in terms of both algorithm complexity and peak signal-to-noise ratio. The proposed DCT approximation is a candidate for reconfigurable video standards such as HEVC. The proposed transform and several other DCT approximations are mapped to systolic-array digital architectures and physically realized as digital prototype circuits using FPGA technology and mapped to 45 nm CMOS technology.

Connected through hyperedge HE-1 (induced by source paper "capstone mobility modeling on smartphones to achieve privacy by design"):
  with members:
    - "trajectory recovery from ash user privacy is not preserved in aggregated mobility data"
    - "communication efficient learning of deep networks from decentralized data"
    - "an eigenvector based hotspot detection"

Connected through hyperedge HE-2 (induced by source paper "multiplierless 16 point dct approximation for low complexity image and video coding"):
  with members:
    - "an orthogonal 16 point approximate dct for image and video compression"
    - "dct like transform for image compression requires 14 additions only"
    - "a digital hardware fast algorithm and fpga based prototype for a novel 16 point approximate dct for image compression applications"
    - "a dct approximation for image compression"

Connected through hyperedge HE-3 (induced by source paper "an orthogonal 16 point approximate dct for image and video compression"):
  with members:
    - "dct like transform for image compression requires 14 additions only"
    - "a digital hardware fast algorithm and fpga based prototype for a novel 16 point approximate dct for image compression applications"
    - "a dct approximation for image compression"

Connected through hyperedge HE-4 (induced by source paper "a multiplierless pruned dct like transformation for image and video compression that requires ten additions only"):
  with members:
    - "multiplierless approximate 4 point dct vlsi architectures for transform block coding"
    - "dct like transform for image compression requires 14 additions only"
    - "a dct approximation for image compression"

Connected through hyperedge HE-5 (induced by source paper "energy efficient 8 point dct approximations theory and hardware architectures"):
  with members:
    - "dct like transform for image compression requires 14 additions only"
    - "a dct approximation for image compression"

Connected through hyperedge HE-6 (induced by source paper "low complexity pruned 8 point dct approximations for image encoding"):
  with members:
    - "dct like transform for image compression requires 14 additions only"
    - "a dct approximation for image compression"

Connected through hyperedge HE-7 (induced by source paper "dct like transform for image and video compression requires 10 additions only"):
  with members:
    - "multiplierless approximate 4 point dct vlsi architectures for transform block coding"
    - "dct like transform for image compression requires 14 additions only"

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.MM(Multimedia)