{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:URXHFGXUOI7OERD66IAN43UZXP","short_pith_number":"pith:URXHFGXU","canonical_record":{"source":{"id":"2311.02909","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-06T06:40:43Z","cross_cats_sorted":["cs.DC","cs.PF"],"title_canon_sha256":"2f84a0326453bee7ca84b5bd0c105cbbbb8883a2abc24a1eb8a548de70323066","abstract_canon_sha256":"968e9e9f61486a2004ec5aba53ccaa90c13e79ba7d7a5e0f49504f4b26b53d8d"},"schema_version":"1.0"},"canonical_sha256":"a46e729af4723ee2447ef200de6e99bbe211374ceee8fd816a0b2c317a5c28bd","source":{"kind":"arxiv","id":"2311.02909","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.02909","created_at":"2026-07-05T08:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"2311.02909v3","created_at":"2026-07-05T08:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.02909","created_at":"2026-07-05T08:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"URXHFGXUOI7O","created_at":"2026-07-05T08:09:45Z"},{"alias_kind":"pith_short_16","alias_value":"URXHFGXUOI7OERD6","created_at":"2026-07-05T08:09:45Z"},{"alias_kind":"pith_short_8","alias_value":"URXHFGXU","created_at":"2026-07-05T08:09:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:URXHFGXUOI7OERD66IAN43UZXP","target":"record","payload":{"canonical_record":{"source":{"id":"2311.02909","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-06T06:40:43Z","cross_cats_sorted":["cs.DC","cs.PF"],"title_canon_sha256":"2f84a0326453bee7ca84b5bd0c105cbbbb8883a2abc24a1eb8a548de70323066","abstract_canon_sha256":"968e9e9f61486a2004ec5aba53ccaa90c13e79ba7d7a5e0f49504f4b26b53d8d"},"schema_version":"1.0"},"canonical_sha256":"a46e729af4723ee2447ef200de6e99bbe211374ceee8fd816a0b2c317a5c28bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:09:45.852745Z","signature_b64":"1g9mXbRtxCE0PGlJHTfuRJj+RZVsdO0pzj5s5ZqLe4+oiEg+dUyS/ifri6afLVD/G7ORH+CqxkCWautlkkCSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a46e729af4723ee2447ef200de6e99bbe211374ceee8fd816a0b2c317a5c28bd","last_reissued_at":"2026-07-05T08:09:45.852282Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:09:45.852282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.02909","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v/n51mJCHLWLdrxA9uE4ciMSm8dAklZskOrmf+CYvHsEl0XLnUm13S2iT+TNTGMukzi0PDMpgHNsgeFs2GKWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T10:09:51.449724Z"},"content_sha256":"fa9aecc687d870db1a9cc4000d0534c42f27d48da70a74f3e079a7306dbc5681","schema_version":"1.0","event_id":"sha256:fa9aecc687d870db1a9cc4000d0534c42f27d48da70a74f3e079a7306dbc5681"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:URXHFGXUOI7OERD66IAN43UZXP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Matrix-Based Sampling for Graph Neural Network Training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.PF"],"primary_cat":"cs.LG","authors_text":"Alok Tripathy, Aydin Buluc, Katherine Yelick","submitted_at":"2023-11-06T06:40:43Z","abstract_excerpt":"Graph Neural Networks (GNNs) offer a compact and computationally efficient way to learn embeddings and classifications on graph data. GNN models are frequently large, making distributed minibatch training necessary.\n  The primary contribution of this paper is new methods for reducing communication in the sampling step for distributed GNN training. Here, we propose a matrix-based bulk sampling approach that expresses sampling as a sparse matrix multiplication (SpGEMM) and samples multiple minibatches at once. When the input graph topology does not fit on a single device, our method distributes "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.02909","kind":"arxiv","version":3},"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/2311.02909/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1zf9nbEsr8a9sVLkF3I0L7MkQ3NSVyvSQhPJAGfl7eWRcYCXqV8AA1xYLVidQ3gR7fSIZGrNk1ewkKiLvYLyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T10:09:51.450247Z"},"content_sha256":"0d65c2b076de370ec11ab0d6df256d271d68c9a2fb098dc4804b2e574058df40","schema_version":"1.0","event_id":"sha256:0d65c2b076de370ec11ab0d6df256d271d68c9a2fb098dc4804b2e574058df40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/URXHFGXUOI7OERD66IAN43UZXP/bundle.json","state_url":"https://pith.science/pith/URXHFGXUOI7OERD66IAN43UZXP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/URXHFGXUOI7OERD66IAN43UZXP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-20T10:09:51Z","links":{"resolver":"https://pith.science/pith/URXHFGXUOI7OERD66IAN43UZXP","bundle":"https://pith.science/pith/URXHFGXUOI7OERD66IAN43UZXP/bundle.json","state":"https://pith.science/pith/URXHFGXUOI7OERD66IAN43UZXP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/URXHFGXUOI7OERD66IAN43UZXP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:URXHFGXUOI7OERD66IAN43UZXP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"968e9e9f61486a2004ec5aba53ccaa90c13e79ba7d7a5e0f49504f4b26b53d8d","cross_cats_sorted":["cs.DC","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-06T06:40:43Z","title_canon_sha256":"2f84a0326453bee7ca84b5bd0c105cbbbb8883a2abc24a1eb8a548de70323066"},"schema_version":"1.0","source":{"id":"2311.02909","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.02909","created_at":"2026-07-05T08:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"2311.02909v3","created_at":"2026-07-05T08:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.02909","created_at":"2026-07-05T08:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"URXHFGXUOI7O","created_at":"2026-07-05T08:09:45Z"},{"alias_kind":"pith_short_16","alias_value":"URXHFGXUOI7OERD6","created_at":"2026-07-05T08:09:45Z"},{"alias_kind":"pith_short_8","alias_value":"URXHFGXU","created_at":"2026-07-05T08:09:45Z"}],"graph_snapshots":[{"event_id":"sha256:0d65c2b076de370ec11ab0d6df256d271d68c9a2fb098dc4804b2e574058df40","target":"graph","created_at":"2026-07-05T08:09:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2311.02909/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Neural Networks (GNNs) offer a compact and computationally efficient way to learn embeddings and classifications on graph data. GNN models are frequently large, making distributed minibatch training necessary.\n  The primary contribution of this paper is new methods for reducing communication in the sampling step for distributed GNN training. Here, we propose a matrix-based bulk sampling approach that expresses sampling as a sparse matrix multiplication (SpGEMM) and samples multiple minibatches at once. When the input graph topology does not fit on a single device, our method distributes ","authors_text":"Alok Tripathy, Aydin Buluc, Katherine Yelick","cross_cats":["cs.DC","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-06T06:40:43Z","title":"Distributed Matrix-Based Sampling for Graph Neural Network Training"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.02909","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fa9aecc687d870db1a9cc4000d0534c42f27d48da70a74f3e079a7306dbc5681","target":"record","created_at":"2026-07-05T08:09:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"968e9e9f61486a2004ec5aba53ccaa90c13e79ba7d7a5e0f49504f4b26b53d8d","cross_cats_sorted":["cs.DC","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-06T06:40:43Z","title_canon_sha256":"2f84a0326453bee7ca84b5bd0c105cbbbb8883a2abc24a1eb8a548de70323066"},"schema_version":"1.0","source":{"id":"2311.02909","kind":"arxiv","version":3}},"canonical_sha256":"a46e729af4723ee2447ef200de6e99bbe211374ceee8fd816a0b2c317a5c28bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a46e729af4723ee2447ef200de6e99bbe211374ceee8fd816a0b2c317a5c28bd","first_computed_at":"2026-07-05T08:09:45.852282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:09:45.852282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1g9mXbRtxCE0PGlJHTfuRJj+RZVsdO0pzj5s5ZqLe4+oiEg+dUyS/ifri6afLVD/G7ORH+CqxkCWautlkkCSBw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:09:45.852745Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.02909","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa9aecc687d870db1a9cc4000d0534c42f27d48da70a74f3e079a7306dbc5681","sha256:0d65c2b076de370ec11ab0d6df256d271d68c9a2fb098dc4804b2e574058df40"],"state_sha256":"a157d7995c7eff7c117f21377e8c18546953c6ff982c4b5aea6bff6d5ad9ddea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5/ZOgge6MALRZqJk/MR66q6W6vzrsSsvtbc0UP3+/YXmnywQBBT5UQGqZbS3Yj09UMCgNjTmyapViQm/jxq+Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T10:09:51.457074Z","bundle_sha256":"0dcd8780bd2bf47ec729b9b6b3d927c3cc3b6c7e77f07b5f0cfef2f99864cd1d"}}