{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3AS3KQ7MSHFMMESBVAADCCSV2N","short_pith_number":"pith:3AS3KQ7M","schema_version":"1.0","canonical_sha256":"d825b543ec91cac61241a800310a55d35a7762b32b55a947727e5ec04dd255f8","source":{"kind":"arxiv","id":"2305.09887","version":1},"attestation_state":"computed","paper":{"title":"Simplifying Distributed Neural Network Training on Massive Graphs: Randomized Partitions Improve Model Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Aishwarya Reganti, Charles Dickens, Danai Koutra, Edward Huang, Jiong Zhu, Karthik Subbian, Nikhil Rao","submitted_at":"2023-05-17T01:49:44Z","abstract_excerpt":"Distributed training of GNNs enables learning on massive graphs (e.g., social and e-commerce networks) that exceed the storage and computational capacity of a single machine. To reach performance comparable to centralized training, distributed frameworks focus on maximally recovering cross-instance node dependencies with either communication across instances or periodic fallback to centralized training, which create overhead and limit the framework scalability. In this work, we present a simplified framework for distributed GNN training that does not rely on the aforementioned costly operation"},"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":"2305.09887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-17T01:49:44Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6a4475ab8ebc8f27f1c393d00ee3952c0939a51c6461964d75a1334c77055a73","abstract_canon_sha256":"ef6623056328342fedc2dbe423a3e2407e5899ffc3f53df1cb4c50450b6a99df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:11:06.775307Z","signature_b64":"yAfZbI5eS8CuULwCJ9yEUbk30yS5KK+lWGQfQZud5RNyIXo227TTGpXBUQ9jOYSV94L7H42Lhln5LLExYgs3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d825b543ec91cac61241a800310a55d35a7762b32b55a947727e5ec04dd255f8","last_reissued_at":"2026-07-05T06:11:06.774921Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:11:06.774921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplifying Distributed Neural Network Training on Massive Graphs: Randomized Partitions Improve Model Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Aishwarya Reganti, Charles Dickens, Danai Koutra, Edward Huang, Jiong Zhu, Karthik Subbian, Nikhil Rao","submitted_at":"2023-05-17T01:49:44Z","abstract_excerpt":"Distributed training of GNNs enables learning on massive graphs (e.g., social and e-commerce networks) that exceed the storage and computational capacity of a single machine. To reach performance comparable to centralized training, distributed frameworks focus on maximally recovering cross-instance node dependencies with either communication across instances or periodic fallback to centralized training, which create overhead and limit the framework scalability. In this work, we present a simplified framework for distributed GNN training that does not rely on the aforementioned costly operation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.09887","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.09887/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":"2305.09887","created_at":"2026-07-05T06:11:06.774977+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.09887v1","created_at":"2026-07-05T06:11:06.774977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.09887","created_at":"2026-07-05T06:11:06.774977+00:00"},{"alias_kind":"pith_short_12","alias_value":"3AS3KQ7MSHFM","created_at":"2026-07-05T06:11:06.774977+00:00"},{"alias_kind":"pith_short_16","alias_value":"3AS3KQ7MSHFMMESB","created_at":"2026-07-05T06:11:06.774977+00:00"},{"alias_kind":"pith_short_8","alias_value":"3AS3KQ7M","created_at":"2026-07-05T06:11:06.774977+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/3AS3KQ7MSHFMMESBVAADCCSV2N","json":"https://pith.science/pith/3AS3KQ7MSHFMMESBVAADCCSV2N.json","graph_json":"https://pith.science/api/pith-number/3AS3KQ7MSHFMMESBVAADCCSV2N/graph.json","events_json":"https://pith.science/api/pith-number/3AS3KQ7MSHFMMESBVAADCCSV2N/events.json","paper":"https://pith.science/paper/3AS3KQ7M"},"agent_actions":{"view_html":"https://pith.science/pith/3AS3KQ7MSHFMMESBVAADCCSV2N","download_json":"https://pith.science/pith/3AS3KQ7MSHFMMESBVAADCCSV2N.json","view_paper":"https://pith.science/paper/3AS3KQ7M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.09887&json=true","fetch_graph":"https://pith.science/api/pith-number/3AS3KQ7MSHFMMESBVAADCCSV2N/graph.json","fetch_events":"https://pith.science/api/pith-number/3AS3KQ7MSHFMMESBVAADCCSV2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3AS3KQ7MSHFMMESBVAADCCSV2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3AS3KQ7MSHFMMESBVAADCCSV2N/action/storage_attestation","attest_author":"https://pith.science/pith/3AS3KQ7MSHFMMESBVAADCCSV2N/action/author_attestation","sign_citation":"https://pith.science/pith/3AS3KQ7MSHFMMESBVAADCCSV2N/action/citation_signature","submit_replication":"https://pith.science/pith/3AS3KQ7MSHFMMESBVAADCCSV2N/action/replication_record"}},"created_at":"2026-07-05T06:11:06.774977+00:00","updated_at":"2026-07-05T06:11:06.774977+00:00"}