{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EPO2YKVDHDJO7SE7F54GE24URN","short_pith_number":"pith:EPO2YKVD","schema_version":"1.0","canonical_sha256":"23ddac2aa338d2efc89f2f78626b948b5967d03c9cc996514f73147cf99e02f8","source":{"kind":"arxiv","id":"1810.08403","version":1},"attestation_state":"computed","paper":{"title":"Towards Efficient Large-Scale Graph Neural Network Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DC","authors_text":"Jilong Xue, Lidong Zhou, Lingxiao Ma, Ming Wu, Yafei Dai, Youshan Miao, Zhi Yang","submitted_at":"2018-10-19T08:50:58Z","abstract_excerpt":"Recent deep learning models have moved beyond low-dimensional regular grids such as image, video, and speech, to high-dimensional graph-structured data, such as social networks, brain connections, and knowledge graphs. This evolution has led to large graph-based irregular and sparse models that go beyond what existing deep learning frameworks are designed for. Further, these models are not easily amenable to efficient, at scale, acceleration on parallel hardwares (e.g. GPUs). We introduce NGra, the first parallel processing framework for graph-based deep neural networks (GNNs). NGra presents a"},"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":"1810.08403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-19T08:50:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"befce75957e90d22d1ecce752b0e024d523671af484e4dec504d5dfe5bbef96a","abstract_canon_sha256":"e3e024aef2c80f565847b93f9acd2802d5b4a37485beaf382a4d0a796cfc0d5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:48.206020Z","signature_b64":"M+M1o45GJoT/F2IwHjMukb+33oR6KYTwfkIQUC74Z3Wn8WIQVNJU4plVTECqwvhx0NO8XGAwavWZLYres+9MAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23ddac2aa338d2efc89f2f78626b948b5967d03c9cc996514f73147cf99e02f8","last_reissued_at":"2026-05-18T00:02:48.205377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:48.205377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Efficient Large-Scale Graph Neural Network Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DC","authors_text":"Jilong Xue, Lidong Zhou, Lingxiao Ma, Ming Wu, Yafei Dai, Youshan Miao, Zhi Yang","submitted_at":"2018-10-19T08:50:58Z","abstract_excerpt":"Recent deep learning models have moved beyond low-dimensional regular grids such as image, video, and speech, to high-dimensional graph-structured data, such as social networks, brain connections, and knowledge graphs. This evolution has led to large graph-based irregular and sparse models that go beyond what existing deep learning frameworks are designed for. Further, these models are not easily amenable to efficient, at scale, acceleration on parallel hardwares (e.g. GPUs). We introduce NGra, the first parallel processing framework for graph-based deep neural networks (GNNs). NGra presents a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08403","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1810.08403","created_at":"2026-05-18T00:02:48.205497+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.08403v1","created_at":"2026-05-18T00:02:48.205497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08403","created_at":"2026-05-18T00:02:48.205497+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPO2YKVDHDJO","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPO2YKVDHDJO7SE7","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPO2YKVD","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.11786","citing_title":"Fast Training of Sparse Graph Neural Networks on Dense Hardware","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EPO2YKVDHDJO7SE7F54GE24URN","json":"https://pith.science/pith/EPO2YKVDHDJO7SE7F54GE24URN.json","graph_json":"https://pith.science/api/pith-number/EPO2YKVDHDJO7SE7F54GE24URN/graph.json","events_json":"https://pith.science/api/pith-number/EPO2YKVDHDJO7SE7F54GE24URN/events.json","paper":"https://pith.science/paper/EPO2YKVD"},"agent_actions":{"view_html":"https://pith.science/pith/EPO2YKVDHDJO7SE7F54GE24URN","download_json":"https://pith.science/pith/EPO2YKVDHDJO7SE7F54GE24URN.json","view_paper":"https://pith.science/paper/EPO2YKVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.08403&json=true","fetch_graph":"https://pith.science/api/pith-number/EPO2YKVDHDJO7SE7F54GE24URN/graph.json","fetch_events":"https://pith.science/api/pith-number/EPO2YKVDHDJO7SE7F54GE24URN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPO2YKVDHDJO7SE7F54GE24URN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPO2YKVDHDJO7SE7F54GE24URN/action/storage_attestation","attest_author":"https://pith.science/pith/EPO2YKVDHDJO7SE7F54GE24URN/action/author_attestation","sign_citation":"https://pith.science/pith/EPO2YKVDHDJO7SE7F54GE24URN/action/citation_signature","submit_replication":"https://pith.science/pith/EPO2YKVDHDJO7SE7F54GE24URN/action/replication_record"}},"created_at":"2026-05-18T00:02:48.205497+00:00","updated_at":"2026-05-18T00:02:48.205497+00:00"}