{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:5XPF6IDPC6DT3URLX2V6MUSQV3","short_pith_number":"pith:5XPF6IDP","schema_version":"1.0","canonical_sha256":"edde5f206f17873dd22bbeabe65250aef68e538c6b1265f9c21a0f633fe60568","source":{"kind":"arxiv","id":"2008.11359","version":2},"attestation_state":"computed","paper":{"title":"FeatGraph: A Flexible and Efficient Backend for Graph Neural Network Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Da Zheng, Jiali Yu, Minjie Wang, Mu Li, Yida Wang, Yuwei Hu, Zheng Zhang, Zhiru Zhang, Zihao Ye","submitted_at":"2020-08-26T03:17:05Z","abstract_excerpt":"Graph neural networks (GNNs) are gaining increasing popularity as a promising approach to machine learning on graphs. Unlike traditional graph workloads where each vertex/edge is associated with a scalar, GNNs attach a feature tensor to each vertex/edge. This additional feature dimension, along with consequently more complex vertex- and edge-wise computations, has enormous implications on locality and parallelism, which existing graph processing systems fail to exploit.\n  This paper proposes FeatGraph to accelerate GNN workloads by co-optimizing graph traversal and feature dimension computatio"},"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":"2008.11359","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-08-26T03:17:05Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"b425ee98b0f76c73249936408d43c00dfed91418ae9a9a344602d642c8e694c9","abstract_canon_sha256":"94693ee77098f61fe30a6bb2a8884aff305ba5d8bb76f689ffb746be916039eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:38:40.377772Z","signature_b64":"P+tpD4N3bjcG1bwErMyuW47is0RHPm2arMZKD45yadqNYD30blRWoY5MIOkUK/h61nkXFiDouopSmtj+tcEtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edde5f206f17873dd22bbeabe65250aef68e538c6b1265f9c21a0f633fe60568","last_reissued_at":"2026-07-05T01:38:40.377365Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:38:40.377365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FeatGraph: A Flexible and Efficient Backend for Graph Neural Network Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Da Zheng, Jiali Yu, Minjie Wang, Mu Li, Yida Wang, Yuwei Hu, Zheng Zhang, Zhiru Zhang, Zihao Ye","submitted_at":"2020-08-26T03:17:05Z","abstract_excerpt":"Graph neural networks (GNNs) are gaining increasing popularity as a promising approach to machine learning on graphs. Unlike traditional graph workloads where each vertex/edge is associated with a scalar, GNNs attach a feature tensor to each vertex/edge. This additional feature dimension, along with consequently more complex vertex- and edge-wise computations, has enormous implications on locality and parallelism, which existing graph processing systems fail to exploit.\n  This paper proposes FeatGraph to accelerate GNN workloads by co-optimizing graph traversal and feature dimension computatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.11359","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/2008.11359/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":"2008.11359","created_at":"2026-07-05T01:38:40.377424+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.11359v2","created_at":"2026-07-05T01:38:40.377424+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.11359","created_at":"2026-07-05T01:38:40.377424+00:00"},{"alias_kind":"pith_short_12","alias_value":"5XPF6IDPC6DT","created_at":"2026-07-05T01:38:40.377424+00:00"},{"alias_kind":"pith_short_16","alias_value":"5XPF6IDPC6DT3URL","created_at":"2026-07-05T01:38:40.377424+00:00"},{"alias_kind":"pith_short_8","alias_value":"5XPF6IDP","created_at":"2026-07-05T01:38:40.377424+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5XPF6IDPC6DT3URLX2V6MUSQV3","json":"https://pith.science/pith/5XPF6IDPC6DT3URLX2V6MUSQV3.json","graph_json":"https://pith.science/api/pith-number/5XPF6IDPC6DT3URLX2V6MUSQV3/graph.json","events_json":"https://pith.science/api/pith-number/5XPF6IDPC6DT3URLX2V6MUSQV3/events.json","paper":"https://pith.science/paper/5XPF6IDP"},"agent_actions":{"view_html":"https://pith.science/pith/5XPF6IDPC6DT3URLX2V6MUSQV3","download_json":"https://pith.science/pith/5XPF6IDPC6DT3URLX2V6MUSQV3.json","view_paper":"https://pith.science/paper/5XPF6IDP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.11359&json=true","fetch_graph":"https://pith.science/api/pith-number/5XPF6IDPC6DT3URLX2V6MUSQV3/graph.json","fetch_events":"https://pith.science/api/pith-number/5XPF6IDPC6DT3URLX2V6MUSQV3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5XPF6IDPC6DT3URLX2V6MUSQV3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5XPF6IDPC6DT3URLX2V6MUSQV3/action/storage_attestation","attest_author":"https://pith.science/pith/5XPF6IDPC6DT3URLX2V6MUSQV3/action/author_attestation","sign_citation":"https://pith.science/pith/5XPF6IDPC6DT3URLX2V6MUSQV3/action/citation_signature","submit_replication":"https://pith.science/pith/5XPF6IDPC6DT3URLX2V6MUSQV3/action/replication_record"}},"created_at":"2026-07-05T01:38:40.377424+00:00","updated_at":"2026-07-05T01:38:40.377424+00:00"}