{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LG52WBGBWTB7GCCAXEVXWWNL5L","short_pith_number":"pith:LG52WBGB","canonical_record":{"source":{"id":"1710.09471","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-25T21:40:57Z","cross_cats_sorted":["cs.AI","cs.LG","cs.SI"],"title_canon_sha256":"2aad1f463d568d3606f92b8eae9fee493d361701608677f9b37ec1193f8be319","abstract_canon_sha256":"f95b0759ac8d94ef7960b0f94da932108a359dc559a6f0b0ac71bb195176a381"},"schema_version":"1.0"},"canonical_sha256":"59bbab04c1b4c3f30840b92b7b59abeadfd8cedb7f39159513238a4c45864163","source":{"kind":"arxiv","id":"1710.09471","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09471","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09471v2","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09471","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"pith_short_12","alias_value":"LG52WBGBWTB7","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LG52WBGBWTB7GCCA","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LG52WBGB","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LG52WBGBWTB7GCCAXEVXWWNL5L","target":"record","payload":{"canonical_record":{"source":{"id":"1710.09471","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-25T21:40:57Z","cross_cats_sorted":["cs.AI","cs.LG","cs.SI"],"title_canon_sha256":"2aad1f463d568d3606f92b8eae9fee493d361701608677f9b37ec1193f8be319","abstract_canon_sha256":"f95b0759ac8d94ef7960b0f94da932108a359dc559a6f0b0ac71bb195176a381"},"schema_version":"1.0"},"canonical_sha256":"59bbab04c1b4c3f30840b92b7b59abeadfd8cedb7f39159513238a4c45864163","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:45.372088Z","signature_b64":"M/BYS06aSY1+822t6ldSftYMtA4I7Vxl7R1KMDXcLPJcafhf8XnBrk7xDV7WQiEI4BDoEf0SmO2zD+ht1rMXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59bbab04c1b4c3f30840b92b7b59abeadfd8cedb7f39159513238a4c45864163","last_reissued_at":"2026-05-18T00:29:45.371622Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:45.371622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.09471","source_version":2,"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:29:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"el6sIn9vnoqkFiPfbdC9+7YbYyT4A1uIm/ZlURSLMiOW4i0itzu4tUAnr2ye4i41YtzJonvFFpPRo0r/6JalDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:47:30.109791Z"},"content_sha256":"d58cd6ed803bb3ffc587b66466771f50508b21cae156c45a080a50b2e73b1fe0","schema_version":"1.0","event_id":"sha256:d58cd6ed803bb3ffc587b66466771f50508b21cae156c45a080a50b2e73b1fe0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LG52WBGBWTB7GCCAXEVXWWNL5L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inductive Representation Learning in Large Attributed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Hoda Eldardiry, John Boaz Lee, Nesreen K. Ahmed, Rong Zhou, Ryan A. Rossi, Theodore L. Willke, Xiangnan Kong","submitted_at":"2017-10-25T21:40:57Z","abstract_excerpt":"Graphs (networks) are ubiquitous and allow us to model entities (nodes) and the dependencies (edges) between them. Learning a useful feature representation from graph data lies at the heart and success of many machine learning tasks such as classification, anomaly detection, link prediction, among many others. Many existing techniques use random walks as a basis for learning features or estimating the parameters of a graph model for a downstream prediction task. Examples include recent node embedding methods such as DeepWalk, node2vec, as well as graph-based deep learning algorithms. However, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09471","kind":"arxiv","version":2},"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:29:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eplo9t4V8Torj3ZbVxpKXMH93EMans6Lcy6BOUqNI4MFnbkuWGw4ypzzJWBdzd73W6NcfqjV9CMx1dP0G+pjBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:47:30.110171Z"},"content_sha256":"26c4176d409bfdf4e0db5b9ea6b5e48e0944c419612d8cee034244bb1b7718f1","schema_version":"1.0","event_id":"sha256:26c4176d409bfdf4e0db5b9ea6b5e48e0944c419612d8cee034244bb1b7718f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LG52WBGBWTB7GCCAXEVXWWNL5L/bundle.json","state_url":"https://pith.science/pith/LG52WBGBWTB7GCCAXEVXWWNL5L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LG52WBGBWTB7GCCAXEVXWWNL5L/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-05-29T21:47:30Z","links":{"resolver":"https://pith.science/pith/LG52WBGBWTB7GCCAXEVXWWNL5L","bundle":"https://pith.science/pith/LG52WBGBWTB7GCCAXEVXWWNL5L/bundle.json","state":"https://pith.science/pith/LG52WBGBWTB7GCCAXEVXWWNL5L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LG52WBGBWTB7GCCAXEVXWWNL5L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LG52WBGBWTB7GCCAXEVXWWNL5L","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":"f95b0759ac8d94ef7960b0f94da932108a359dc559a6f0b0ac71bb195176a381","cross_cats_sorted":["cs.AI","cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-25T21:40:57Z","title_canon_sha256":"2aad1f463d568d3606f92b8eae9fee493d361701608677f9b37ec1193f8be319"},"schema_version":"1.0","source":{"id":"1710.09471","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09471","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09471v2","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09471","created_at":"2026-05-18T00:29:45Z"},{"alias_kind":"pith_short_12","alias_value":"LG52WBGBWTB7","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LG52WBGBWTB7GCCA","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LG52WBGB","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:26c4176d409bfdf4e0db5b9ea6b5e48e0944c419612d8cee034244bb1b7718f1","target":"graph","created_at":"2026-05-18T00:29: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"},"paper":{"abstract_excerpt":"Graphs (networks) are ubiquitous and allow us to model entities (nodes) and the dependencies (edges) between them. Learning a useful feature representation from graph data lies at the heart and success of many machine learning tasks such as classification, anomaly detection, link prediction, among many others. Many existing techniques use random walks as a basis for learning features or estimating the parameters of a graph model for a downstream prediction task. Examples include recent node embedding methods such as DeepWalk, node2vec, as well as graph-based deep learning algorithms. However, ","authors_text":"Hoda Eldardiry, John Boaz Lee, Nesreen K. Ahmed, Rong Zhou, Ryan A. Rossi, Theodore L. Willke, Xiangnan Kong","cross_cats":["cs.AI","cs.LG","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-25T21:40:57Z","title":"Inductive Representation Learning in Large Attributed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09471","kind":"arxiv","version":2},"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:d58cd6ed803bb3ffc587b66466771f50508b21cae156c45a080a50b2e73b1fe0","target":"record","created_at":"2026-05-18T00:29: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":"f95b0759ac8d94ef7960b0f94da932108a359dc559a6f0b0ac71bb195176a381","cross_cats_sorted":["cs.AI","cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-25T21:40:57Z","title_canon_sha256":"2aad1f463d568d3606f92b8eae9fee493d361701608677f9b37ec1193f8be319"},"schema_version":"1.0","source":{"id":"1710.09471","kind":"arxiv","version":2}},"canonical_sha256":"59bbab04c1b4c3f30840b92b7b59abeadfd8cedb7f39159513238a4c45864163","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59bbab04c1b4c3f30840b92b7b59abeadfd8cedb7f39159513238a4c45864163","first_computed_at":"2026-05-18T00:29:45.371622Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:45.371622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M/BYS06aSY1+822t6ldSftYMtA4I7Vxl7R1KMDXcLPJcafhf8XnBrk7xDV7WQiEI4BDoEf0SmO2zD+ht1rMXBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:45.372088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.09471","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d58cd6ed803bb3ffc587b66466771f50508b21cae156c45a080a50b2e73b1fe0","sha256:26c4176d409bfdf4e0db5b9ea6b5e48e0944c419612d8cee034244bb1b7718f1"],"state_sha256":"7af57b1911c9ad4901bf542a08370ad1159d36a17f77d871632709cad1ce19b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"76JCHFmBBQrabbPJTBwwfvsJN2eqfeYR4AR68gLhL+CfHBt+O6DqAsGKf26RJtyAt457QTB6eqyoqQCqLIcFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:47:30.113428Z","bundle_sha256":"c7f4c5b0b535006af9865df18ac2ceda784e18e6cf8f99face5ddb783a5acfff"}}