{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KYKL6RAH7COL2W6DNBFDJD7PI3","short_pith_number":"pith:KYKL6RAH","schema_version":"1.0","canonical_sha256":"5614bf4407f89cbd5bc3684a348fef46d84ae8fa72c5acde8dbacc1440a1ef2d","source":{"kind":"arxiv","id":"1901.01346","version":2},"attestation_state":"computed","paper":{"title":"Efficient Representation Learning Using Random Walks for Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Docherty, Hooman Peiro Sajjad, Yuriy Tyshetskiy","submitted_at":"2019-01-05T00:35:43Z","abstract_excerpt":"An important part of many machine learning workflows on graphs is vertex representation learning, i.e., learning a low-dimensional vector representation for each vertex in the graph. Recently, several powerful techniques for unsupervised representation learning have been demonstrated to give the state-of-the-art performance in downstream tasks such as vertex classification and edge prediction. These techniques rely on random walks performed on the graph in order to capture its structural properties. These structural properties are then encoded in the vector representation space.\n  However, mos"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1901.01346","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-05T00:35:43Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"65bb4b3d4b7b30d0aadb87cc32cc040d0d49e0a129d0aaa96c46d3baf11adfc2","abstract_canon_sha256":"1b64c45c2d1122a0898fd112bedace2b53f6acb05269d96ea714972acf403696"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:53.079982Z","signature_b64":"7Nb8g6vmkQpUfy3jua9PxXx32GdqFd/2BqY/birze44JyobSQxOJ/XE30c3Nl3fstlvkY1obGB9KmfQqULjjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5614bf4407f89cbd5bc3684a348fef46d84ae8fa72c5acde8dbacc1440a1ef2d","last_reissued_at":"2026-05-17T23:55:53.079364Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:53.079364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Representation Learning Using Random Walks for Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Docherty, Hooman Peiro Sajjad, Yuriy Tyshetskiy","submitted_at":"2019-01-05T00:35:43Z","abstract_excerpt":"An important part of many machine learning workflows on graphs is vertex representation learning, i.e., learning a low-dimensional vector representation for each vertex in the graph. Recently, several powerful techniques for unsupervised representation learning have been demonstrated to give the state-of-the-art performance in downstream tasks such as vertex classification and edge prediction. These techniques rely on random walks performed on the graph in order to capture its structural properties. These structural properties are then encoded in the vector representation space.\n  However, mos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01346","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.01346","created_at":"2026-05-17T23:55:53.079475+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.01346v2","created_at":"2026-05-17T23:55:53.079475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01346","created_at":"2026-05-17T23:55:53.079475+00:00"},{"alias_kind":"pith_short_12","alias_value":"KYKL6RAH7COL","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KYKL6RAH7COL2W6D","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KYKL6RAH","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2006.10637","citing_title":"Temporal Graph Networks for Deep Learning on Dynamic Graphs","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KYKL6RAH7COL2W6DNBFDJD7PI3","json":"https://pith.science/pith/KYKL6RAH7COL2W6DNBFDJD7PI3.json","graph_json":"https://pith.science/api/pith-number/KYKL6RAH7COL2W6DNBFDJD7PI3/graph.json","events_json":"https://pith.science/api/pith-number/KYKL6RAH7COL2W6DNBFDJD7PI3/events.json","paper":"https://pith.science/paper/KYKL6RAH"},"agent_actions":{"view_html":"https://pith.science/pith/KYKL6RAH7COL2W6DNBFDJD7PI3","download_json":"https://pith.science/pith/KYKL6RAH7COL2W6DNBFDJD7PI3.json","view_paper":"https://pith.science/paper/KYKL6RAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.01346&json=true","fetch_graph":"https://pith.science/api/pith-number/KYKL6RAH7COL2W6DNBFDJD7PI3/graph.json","fetch_events":"https://pith.science/api/pith-number/KYKL6RAH7COL2W6DNBFDJD7PI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KYKL6RAH7COL2W6DNBFDJD7PI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KYKL6RAH7COL2W6DNBFDJD7PI3/action/storage_attestation","attest_author":"https://pith.science/pith/KYKL6RAH7COL2W6DNBFDJD7PI3/action/author_attestation","sign_citation":"https://pith.science/pith/KYKL6RAH7COL2W6DNBFDJD7PI3/action/citation_signature","submit_replication":"https://pith.science/pith/KYKL6RAH7COL2W6DNBFDJD7PI3/action/replication_record"}},"created_at":"2026-05-17T23:55:53.079475+00:00","updated_at":"2026-05-17T23:55:53.079475+00:00"}