{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RY4YAJTKKUY5J26WOA4IWVO7RZ","short_pith_number":"pith:RY4YAJTK","schema_version":"1.0","canonical_sha256":"8e3980266a5531d4ebd670388b55df8e4a724d7946a95aaf720417a6c9200f48","source":{"kind":"arxiv","id":"1909.01315","version":2},"attestation_state":"computed","paper":{"title":"Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chao Ma, Da Zheng, George Karypis, Jinjing Zhou, Jinyang Li, Lingfan Yu, Minjie Wang, Mufei Li, Quan Gan, Tianjun Xiao, Tong He, Xiang Song, Yu Gai, Zheng Zhang, Zihao Ye","submitted_at":"2019-09-03T17:10:28Z","abstract_excerpt":"Advancing research in the emerging field of deep graph learning requires new tools to support tensor computation over graphs. In this paper, we present the design principles and implementation of Deep Graph Library (DGL). DGL distills the computational patterns of GNNs into a few generalized sparse tensor operations suitable for extensive parallelization. By advocating graph as the central programming abstraction, DGL can perform optimizations transparently. By cautiously adopting a framework-neutral design, DGL allows users to easily port and leverage the existing components across multiple d"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1909.01315","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-03T17:10:28Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"973533cd0d06abd5f689b047583fde247a86a87c98ddd5dc4d7c1ba6cc811686","abstract_canon_sha256":"da9ce96895e01d100e59b494121304f84daf5e1b5168cddb805cc441ba70d6fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-24T00:36:43.206759Z","signature_b64":"cPF6zAKaIG3ZUlWVkJLCPjT6SY5dmcCHicBjQINrx2CAAO8DdUouzpQnOtBvj+TxhlhicIJHmBG+9cP9TojQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e3980266a5531d4ebd670388b55df8e4a724d7946a95aaf720417a6c9200f48","last_reissued_at":"2026-05-24T00:36:43.203848Z","signature_status":"signed_v1","first_computed_at":"2026-05-24T00:36:43.203848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chao Ma, Da Zheng, George Karypis, Jinjing Zhou, Jinyang Li, Lingfan Yu, Minjie Wang, Mufei Li, Quan Gan, Tianjun Xiao, Tong He, Xiang Song, Yu Gai, Zheng Zhang, Zihao Ye","submitted_at":"2019-09-03T17:10:28Z","abstract_excerpt":"Advancing research in the emerging field of deep graph learning requires new tools to support tensor computation over graphs. In this paper, we present the design principles and implementation of Deep Graph Library (DGL). DGL distills the computational patterns of GNNs into a few generalized sparse tensor operations suitable for extensive parallelization. By advocating graph as the central programming abstraction, DGL can perform optimizations transparently. By cautiously adopting a framework-neutral design, DGL allows users to easily port and leverage the existing components across multiple d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01315","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.01315/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1909.01315","created_at":"2026-05-24T00:36:43.203957+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.01315v2","created_at":"2026-05-24T00:36:43.203957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01315","created_at":"2026-05-24T00:36:43.203957+00:00"},{"alias_kind":"pith_short_12","alias_value":"RY4YAJTKKUY5","created_at":"2026-05-24T00:36:43.203957+00:00"},{"alias_kind":"pith_short_16","alias_value":"RY4YAJTKKUY5J26W","created_at":"2026-05-24T00:36:43.203957+00:00"},{"alias_kind":"pith_short_8","alias_value":"RY4YAJTK","created_at":"2026-05-24T00:36:43.203957+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":23,"internal_anchor_count":23,"sample":[{"citing_arxiv_id":"2406.09333","citing_title":"Learning Spatial-Preserving Hierarchical Representations for Digital Pathology","ref_index":38,"is_internal_anchor":true},{"citing_arxiv_id":"2410.01308","citing_title":"How Hard Is It for Message-Passing GNNs to Simulate One Weisfeiler-Lehman Color-Refinement Step?","ref_index":66,"is_internal_anchor":true},{"citing_arxiv_id":"2412.10665","citing_title":"Pretrained Event Classification Model for High Energy Physics Analysis","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2404.06335","citing_title":"Software and computing for Run 3 of the ATLAS experiment at the LHC","ref_index":225,"is_internal_anchor":true},{"citing_arxiv_id":"2505.04018","citing_title":"Modal Decomposition and Identification for a Population of Structures Using Physics-Informed Graph Neural Networks and Transformers","ref_index":39,"is_internal_anchor":true},{"citing_arxiv_id":"2605.20248","citing_title":"Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification","ref_index":47,"is_internal_anchor":true},{"citing_arxiv_id":"2509.24276","citing_title":"G-reasoner: Foundation Models for Unified Reasoning over Graph-structured Knowledge","ref_index":43,"is_internal_anchor":true},{"citing_arxiv_id":"2510.01801","citing_title":"Detecting LLM-Generated Spam Reviews by Integrating Language Model Embeddings and Graph Neural Network","ref_index":44,"is_internal_anchor":true},{"citing_arxiv_id":"2511.17113","citing_title":"AutoGraphAD: Unsupervised network anomaly detection using Variational Graph Autoencoders","ref_index":54,"is_internal_anchor":true},{"citing_arxiv_id":"2105.14491","citing_title":"How Attentive are Graph Attention Networks?","ref_index":59,"is_internal_anchor":true},{"citing_arxiv_id":"2512.12642","citing_title":"Torch Geometric Pool: the PyTorch library for pooling in Graph Neural Networks","ref_index":38,"is_internal_anchor":true},{"citing_arxiv_id":"2512.20178","citing_title":"SHIRO: Near-Optimal Communication Strategies for Distributed Sparse Matrix Multiplication","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2602.22822","citing_title":"FlexMS is a flexible framework for benchmarking deep learning-based mass spectrum prediction tools in metabolomics","ref_index":52,"is_internal_anchor":true},{"citing_arxiv_id":"2604.02651","citing_title":"Communication-free Sampling and 4D Hybrid Parallelism for Scalable Mini-batch GNN Training","ref_index":44,"is_internal_anchor":true},{"citing_arxiv_id":"2604.23139","citing_title":"GreenDyGNN: Runtime-Adaptive Energy-Efficient Communication for Distributed GNN Training","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2605.00670","citing_title":"Robust Multimodal Recommendation via Graph Retrieval-Enhanced Modality Completion","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"2604.18939","citing_title":"TabEmb: Joint Semantic-Structure Embedding for Table Annotation","ref_index":128,"is_internal_anchor":true},{"citing_arxiv_id":"2604.18913","citing_title":"LogosKG: Hardware-Optimized Scalable and Interpretable Knowledge Graph Retrieval","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2604.07492","citing_title":"Cluster Attention for Graph Machine Learning","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2604.17834","citing_title":"AsyncSparse: Accelerating Sparse Matrix-Matrix Multiplication on Asynchronous GPU Architectures","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2604.15833","citing_title":"Modern Structure-Aware Simplicial Spatiotemporal Neural Network","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2604.16715","citing_title":"Scalable and Adaptive Parallel Training of Graph Transformer on Large Graphs","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"2604.19004","citing_title":"Ocean: Fast Estimation-Based Sparse General Matrix-Matrix Multiplication on GPU","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RY4YAJTKKUY5J26WOA4IWVO7RZ","json":"https://pith.science/pith/RY4YAJTKKUY5J26WOA4IWVO7RZ.json","graph_json":"https://pith.science/api/pith-number/RY4YAJTKKUY5J26WOA4IWVO7RZ/graph.json","events_json":"https://pith.science/api/pith-number/RY4YAJTKKUY5J26WOA4IWVO7RZ/events.json","paper":"https://pith.science/paper/RY4YAJTK"},"agent_actions":{"view_html":"https://pith.science/pith/RY4YAJTKKUY5J26WOA4IWVO7RZ","download_json":"https://pith.science/pith/RY4YAJTKKUY5J26WOA4IWVO7RZ.json","view_paper":"https://pith.science/paper/RY4YAJTK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.01315&json=true","fetch_graph":"https://pith.science/api/pith-number/RY4YAJTKKUY5J26WOA4IWVO7RZ/graph.json","fetch_events":"https://pith.science/api/pith-number/RY4YAJTKKUY5J26WOA4IWVO7RZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RY4YAJTKKUY5J26WOA4IWVO7RZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RY4YAJTKKUY5J26WOA4IWVO7RZ/action/storage_attestation","attest_author":"https://pith.science/pith/RY4YAJTKKUY5J26WOA4IWVO7RZ/action/author_attestation","sign_citation":"https://pith.science/pith/RY4YAJTKKUY5J26WOA4IWVO7RZ/action/citation_signature","submit_replication":"https://pith.science/pith/RY4YAJTKKUY5J26WOA4IWVO7RZ/action/replication_record"}},"created_at":"2026-05-24T00:36:43.203957+00:00","updated_at":"2026-05-24T00:36:43.203957+00:00"}