{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:NTTX3AMYSNTEUL55YLHKHYROPG","short_pith_number":"pith:NTTX3AMY","canonical_record":{"source":{"id":"2101.07706","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-19T16:12:44Z","cross_cats_sorted":[],"title_canon_sha256":"03dbacaa89f4a5c62ae089a8c4ded851060bd57d718983908af857b78ff4c00f","abstract_canon_sha256":"f154a950960a5c324b57951251204c566192e3000cb42ced071856f6f364b077"},"schema_version":"1.0"},"canonical_sha256":"6ce77d819893664a2fbdc2cea3e22e7985868d68f39b86ea818b34af819cc4a3","source":{"kind":"arxiv","id":"2101.07706","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.07706","created_at":"2026-07-05T02:08:00Z"},{"alias_kind":"arxiv_version","alias_value":"2101.07706v1","created_at":"2026-07-05T02:08:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.07706","created_at":"2026-07-05T02:08:00Z"},{"alias_kind":"pith_short_12","alias_value":"NTTX3AMYSNTE","created_at":"2026-07-05T02:08:00Z"},{"alias_kind":"pith_short_16","alias_value":"NTTX3AMYSNTEUL55","created_at":"2026-07-05T02:08:00Z"},{"alias_kind":"pith_short_8","alias_value":"NTTX3AMY","created_at":"2026-07-05T02:08:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:NTTX3AMYSNTEUL55YLHKHYROPG","target":"record","payload":{"canonical_record":{"source":{"id":"2101.07706","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-19T16:12:44Z","cross_cats_sorted":[],"title_canon_sha256":"03dbacaa89f4a5c62ae089a8c4ded851060bd57d718983908af857b78ff4c00f","abstract_canon_sha256":"f154a950960a5c324b57951251204c566192e3000cb42ced071856f6f364b077"},"schema_version":"1.0"},"canonical_sha256":"6ce77d819893664a2fbdc2cea3e22e7985868d68f39b86ea818b34af819cc4a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:08:00.534801Z","signature_b64":"oMacDKW2pheN7W1zoKcGdIE4Wmv6g/g1k1sVpdDQk7EugAmCeEr7A8ELySj7J6kg7v3TsrqtrSw2hQJ6GJZXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ce77d819893664a2fbdc2cea3e22e7985868d68f39b86ea818b34af819cc4a3","last_reissued_at":"2026-07-05T02:08:00.534381Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:08:00.534381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.07706","source_version":1,"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-05T02:08:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wEqcQjUKkCxk27DlfM8rO5G4KB2Q+IVsDoOxPWtj5V0qferUVzmgGgOobYZU28Czkzx1Kyvf3fKanTtpwjQnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:10:19.468476Z"},"content_sha256":"f57bfe897b156286f514cc0170d8d4dc39e7c538cbb3cd626baf43bf8a4a1e8c","schema_version":"1.0","event_id":"sha256:f57bfe897b156286f514cc0170d8d4dc39e7c538cbb3cd626baf43bf8a4a1e8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:NTTX3AMYSNTEUL55YLHKHYROPG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication-Efficient Sampling for Distributed Training of Graph Convolutional Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Masuma Akter Rumi, Peng Jiang","submitted_at":"2021-01-19T16:12:44Z","abstract_excerpt":"Training Graph Convolutional Networks (GCNs) is expensive as it needs to aggregate data recursively from neighboring nodes. To reduce the computation overhead, previous works have proposed various neighbor sampling methods that estimate the aggregation result based on a small number of sampled neighbors. Although these methods have successfully accelerated the training, they mainly focus on the single-machine setting. As real-world graphs are large, training GCNs in distributed systems is desirable. However, we found that the existing neighbor sampling methods do not work well in a distributed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.07706","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/2101.07706/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-05T02:08:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2gsb3s0QLVPrMqhXCzm4Zuo+Bn45lj8/iEbQMxhygL+Yi+JbLXTVkSY1QXGeApA8w6G8/asRLTLU8404k8sjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:10:19.468951Z"},"content_sha256":"9f69beda82bd9a92b5d378dfdb5d45b8f05b8d8a6702d66ad2adc29ccfc0145d","schema_version":"1.0","event_id":"sha256:9f69beda82bd9a92b5d378dfdb5d45b8f05b8d8a6702d66ad2adc29ccfc0145d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NTTX3AMYSNTEUL55YLHKHYROPG/bundle.json","state_url":"https://pith.science/pith/NTTX3AMYSNTEUL55YLHKHYROPG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NTTX3AMYSNTEUL55YLHKHYROPG/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-07T01:10:19Z","links":{"resolver":"https://pith.science/pith/NTTX3AMYSNTEUL55YLHKHYROPG","bundle":"https://pith.science/pith/NTTX3AMYSNTEUL55YLHKHYROPG/bundle.json","state":"https://pith.science/pith/NTTX3AMYSNTEUL55YLHKHYROPG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NTTX3AMYSNTEUL55YLHKHYROPG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:NTTX3AMYSNTEUL55YLHKHYROPG","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":"f154a950960a5c324b57951251204c566192e3000cb42ced071856f6f364b077","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-19T16:12:44Z","title_canon_sha256":"03dbacaa89f4a5c62ae089a8c4ded851060bd57d718983908af857b78ff4c00f"},"schema_version":"1.0","source":{"id":"2101.07706","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.07706","created_at":"2026-07-05T02:08:00Z"},{"alias_kind":"arxiv_version","alias_value":"2101.07706v1","created_at":"2026-07-05T02:08:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.07706","created_at":"2026-07-05T02:08:00Z"},{"alias_kind":"pith_short_12","alias_value":"NTTX3AMYSNTE","created_at":"2026-07-05T02:08:00Z"},{"alias_kind":"pith_short_16","alias_value":"NTTX3AMYSNTEUL55","created_at":"2026-07-05T02:08:00Z"},{"alias_kind":"pith_short_8","alias_value":"NTTX3AMY","created_at":"2026-07-05T02:08:00Z"}],"graph_snapshots":[{"event_id":"sha256:9f69beda82bd9a92b5d378dfdb5d45b8f05b8d8a6702d66ad2adc29ccfc0145d","target":"graph","created_at":"2026-07-05T02:08:00Z","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/2101.07706/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Training Graph Convolutional Networks (GCNs) is expensive as it needs to aggregate data recursively from neighboring nodes. To reduce the computation overhead, previous works have proposed various neighbor sampling methods that estimate the aggregation result based on a small number of sampled neighbors. Although these methods have successfully accelerated the training, they mainly focus on the single-machine setting. As real-world graphs are large, training GCNs in distributed systems is desirable. However, we found that the existing neighbor sampling methods do not work well in a distributed","authors_text":"Masuma Akter Rumi, Peng Jiang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-19T16:12:44Z","title":"Communication-Efficient Sampling for Distributed Training of Graph Convolutional Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.07706","kind":"arxiv","version":1},"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:f57bfe897b156286f514cc0170d8d4dc39e7c538cbb3cd626baf43bf8a4a1e8c","target":"record","created_at":"2026-07-05T02:08:00Z","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":"f154a950960a5c324b57951251204c566192e3000cb42ced071856f6f364b077","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-19T16:12:44Z","title_canon_sha256":"03dbacaa89f4a5c62ae089a8c4ded851060bd57d718983908af857b78ff4c00f"},"schema_version":"1.0","source":{"id":"2101.07706","kind":"arxiv","version":1}},"canonical_sha256":"6ce77d819893664a2fbdc2cea3e22e7985868d68f39b86ea818b34af819cc4a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ce77d819893664a2fbdc2cea3e22e7985868d68f39b86ea818b34af819cc4a3","first_computed_at":"2026-07-05T02:08:00.534381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:08:00.534381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oMacDKW2pheN7W1zoKcGdIE4Wmv6g/g1k1sVpdDQk7EugAmCeEr7A8ELySj7J6kg7v3TsrqtrSw2hQJ6GJZXBA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:08:00.534801Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.07706","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f57bfe897b156286f514cc0170d8d4dc39e7c538cbb3cd626baf43bf8a4a1e8c","sha256:9f69beda82bd9a92b5d378dfdb5d45b8f05b8d8a6702d66ad2adc29ccfc0145d"],"state_sha256":"cd81787b11b38fe5d67926216a60108b0479fa18795cea017902a84f66040ec3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eOM4yvk4XiHDLmfXLW6WMA3/NvbCMh1tEF8aa+dN48qF+BCHdOnPRJDZTrtKB39TPtdMjxbFHDDwsGwiRoY9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T01:10:19.472367Z","bundle_sha256":"9a199886516216eac1fde05eceacaa008d6f4254b8ff80efeeae7eb1148ddd73"}}