{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EZNP3BLX37VUFHY7U6FNURQAJG","short_pith_number":"pith:EZNP3BLX","canonical_record":{"source":{"id":"1709.04596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-14T02:37:52Z","cross_cats_sorted":["cs.AI","cs.LG","cs.SI"],"title_canon_sha256":"cc003633a104a696cd6f160cfe6cb79640d43f439344e78a2c58339f547d3b40","abstract_canon_sha256":"fa33aa8828e3523c680e96bec1d5d7916af5cb69344417567dc4038011aa94aa"},"schema_version":"1.0"},"canonical_sha256":"265afd8577dfeb429f1fa78ada460049876ea974bd0b4bdc579ec951939e1dbd","source":{"kind":"arxiv","id":"1709.04596","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04596","created_at":"2026-05-18T00:35:11Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04596v1","created_at":"2026-05-18T00:35:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04596","created_at":"2026-05-18T00:35:11Z"},{"alias_kind":"pith_short_12","alias_value":"EZNP3BLX37VU","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EZNP3BLX37VUFHY7","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EZNP3BLX","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EZNP3BLX37VUFHY7U6FNURQAJG","target":"record","payload":{"canonical_record":{"source":{"id":"1709.04596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-14T02:37:52Z","cross_cats_sorted":["cs.AI","cs.LG","cs.SI"],"title_canon_sha256":"cc003633a104a696cd6f160cfe6cb79640d43f439344e78a2c58339f547d3b40","abstract_canon_sha256":"fa33aa8828e3523c680e96bec1d5d7916af5cb69344417567dc4038011aa94aa"},"schema_version":"1.0"},"canonical_sha256":"265afd8577dfeb429f1fa78ada460049876ea974bd0b4bdc579ec951939e1dbd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:11.187168Z","signature_b64":"JRUzhtwt7eX6TKgGVXREPqr9b0Er0DSkNhgXJ2hueO4J5Xjw6IfdeR8Nj//9aQp6lthNeb9ELYcWvRPp2LH5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"265afd8577dfeb429f1fa78ada460049876ea974bd0b4bdc579ec951939e1dbd","last_reissued_at":"2026-05-18T00:35:11.186749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:11.186749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.04596","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-18T00:35:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6MMlmzmyIBgng2qyuDENQf8z7KJzpE8dV6ObQHnLf59qgECzfU4vszImdCkqhYa5lEcZViCm5GzLDPoi2LZWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:18:45.965099Z"},"content_sha256":"0863d92d6b19d74d10dc88044130dd67024de5390b0281c739b9c417fa183da1","schema_version":"1.0","event_id":"sha256:0863d92d6b19d74d10dc88044130dd67024de5390b0281c739b9c417fa183da1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EZNP3BLX37VUFHY7U6FNURQAJG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Framework for Generalizing Graph-based Representation Learning Methods","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-09-14T02:37:52Z","abstract_excerpt":"Random walks are at the heart of many existing deep learning algorithms for graph data. However, such algorithms have many limitations that arise from the use of random walks, e.g., the features resulting from these methods are unable to transfer to new nodes and graphs as they are tied to node identity. In this work, we introduce the notion of attributed random walks which serves as a basis for generalizing existing methods such as DeepWalk, node2vec, and many others that leverage random walks. Our proposed framework enables these methods to be more widely applicable for both transductive and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04596","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-18T00:35:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m23AJjceqRuz74NF4K09cLglZH63ZR0h02HFuLO5JTziiuFVAWlSNfsB4w8AfOx8oDjJ2EkeNOhGfHLmpykmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:18:45.965470Z"},"content_sha256":"7f05737670bea6e75345c4c7c2dbaa01087be61ddd45d2a6e3e05fbe987383f9","schema_version":"1.0","event_id":"sha256:7f05737670bea6e75345c4c7c2dbaa01087be61ddd45d2a6e3e05fbe987383f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EZNP3BLX37VUFHY7U6FNURQAJG/bundle.json","state_url":"https://pith.science/pith/EZNP3BLX37VUFHY7U6FNURQAJG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EZNP3BLX37VUFHY7U6FNURQAJG/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-05T06:18:45Z","links":{"resolver":"https://pith.science/pith/EZNP3BLX37VUFHY7U6FNURQAJG","bundle":"https://pith.science/pith/EZNP3BLX37VUFHY7U6FNURQAJG/bundle.json","state":"https://pith.science/pith/EZNP3BLX37VUFHY7U6FNURQAJG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EZNP3BLX37VUFHY7U6FNURQAJG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EZNP3BLX37VUFHY7U6FNURQAJG","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":"fa33aa8828e3523c680e96bec1d5d7916af5cb69344417567dc4038011aa94aa","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-09-14T02:37:52Z","title_canon_sha256":"cc003633a104a696cd6f160cfe6cb79640d43f439344e78a2c58339f547d3b40"},"schema_version":"1.0","source":{"id":"1709.04596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04596","created_at":"2026-05-18T00:35:11Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04596v1","created_at":"2026-05-18T00:35:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04596","created_at":"2026-05-18T00:35:11Z"},{"alias_kind":"pith_short_12","alias_value":"EZNP3BLX37VU","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EZNP3BLX37VUFHY7","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EZNP3BLX","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:7f05737670bea6e75345c4c7c2dbaa01087be61ddd45d2a6e3e05fbe987383f9","target":"graph","created_at":"2026-05-18T00:35:11Z","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":"Random walks are at the heart of many existing deep learning algorithms for graph data. However, such algorithms have many limitations that arise from the use of random walks, e.g., the features resulting from these methods are unable to transfer to new nodes and graphs as they are tied to node identity. In this work, we introduce the notion of attributed random walks which serves as a basis for generalizing existing methods such as DeepWalk, node2vec, and many others that leverage random walks. Our proposed framework enables these methods to be more widely applicable for both transductive and","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-09-14T02:37:52Z","title":"A Framework for Generalizing Graph-based Representation Learning Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04596","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:0863d92d6b19d74d10dc88044130dd67024de5390b0281c739b9c417fa183da1","target":"record","created_at":"2026-05-18T00:35:11Z","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":"fa33aa8828e3523c680e96bec1d5d7916af5cb69344417567dc4038011aa94aa","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-09-14T02:37:52Z","title_canon_sha256":"cc003633a104a696cd6f160cfe6cb79640d43f439344e78a2c58339f547d3b40"},"schema_version":"1.0","source":{"id":"1709.04596","kind":"arxiv","version":1}},"canonical_sha256":"265afd8577dfeb429f1fa78ada460049876ea974bd0b4bdc579ec951939e1dbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"265afd8577dfeb429f1fa78ada460049876ea974bd0b4bdc579ec951939e1dbd","first_computed_at":"2026-05-18T00:35:11.186749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:11.186749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JRUzhtwt7eX6TKgGVXREPqr9b0Er0DSkNhgXJ2hueO4J5Xjw6IfdeR8Nj//9aQp6lthNeb9ELYcWvRPp2LH5AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:11.187168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.04596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0863d92d6b19d74d10dc88044130dd67024de5390b0281c739b9c417fa183da1","sha256:7f05737670bea6e75345c4c7c2dbaa01087be61ddd45d2a6e3e05fbe987383f9"],"state_sha256":"8c599a666db81e7823ce82f2e4c1cdfa30d8c1938601044f4d15c7365a6d4dee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h+7ujts6y/3rRgL1hZ/yI1qbsWJmZPyM0/PGpmVraLMuN/jnOKmLzo/0txLUfeCzqPNkYuu/pHneCa9BxMcuDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:18:45.968147Z","bundle_sha256":"900204b62f109391f3048c7e5c23e299ecd7ddd461dd9308b14d078875865128"}}