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: "asymmetric error correction and flash memory rewriting using polar codes"
  Abstract: We propose efficient coding schemes for two communication settings: 1. asymmetric channels, and 2. channels with an informed encoder. These settings are important in non-volatile memories, as well as optical and broadcast communication. The schemes are based on non-linear polar codes, and they build on and improve recent work on these settings. In asymmetric channels, we tackle the exponential storage requirement of previously known schemes, that resulted from the use of large Boolean functions. We propose an improved scheme, that achieves the capacity of asymmetric channels with polynomial computational complexity and storage requirement. #R##N#The proposed non-linear scheme is then generalized to the setting of channel coding with an informed encoder, using a multicoding technique. We consider specific instances of the scheme for flash memories, that incorporate error-correction capabilities together with rewriting. Since the considered codes are non-linear, they eliminate the requirement of previously known schemes (called polar write-once-memory codes) for shared randomness between the encoder and the decoder. Finally, we mention that the multicoding scheme is also useful for broadcast communication in Marton's region, improving upon previous schemes for this setting.

Connected through hyperedge HE-1 (induced by source paper "a new coding paradigm for the primitive relay channel"):
  with members:
    - "capacity achieving rate compatible polar codes"
    - "capacity of a class of state dependent orthogonal relay channels"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "how to achieve the capacity of asymmetric channels"
    - "soft decoding based strategies for relay and interference channels analysis and achievable rates using ldpc codes"
    - "universal polar codes"
    - "wireless network information flow a deterministic approach"
    - "nested polar codes for wiretap and relay channels"

Connected through hyperedge HE-2 (induced by source paper "joint coordination channel coding for strong coordination over noisy channels based on polar codes"):
  with members:
    - "strong coordination of signals and actions over noisy channels"
    - "strong coordination over noisy channels is separation sufficient"
    - "empirical and strong coordination via soft covering with polar codes"
    - "polar coding for empirical coordination of signals and actions over noisy channels"
    - "polar codes for broadcast channels"
    - "strong coordination over multi hop line networks"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "strong coordination over a line network"

Connected through hyperedge HE-3 (induced by source paper "polar codes for broadcast channels with receiver message side information and noncausal state available at the encoder"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "polar codes for broadcast channels"
    - "polar coding for interference networks"
    - "achieving the uniform rate region of multiple access channels using polar codes"
    - "polar codes for the two user multiple access channel"
    - "achieving the capacity of any dmc using only polar codes"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"

Connected through hyperedge HE-4 (induced by source paper "lossy compression with privacy constraints optimality of polar codes"):
  with members:
    - "polar codes for broadcast channels"
    - "achieving marton s region for broadcast channels using polar codes"
    - "lossy source coding with reconstruction privacy"
    - "from the information bottleneck to the privacy funnel"
    - "utility privacy tradeoffs in databases an information theoretic approach"
    - "rate distortion theory for secrecy systems"
    - "calibrating data to sensitivity in private data analysis"
    - "polar codes are optimal for lossy source coding"

Connected through hyperedge HE-5 (induced by source paper "rewriting flash memories by message passing"):
  with members:
    - "achieving marton s region for broadcast channels using polar codes"
    - "trajectory codes for flash memory"
    - "polar write once memory codes"
    - "on coding efficiency for flash memories"
    - "iterative quantization using codes on graphs"

Connected through hyperedge HE-6 (induced by source paper "joint write once memory and error control codes"):
  with members:
    - "universal polar codes for more capable and less noisy channels and sources"
    - "write once memory codes by source polarization"
    - "polar write once memory codes"
    - "capacity achieving multiwrite wom codes"
    - "polar codes for q ary channels q 2 r"
    - "channel polarization on q ary discrete memoryless channels by arbitrary kernels"

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)