{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:P56ZMMOGGVJOGG6TMUTTDKLF77","short_pith_number":"pith:P56ZMMOG","schema_version":"1.0","canonical_sha256":"7f7d9631c63552e31bd3652731a965ffd14edcf3936d88bae1334bbc2b704a5e","source":{"kind":"arxiv","id":"2206.00057","version":2},"attestation_state":"computed","paper":{"title":"Distributed Graph Neural Network Training with Periodic Stale Representation Synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Guangji Bai, Liang Zhao, Yue Cheng, Zheng Chai","submitted_at":"2022-05-31T18:44:53Z","abstract_excerpt":"Despite the recent success of Graph Neural Networks, it remains challenging to train a GNN on large graphs with millions of nodes and billions of edges, which are prevalent in many graph-based applications. Traditional sampling-based methods accelerate GNN training by dropping edges and nodes, which impairs the graph integrity and model performance. Differently, distributed GNN algorithms accelerate GNN training by utilizing multiple computing devices and can be classified into two types: \"partition-based\" methods enjoy low communication costs but suffer from information loss due to dropped ed"},"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":"2206.00057","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-31T18:44:53Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"f4ff870e096cbf7fa443a745d60c4b0046a06f1476f7e92906bc87db12639d9e","abstract_canon_sha256":"1097a0049a7a2b518dfdf06e2540524056eccd9d10cd83b62e0bbd6deb19f97e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:02:42.661695Z","signature_b64":"/d99vgCrkVJAueADcf+V7UO9o8oOkpf9NLYsT6YZmMe4JdM5u3SgSe6Sr3d9vesYKJOAoeUxkpHKxyTVjnXnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f7d9631c63552e31bd3652731a965ffd14edcf3936d88bae1334bbc2b704a5e","last_reissued_at":"2026-07-05T05:02:42.661224Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:02:42.661224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Graph Neural Network Training with Periodic Stale Representation Synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Guangji Bai, Liang Zhao, Yue Cheng, Zheng Chai","submitted_at":"2022-05-31T18:44:53Z","abstract_excerpt":"Despite the recent success of Graph Neural Networks, it remains challenging to train a GNN on large graphs with millions of nodes and billions of edges, which are prevalent in many graph-based applications. Traditional sampling-based methods accelerate GNN training by dropping edges and nodes, which impairs the graph integrity and model performance. Differently, distributed GNN algorithms accelerate GNN training by utilizing multiple computing devices and can be classified into two types: \"partition-based\" methods enjoy low communication costs but suffer from information loss due to dropped ed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.00057","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/2206.00057/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":"2206.00057","created_at":"2026-07-05T05:02:42.661293+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.00057v2","created_at":"2026-07-05T05:02:42.661293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.00057","created_at":"2026-07-05T05:02:42.661293+00:00"},{"alias_kind":"pith_short_12","alias_value":"P56ZMMOGGVJO","created_at":"2026-07-05T05:02:42.661293+00:00"},{"alias_kind":"pith_short_16","alias_value":"P56ZMMOGGVJOGG6T","created_at":"2026-07-05T05:02:42.661293+00:00"},{"alias_kind":"pith_short_8","alias_value":"P56ZMMOG","created_at":"2026-07-05T05:02:42.661293+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.01951","citing_title":"MixGCN: Scalable GCN Training by Mixture of Parallelism and Mixture of Accelerators","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P56ZMMOGGVJOGG6TMUTTDKLF77","json":"https://pith.science/pith/P56ZMMOGGVJOGG6TMUTTDKLF77.json","graph_json":"https://pith.science/api/pith-number/P56ZMMOGGVJOGG6TMUTTDKLF77/graph.json","events_json":"https://pith.science/api/pith-number/P56ZMMOGGVJOGG6TMUTTDKLF77/events.json","paper":"https://pith.science/paper/P56ZMMOG"},"agent_actions":{"view_html":"https://pith.science/pith/P56ZMMOGGVJOGG6TMUTTDKLF77","download_json":"https://pith.science/pith/P56ZMMOGGVJOGG6TMUTTDKLF77.json","view_paper":"https://pith.science/paper/P56ZMMOG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.00057&json=true","fetch_graph":"https://pith.science/api/pith-number/P56ZMMOGGVJOGG6TMUTTDKLF77/graph.json","fetch_events":"https://pith.science/api/pith-number/P56ZMMOGGVJOGG6TMUTTDKLF77/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P56ZMMOGGVJOGG6TMUTTDKLF77/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P56ZMMOGGVJOGG6TMUTTDKLF77/action/storage_attestation","attest_author":"https://pith.science/pith/P56ZMMOGGVJOGG6TMUTTDKLF77/action/author_attestation","sign_citation":"https://pith.science/pith/P56ZMMOGGVJOGG6TMUTTDKLF77/action/citation_signature","submit_replication":"https://pith.science/pith/P56ZMMOGGVJOGG6TMUTTDKLF77/action/replication_record"}},"created_at":"2026-07-05T05:02:42.661293+00:00","updated_at":"2026-07-05T05:02:42.661293+00:00"}