{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XVRFDH767F6EERD4QSAT2NP2US","short_pith_number":"pith:XVRFDH76","schema_version":"1.0","canonical_sha256":"bd62519ffef97c42447c84813d35faa4803759bd6b5571742c9e97fe84a50411","source":{"kind":"arxiv","id":"1605.02115","version":2},"attestation_state":"computed","paper":{"title":"Don't Walk, Skip! Online Learning of Multi-scale Network Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Bryan Perozzi, Haochen Chen, Steven Skiena, Vivek Kulkarni","submitted_at":"2016-05-06T22:56:44Z","abstract_excerpt":"We present Walklets, a novel approach for learning multiscale representations of vertices in a network. In contrast to previous works, these representations explicitly encode multiscale vertex relationships in a way that is analytically derivable.\n  Walklets generates these multiscale relationships by subsampling short random walks on the vertices of a graph. By `skipping' over steps in each random walk, our method generates a corpus of vertex pairs which are reachable via paths of a fixed length. This corpus can then be used to learn a series of latent representations, each of which captures "},"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":"1605.02115","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-05-06T22:56:44Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"895393148faf56fbf15d497539b25258c9d236cb4a9ef2f3406a81ab15a27df1","abstract_canon_sha256":"c0aab7f32db5cd99137fd99399b6fbd1fab2ff26a4ba4c63ff0067e8a33fac4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:47.994778Z","signature_b64":"wgvFZLoVxTWKGgkfNdPQRMCEpNxLWO6pyifqeEHlpqtWqwtORnIHjEWiRR4pnniyclFnghcHeNc7a0ZlgA/mDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd62519ffef97c42447c84813d35faa4803759bd6b5571742c9e97fe84a50411","last_reissued_at":"2026-05-18T00:41:47.994113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:47.994113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Don't Walk, Skip! Online Learning of Multi-scale Network Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Bryan Perozzi, Haochen Chen, Steven Skiena, Vivek Kulkarni","submitted_at":"2016-05-06T22:56:44Z","abstract_excerpt":"We present Walklets, a novel approach for learning multiscale representations of vertices in a network. In contrast to previous works, these representations explicitly encode multiscale vertex relationships in a way that is analytically derivable.\n  Walklets generates these multiscale relationships by subsampling short random walks on the vertices of a graph. By `skipping' over steps in each random walk, our method generates a corpus of vertex pairs which are reachable via paths of a fixed length. This corpus can then be used to learn a series of latent representations, each of which captures "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02115","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":"1605.02115","created_at":"2026-05-18T00:41:47.994205+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.02115v2","created_at":"2026-05-18T00:41:47.994205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02115","created_at":"2026-05-18T00:41:47.994205+00:00"},{"alias_kind":"pith_short_12","alias_value":"XVRFDH767F6E","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XVRFDH767F6EERD4","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XVRFDH76","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.05387","citing_title":"HONEM: Learning Embedding for Higher Order Networks","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XVRFDH767F6EERD4QSAT2NP2US","json":"https://pith.science/pith/XVRFDH767F6EERD4QSAT2NP2US.json","graph_json":"https://pith.science/api/pith-number/XVRFDH767F6EERD4QSAT2NP2US/graph.json","events_json":"https://pith.science/api/pith-number/XVRFDH767F6EERD4QSAT2NP2US/events.json","paper":"https://pith.science/paper/XVRFDH76"},"agent_actions":{"view_html":"https://pith.science/pith/XVRFDH767F6EERD4QSAT2NP2US","download_json":"https://pith.science/pith/XVRFDH767F6EERD4QSAT2NP2US.json","view_paper":"https://pith.science/paper/XVRFDH76","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.02115&json=true","fetch_graph":"https://pith.science/api/pith-number/XVRFDH767F6EERD4QSAT2NP2US/graph.json","fetch_events":"https://pith.science/api/pith-number/XVRFDH767F6EERD4QSAT2NP2US/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XVRFDH767F6EERD4QSAT2NP2US/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XVRFDH767F6EERD4QSAT2NP2US/action/storage_attestation","attest_author":"https://pith.science/pith/XVRFDH767F6EERD4QSAT2NP2US/action/author_attestation","sign_citation":"https://pith.science/pith/XVRFDH767F6EERD4QSAT2NP2US/action/citation_signature","submit_replication":"https://pith.science/pith/XVRFDH767F6EERD4QSAT2NP2US/action/replication_record"}},"created_at":"2026-05-18T00:41:47.994205+00:00","updated_at":"2026-05-18T00:41:47.994205+00:00"}