{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RDGXBKNOTJVX2VQW7SBJPLKHZ5","short_pith_number":"pith:RDGXBKNO","canonical_record":{"source":{"id":"1907.04931","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-10T21:11:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8d4d98d877bb02f3585d1cc5049738195f6e5bb3d80b4a71770877df757b09f8","abstract_canon_sha256":"f293b127b79452325d74403462e5d55663e40c9217cb4935566f726ffa889d32"},"schema_version":"1.0"},"canonical_sha256":"88cd70a9ae9a6b7d5616fc8297ad47cf623f8fce0d01285a7fe668a315e9dda1","source":{"kind":"arxiv","id":"1907.04931","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04931","created_at":"2026-07-05T00:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04931v4","created_at":"2026-07-05T00:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04931","created_at":"2026-07-05T00:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"RDGXBKNOTJVX","created_at":"2026-07-05T00:40:56Z"},{"alias_kind":"pith_short_16","alias_value":"RDGXBKNOTJVX2VQW","created_at":"2026-07-05T00:40:56Z"},{"alias_kind":"pith_short_8","alias_value":"RDGXBKNO","created_at":"2026-07-05T00:40:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RDGXBKNOTJVX2VQW7SBJPLKHZ5","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04931","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-10T21:11:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8d4d98d877bb02f3585d1cc5049738195f6e5bb3d80b4a71770877df757b09f8","abstract_canon_sha256":"f293b127b79452325d74403462e5d55663e40c9217cb4935566f726ffa889d32"},"schema_version":"1.0"},"canonical_sha256":"88cd70a9ae9a6b7d5616fc8297ad47cf623f8fce0d01285a7fe668a315e9dda1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:56.819424Z","signature_b64":"AKVnnAUPdKOawO31KQWdd9grH/tKS1ESPOgsuVbDG4LoBt3lUtOF9chlCuhFTUqo4u1Bwkq0SifsYBz6F93CCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88cd70a9ae9a6b7d5616fc8297ad47cf623f8fce0d01285a7fe668a315e9dda1","last_reissued_at":"2026-07-05T00:40:56.818914Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:56.818914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04931","source_version":4,"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-05T00:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HbregZefho9189i2jAMgt3A4lh6tLahkL95VavHcS9BTqlr/svTeaVbQj+Wj4nC3V6NqG7D+kodDyFR/CAYTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:15:36.724259Z"},"content_sha256":"0c0862f41901107eb9dcdb143e20be4a70d1f20ac5b770f0d0224037df4b29cd","schema_version":"1.0","event_id":"sha256:0c0862f41901107eb9dcdb143e20be4a70d1f20ac5b770f0d0224037df4b29cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RDGXBKNOTJVX2VQW7SBJPLKHZ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ajitesh Srivastava, Hanqing Zeng, Hongkuan Zhou, Rajgopal Kannan, Viktor Prasanna","submitted_at":"2019-07-10T21:11:13Z","abstract_excerpt":"Graph Convolutional Networks (GCNs) are powerful models for learning representations of attributed graphs. To scale GCNs to large graphs, state-of-the-art methods use various layer sampling techniques to alleviate the \"neighbor explosion\" problem during minibatch training. We propose GraphSAINT, a graph sampling based inductive learning method that improves training efficiency and accuracy in a fundamentally different way. By changing perspective, GraphSAINT constructs minibatches by sampling the training graph, rather than the nodes or edges across GCN layers. Each iteration, a complete GCN i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04931","kind":"arxiv","version":4},"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/1907.04931/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-05T00:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vMte0I4ZaBZtLVXK0BH8mfj/nhV2lv17XZFW3sVq1XexWVSbePDUiJaZiZLmmYqYlV7N2E9yLBxWkcPi9nxRDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T03:15:36.725127Z"},"content_sha256":"bc2163da337447ef148f0a879b1505b0b768b4bc873cbce2baec09abf57aebae","schema_version":"1.0","event_id":"sha256:bc2163da337447ef148f0a879b1505b0b768b4bc873cbce2baec09abf57aebae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDGXBKNOTJVX2VQW7SBJPLKHZ5/bundle.json","state_url":"https://pith.science/pith/RDGXBKNOTJVX2VQW7SBJPLKHZ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDGXBKNOTJVX2VQW7SBJPLKHZ5/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-10T03:15:36Z","links":{"resolver":"https://pith.science/pith/RDGXBKNOTJVX2VQW7SBJPLKHZ5","bundle":"https://pith.science/pith/RDGXBKNOTJVX2VQW7SBJPLKHZ5/bundle.json","state":"https://pith.science/pith/RDGXBKNOTJVX2VQW7SBJPLKHZ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDGXBKNOTJVX2VQW7SBJPLKHZ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RDGXBKNOTJVX2VQW7SBJPLKHZ5","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":"f293b127b79452325d74403462e5d55663e40c9217cb4935566f726ffa889d32","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-10T21:11:13Z","title_canon_sha256":"8d4d98d877bb02f3585d1cc5049738195f6e5bb3d80b4a71770877df757b09f8"},"schema_version":"1.0","source":{"id":"1907.04931","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04931","created_at":"2026-07-05T00:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04931v4","created_at":"2026-07-05T00:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04931","created_at":"2026-07-05T00:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"RDGXBKNOTJVX","created_at":"2026-07-05T00:40:56Z"},{"alias_kind":"pith_short_16","alias_value":"RDGXBKNOTJVX2VQW","created_at":"2026-07-05T00:40:56Z"},{"alias_kind":"pith_short_8","alias_value":"RDGXBKNO","created_at":"2026-07-05T00:40:56Z"}],"graph_snapshots":[{"event_id":"sha256:bc2163da337447ef148f0a879b1505b0b768b4bc873cbce2baec09abf57aebae","target":"graph","created_at":"2026-07-05T00:40:56Z","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/1907.04931/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Convolutional Networks (GCNs) are powerful models for learning representations of attributed graphs. To scale GCNs to large graphs, state-of-the-art methods use various layer sampling techniques to alleviate the \"neighbor explosion\" problem during minibatch training. We propose GraphSAINT, a graph sampling based inductive learning method that improves training efficiency and accuracy in a fundamentally different way. By changing perspective, GraphSAINT constructs minibatches by sampling the training graph, rather than the nodes or edges across GCN layers. Each iteration, a complete GCN i","authors_text":"Ajitesh Srivastava, Hanqing Zeng, Hongkuan Zhou, Rajgopal Kannan, Viktor Prasanna","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-10T21:11:13Z","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04931","kind":"arxiv","version":4},"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:0c0862f41901107eb9dcdb143e20be4a70d1f20ac5b770f0d0224037df4b29cd","target":"record","created_at":"2026-07-05T00:40:56Z","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":"f293b127b79452325d74403462e5d55663e40c9217cb4935566f726ffa889d32","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-10T21:11:13Z","title_canon_sha256":"8d4d98d877bb02f3585d1cc5049738195f6e5bb3d80b4a71770877df757b09f8"},"schema_version":"1.0","source":{"id":"1907.04931","kind":"arxiv","version":4}},"canonical_sha256":"88cd70a9ae9a6b7d5616fc8297ad47cf623f8fce0d01285a7fe668a315e9dda1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88cd70a9ae9a6b7d5616fc8297ad47cf623f8fce0d01285a7fe668a315e9dda1","first_computed_at":"2026-07-05T00:40:56.818914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:40:56.818914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AKVnnAUPdKOawO31KQWdd9grH/tKS1ESPOgsuVbDG4LoBt3lUtOF9chlCuhFTUqo4u1Bwkq0SifsYBz6F93CCA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:40:56.819424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04931","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c0862f41901107eb9dcdb143e20be4a70d1f20ac5b770f0d0224037df4b29cd","sha256:bc2163da337447ef148f0a879b1505b0b768b4bc873cbce2baec09abf57aebae"],"state_sha256":"5dfeea4d052a64831b0335bcae158b295e79d27abb9d2f873a7c5e8f0b9aa301"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j6j5TBLBEdaZpb29JgMji02OL0lsGLOgDYjooQg1G6rUWu9y4r+4/xRNpDw4cEVKi0vYVcHncSVRZ157+ya3BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T03:15:36.731506Z","bundle_sha256":"45521711b609d7aaf191d41c5faf513815b9ec52e1728422fffc69d5a239160b"}}