{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VDGVJCILE37CRD4JSU6BICJGWD","short_pith_number":"pith:VDGVJCIL","canonical_record":{"source":{"id":"1904.12935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-29T20:22:03Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2225809676ca5ecfc0776010c9648c79db5ff0307c3e69e14e50561e3eff67e9","abstract_canon_sha256":"272841fa5efa965d858e662e8490a2b1e3e077b06240c49b8ce053a3c0f95b77"},"schema_version":"1.0"},"canonical_sha256":"a8cd54890b26fe288f89953c140926b0e1889d40264776639acd7c8ff353f87b","source":{"kind":"arxiv","id":"1904.12935","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12935","created_at":"2026-05-17T23:47:24Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12935v1","created_at":"2026-05-17T23:47:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12935","created_at":"2026-05-17T23:47:24Z"},{"alias_kind":"pith_short_12","alias_value":"VDGVJCILE37C","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VDGVJCILE37CRD4J","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VDGVJCIL","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VDGVJCILE37CRD4JSU6BICJGWD","target":"record","payload":{"canonical_record":{"source":{"id":"1904.12935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-29T20:22:03Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2225809676ca5ecfc0776010c9648c79db5ff0307c3e69e14e50561e3eff67e9","abstract_canon_sha256":"272841fa5efa965d858e662e8490a2b1e3e077b06240c49b8ce053a3c0f95b77"},"schema_version":"1.0"},"canonical_sha256":"a8cd54890b26fe288f89953c140926b0e1889d40264776639acd7c8ff353f87b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:24.418006Z","signature_b64":"MJWI4TT3QbNYcwMnh+vmGbb/KVZmaJtXO3qFbOLHhQbKURMbS20vQYrcXTSyuwvGpdt1VW7Q8p1niHt9cbYQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8cd54890b26fe288f89953c140926b0e1889d40264776639acd7c8ff353f87b","last_reissued_at":"2026-05-17T23:47:24.417547Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:24.417547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.12935","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-05-17T23:47:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ekbxjwW9riR7qoUIqVTARGsJ0NAf64RVuUeno4FeAtg9GYpgpnQrbdxtFGV2pVjfloWRYONz2IHSGVupAk0rCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:14:11.157757Z"},"content_sha256":"9246c004a2e174a4c514ca685171cc62d77cdcf7dedc0884ce7fdd5817fb7a03","schema_version":"1.0","event_id":"sha256:9246c004a2e174a4c514ca685171cc62d77cdcf7dedc0884ce7fdd5817fb7a03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VDGVJCILE37CRD4JSU6BICJGWD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Advancing GraphSAGE with A Data-Driven Node Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jihun Oh, Joan Bruna, Kyunghyun Cho","submitted_at":"2019-04-29T20:22:03Z","abstract_excerpt":"As an efficient and scalable graph neural network, GraphSAGE has enabled an inductive capability for inferring unseen nodes or graphs by aggregating subsampled local neighborhoods and by learning in a mini-batch gradient descent fashion. The neighborhood sampling used in GraphSAGE is effective in order to improve computing and memory efficiency when inferring a batch of target nodes with diverse degrees in parallel. Despite this advantage, the default uniform sampling suffers from high variance in training and inference, leading to sub-optimum accuracy. We propose a new data-driven sampling ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12935","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":""},"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-05-17T23:47:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oXFUkjimN3GPgM9fzZPK6x4Ste10BrA+RFAeMcb+f4RVCWOp4+dxIVfW9TB4GieL+jld6jNECYTmnxDHR2swDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:14:11.158363Z"},"content_sha256":"a44b289576d831112a7ad41565202b3587e98f4bed32333153375c0c49597616","schema_version":"1.0","event_id":"sha256:a44b289576d831112a7ad41565202b3587e98f4bed32333153375c0c49597616"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VDGVJCILE37CRD4JSU6BICJGWD/bundle.json","state_url":"https://pith.science/pith/VDGVJCILE37CRD4JSU6BICJGWD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VDGVJCILE37CRD4JSU6BICJGWD/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-06-07T11:14:11Z","links":{"resolver":"https://pith.science/pith/VDGVJCILE37CRD4JSU6BICJGWD","bundle":"https://pith.science/pith/VDGVJCILE37CRD4JSU6BICJGWD/bundle.json","state":"https://pith.science/pith/VDGVJCILE37CRD4JSU6BICJGWD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VDGVJCILE37CRD4JSU6BICJGWD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VDGVJCILE37CRD4JSU6BICJGWD","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":"272841fa5efa965d858e662e8490a2b1e3e077b06240c49b8ce053a3c0f95b77","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-29T20:22:03Z","title_canon_sha256":"2225809676ca5ecfc0776010c9648c79db5ff0307c3e69e14e50561e3eff67e9"},"schema_version":"1.0","source":{"id":"1904.12935","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12935","created_at":"2026-05-17T23:47:24Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12935v1","created_at":"2026-05-17T23:47:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12935","created_at":"2026-05-17T23:47:24Z"},{"alias_kind":"pith_short_12","alias_value":"VDGVJCILE37C","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VDGVJCILE37CRD4J","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VDGVJCIL","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:a44b289576d831112a7ad41565202b3587e98f4bed32333153375c0c49597616","target":"graph","created_at":"2026-05-17T23:47:24Z","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"},"paper":{"abstract_excerpt":"As an efficient and scalable graph neural network, GraphSAGE has enabled an inductive capability for inferring unseen nodes or graphs by aggregating subsampled local neighborhoods and by learning in a mini-batch gradient descent fashion. The neighborhood sampling used in GraphSAGE is effective in order to improve computing and memory efficiency when inferring a batch of target nodes with diverse degrees in parallel. Despite this advantage, the default uniform sampling suffers from high variance in training and inference, leading to sub-optimum accuracy. We propose a new data-driven sampling ap","authors_text":"Jihun Oh, Joan Bruna, Kyunghyun Cho","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-29T20:22:03Z","title":"Advancing GraphSAGE with A Data-Driven Node Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12935","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:9246c004a2e174a4c514ca685171cc62d77cdcf7dedc0884ce7fdd5817fb7a03","target":"record","created_at":"2026-05-17T23:47:24Z","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":"272841fa5efa965d858e662e8490a2b1e3e077b06240c49b8ce053a3c0f95b77","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-29T20:22:03Z","title_canon_sha256":"2225809676ca5ecfc0776010c9648c79db5ff0307c3e69e14e50561e3eff67e9"},"schema_version":"1.0","source":{"id":"1904.12935","kind":"arxiv","version":1}},"canonical_sha256":"a8cd54890b26fe288f89953c140926b0e1889d40264776639acd7c8ff353f87b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8cd54890b26fe288f89953c140926b0e1889d40264776639acd7c8ff353f87b","first_computed_at":"2026-05-17T23:47:24.417547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:24.417547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MJWI4TT3QbNYcwMnh+vmGbb/KVZmaJtXO3qFbOLHhQbKURMbS20vQYrcXTSyuwvGpdt1VW7Q8p1niHt9cbYQBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:24.418006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.12935","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9246c004a2e174a4c514ca685171cc62d77cdcf7dedc0884ce7fdd5817fb7a03","sha256:a44b289576d831112a7ad41565202b3587e98f4bed32333153375c0c49597616"],"state_sha256":"1a030c9ab313713a01236dae1569047cfd3c51b18ed34349f59b6c47b95660e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QAPE94tb5fAGjMNs+qu09UoWq9ge17KbJT8Gqcd+lpPvCzug8xWEu1jke1pFgcWnLeO2I7Qtmn4Zg8M7b5FoCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T11:14:11.161811Z","bundle_sha256":"0b0e8cc1dbb15717fce331ec93e1e1fc6e2928b33ce7ab762e54da87fb5edb42"}}