{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XZXVXDVYH2IJGCKNUCGBWIUGYE","short_pith_number":"pith:XZXVXDVY","canonical_record":{"source":{"id":"1706.02216","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-07T14:51:05Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"c532aa4fa5d89f73da98c8052640ee17c1bde47c7def737ab2fc8ead76e698e6","abstract_canon_sha256":"fd6b3de294c4470c0062c8f796be3eea56c857ca76e83b8df7ed0d6796f4b1e9"},"schema_version":"1.0"},"canonical_sha256":"be6f5b8eb83e9093094da08c1b2286c138df194417ef67eb5c0d5d8cfb939594","source":{"kind":"arxiv","id":"1706.02216","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02216","created_at":"2026-05-18T00:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02216v4","created_at":"2026-05-18T00:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02216","created_at":"2026-05-18T00:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"XZXVXDVYH2IJ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XZXVXDVYH2IJGCKN","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XZXVXDVY","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XZXVXDVYH2IJGCKNUCGBWIUGYE","target":"record","payload":{"canonical_record":{"source":{"id":"1706.02216","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-07T14:51:05Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"c532aa4fa5d89f73da98c8052640ee17c1bde47c7def737ab2fc8ead76e698e6","abstract_canon_sha256":"fd6b3de294c4470c0062c8f796be3eea56c857ca76e83b8df7ed0d6796f4b1e9"},"schema_version":"1.0"},"canonical_sha256":"be6f5b8eb83e9093094da08c1b2286c138df194417ef67eb5c0d5d8cfb939594","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:12.393553Z","signature_b64":"oiw9FqqwfPJkFtbpa0OJ4v5q/UhZqEwVwoiSxkWH/LWm1sM4QIpaVA6riLpw3RbQBRfMXAb7GVV1CPuB7xXnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be6f5b8eb83e9093094da08c1b2286c138df194417ef67eb5c0d5d8cfb939594","last_reissued_at":"2026-05-18T00:06:12.392969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:12.392969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.02216","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-05-18T00:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bq2U2DcmGckVpgmTtw36FyjCaHDEWQXpSzgEl7XP711Q/XI7j4bNiRWeIpFH1KrZPLPteUoKY1qbu2d4zQppBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:25:33.243065Z"},"content_sha256":"8527cf9ac325114ee03df8c4ddd6d69aa552a7cfa339e10837444cebc6233b7b","schema_version":"1.0","event_id":"sha256:8527cf9ac325114ee03df8c4ddd6d69aa552a7cfa339e10837444cebc6233b7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XZXVXDVYH2IJGCKNUCGBWIUGYE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inductive Representation Learning on Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Jure Leskovec, Rex Ying, William L. Hamilton","submitted_at":"2017-06-07T14:51:05Z","abstract_excerpt":"Low-dimensional embeddings of nodes in large graphs have proved extremely useful in a variety of prediction tasks, from content recommendation to identifying protein functions. However, most existing approaches require that all nodes in the graph are present during training of the embeddings; these previous approaches are inherently transductive and do not naturally generalize to unseen nodes. Here we present GraphSAGE, a general, inductive framework that leverages node feature information (e.g., text attributes) to efficiently generate node embeddings for previously unseen data. Instead of tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02216","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":""},"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-18T00:06:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NHn83MIFilSgz7oUYGQF4v6j+pOw0VW7USpqba/SoS34UCZ9D0phECA8tcq/UHaSxDarLklkYWeu/Utsln5GBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:25:33.243417Z"},"content_sha256":"f7f492521669deed72053b4ad2e5ebcf244fda82d7241b53b3470f50862c4845","schema_version":"1.0","event_id":"sha256:f7f492521669deed72053b4ad2e5ebcf244fda82d7241b53b3470f50862c4845"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XZXVXDVYH2IJGCKNUCGBWIUGYE/bundle.json","state_url":"https://pith.science/pith/XZXVXDVYH2IJGCKNUCGBWIUGYE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XZXVXDVYH2IJGCKNUCGBWIUGYE/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-04T12:25:33Z","links":{"resolver":"https://pith.science/pith/XZXVXDVYH2IJGCKNUCGBWIUGYE","bundle":"https://pith.science/pith/XZXVXDVYH2IJGCKNUCGBWIUGYE/bundle.json","state":"https://pith.science/pith/XZXVXDVYH2IJGCKNUCGBWIUGYE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XZXVXDVYH2IJGCKNUCGBWIUGYE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XZXVXDVYH2IJGCKNUCGBWIUGYE","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":"fd6b3de294c4470c0062c8f796be3eea56c857ca76e83b8df7ed0d6796f4b1e9","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-07T14:51:05Z","title_canon_sha256":"c532aa4fa5d89f73da98c8052640ee17c1bde47c7def737ab2fc8ead76e698e6"},"schema_version":"1.0","source":{"id":"1706.02216","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02216","created_at":"2026-05-18T00:06:12Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02216v4","created_at":"2026-05-18T00:06:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02216","created_at":"2026-05-18T00:06:12Z"},{"alias_kind":"pith_short_12","alias_value":"XZXVXDVYH2IJ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XZXVXDVYH2IJGCKN","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XZXVXDVY","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:f7f492521669deed72053b4ad2e5ebcf244fda82d7241b53b3470f50862c4845","target":"graph","created_at":"2026-05-18T00:06:12Z","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":"Low-dimensional embeddings of nodes in large graphs have proved extremely useful in a variety of prediction tasks, from content recommendation to identifying protein functions. However, most existing approaches require that all nodes in the graph are present during training of the embeddings; these previous approaches are inherently transductive and do not naturally generalize to unseen nodes. Here we present GraphSAGE, a general, inductive framework that leverages node feature information (e.g., text attributes) to efficiently generate node embeddings for previously unseen data. Instead of tr","authors_text":"Jure Leskovec, Rex Ying, William L. Hamilton","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-07T14:51:05Z","title":"Inductive Representation Learning on Large Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02216","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:8527cf9ac325114ee03df8c4ddd6d69aa552a7cfa339e10837444cebc6233b7b","target":"record","created_at":"2026-05-18T00:06:12Z","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":"fd6b3de294c4470c0062c8f796be3eea56c857ca76e83b8df7ed0d6796f4b1e9","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-07T14:51:05Z","title_canon_sha256":"c532aa4fa5d89f73da98c8052640ee17c1bde47c7def737ab2fc8ead76e698e6"},"schema_version":"1.0","source":{"id":"1706.02216","kind":"arxiv","version":4}},"canonical_sha256":"be6f5b8eb83e9093094da08c1b2286c138df194417ef67eb5c0d5d8cfb939594","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be6f5b8eb83e9093094da08c1b2286c138df194417ef67eb5c0d5d8cfb939594","first_computed_at":"2026-05-18T00:06:12.392969Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:12.392969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oiw9FqqwfPJkFtbpa0OJ4v5q/UhZqEwVwoiSxkWH/LWm1sM4QIpaVA6riLpw3RbQBRfMXAb7GVV1CPuB7xXnDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:12.393553Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02216","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8527cf9ac325114ee03df8c4ddd6d69aa552a7cfa339e10837444cebc6233b7b","sha256:f7f492521669deed72053b4ad2e5ebcf244fda82d7241b53b3470f50862c4845"],"state_sha256":"995ad74661cf7fe3e2aedb1d45aaa17f68efe85e06b3942ec0d1f80565f4a515"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P62haV4wIWqwk+q2kzMvRlzbDXZj1bpjBGQbydaN6n5yERHB6Rsw3Fbk+2i3qW5UrgBeZL635kmTG3IwJN8nCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T12:25:33.245404Z","bundle_sha256":"e968738d96e144831b36933fc0f3d9d495c7861c1d1a4b084004250581d685e5"}}