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: "an alternate construction of an access optimal regenerating code with optimal sub packetization level"
  Abstract: Given the scale of today's distributed storage systems, the failure of an individual node is a common phenomenon. Various metrics have been proposed to measure the efficacy of the repair of a failed node, such as the amount of data download needed to repair (also known as the repair bandwidth), the amount of data accessed at the helper nodes, and the number of helper nodes contacted. Clearly, the amount of data accessed can never be smaller than the repair bandwidth. In the case of a help-by-transfer code, the amount of data accessed is equal to the repair bandwidth. It follows that a help-by-transfer code possessing optimal repair bandwidth is access optimal. The focus of the present paper is on help-by-transfer codes that employ minimum possible bandwidth to repair the systematic nodes and are thus access optimal for the repair of a systematic node. #R##N#The zigzag construction by Tamo et al. in which both systematic and parity nodes are repaired is access optimal. But the sub-packetization level required is $r^k$ where $r$ is the number of parities and $k$ is the number of systematic nodes. To date, the best known achievable sub-packetization level for access-optimal codes is $r^{k/r}$ in a MISER-code-based construction by Cadambe et al. in which only the systematic nodes are repaired and where the location of symbols transmitted by a helper node depends only on the failed node and is the same for all helper nodes. Under this set-up, it turns out that this sub-packetization level cannot be improved upon. In the present paper, we present an alternate construction under the same setup, of an access-optimal code repairing systematic nodes, that is inspired by the zigzag code construction and that also achieves a sub-packetization level of $r^{k/r}$.

Connected through hyperedge HE-1 (induced by source paper "code constructions for distributed storage with low repair bandwidth and low repair complexity"):
  with members:
    - "mds code constructions with small sub packetization and near optimal repair bandwidth"
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "a family of erasure correcting codes with low repair bandwidth and low repair complexity"
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "mdr codes a new class of raid 6 codes with optimal rebuilding and encoding"
    - "xoring elephants novel erasure codes for big data"
    - "zigzag codes mds array codes with optimal rebuilding"

Connected through hyperedge HE-2 (induced by source paper "product matrix msr codes with bandwidth adaptive exact repair"):
  with members:
    - "bandwidth adaptive error resilient mbr exact repair regenerating codes"
    - "product matrix minimum storage regenerating codes with flexible number of helpers"
    - "mds codes with progressive engagement property for cloud storage systems"
    - "general sub packetized access optimal regenerating codes"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "asymptotically optimal regenerating codes over any field"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "a high rate msr code with polynomial sub packetization level"

Connected through hyperedge HE-3 (induced by source paper "security concerns in minimum storage cooperative regenerating codes"):
  with members:
    - "on secrecy capacity of minimum storage regenerating codes"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "codes between mbr and msr points with exact repair property"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "data secrecy in distributed storage systems under exact repair"
    - "exact repair regenerating codes via layered erasure correction and block designs"
    - "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"

Connected through hyperedge HE-4 (induced by source paper "improved upper bounds on systematic length for linear minimum storage regenerating codes"):
  with members:
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "minimum storage regenerating codes for all parameters"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "on secrecy capacity of minimum storage regenerating codes"
    - "a high rate msr code with polynomial sub packetization level"
    - "a framework of constructions of minimal storage regenerating codes with the optimal access update property"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "codes between mbr and msr points with exact repair property"

Connected through hyperedge HE-5 (induced by source paper "optimal rebuilding of multiple erasures in mds codes"):
  with members:
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "minimum storage regenerating codes for all parameters"
    - "broadcast repair for wireless distributed storage systems"
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "centralized repair of multiple node failures with applications to communication efficient secret sharing"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "a high rate msr code with polynomial sub packetization level"

Connected through hyperedge HE-6 (induced by source paper "minimum storage regenerating codes for all parameters"):
  with members:
    - "new mds codes with small sub packetization and near optimal repair bandwidth"
    - "progress on high rate msr codes enabling arbitrary number of helper nodes"
    - "general sub packetized access optimal regenerating codes"
    - "an explicit coupled layer construction of a high rate msr code with low sub packetization level small field size and all node repair"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "repairing reed solomon codes"
    - "constructions of high rate msr codes over small fields"
    - "zigzag codes mds array codes with optimal rebuilding"

Connected through hyperedge HE-7 (induced by source paper "hashtag erasure codes from theory to practice"):
  with members:
    - "repair duality with locally repairable and locally regenerating codes"
    - "locally repairable and locally regenerating codes obtained by parity splitting of hashtag codes"
    - "general sub packetized access optimal regenerating codes"
    - "explicit constructions of high rate mds array codes with optimal repair bandwidth"
    - "explicit constructions of optimal access mds codes with nearly optimal sub packetization"
    - "a new piggybacking design for systematic mds storage codes"
    - "a high rate msr code with polynomial sub packetization level"
    - "zigzag codes mds array codes with optimal rebuilding"

Connected through hyperedge HE-8 (induced by source paper "general sub packetized access optimal regenerating codes"):
  with members:
    - "a high rate msr code with polynomial sub packetization level"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "access vs bandwidth in codes for storage"
    - "on codes for optimal rebuilding access"

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)