{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3DL2MYE2IPYVWCNQLTG3WJB62M","short_pith_number":"pith:3DL2MYE2","schema_version":"1.0","canonical_sha256":"d8d7a6609a43f15b09b05ccdbb243ed32fc01355cb80d42db6294701c0214ec8","source":{"kind":"arxiv","id":"1805.00280","version":1},"attestation_state":"computed","paper":{"title":"Efficient Graph Computation for Node2Vec","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dongyan Zhou, Shimin Chen, Songjie Niu","submitted_at":"2018-05-01T12:01:10Z","abstract_excerpt":"Node2Vec is a state-of-the-art general-purpose feature learning method for network analysis. However, current solutions cannot run Node2Vec on large-scale graphs with billions of vertices and edges, which are common in real-world applications. The existing distributed Node2Vec on Spark incurs significant space and time overhead. It runs out of memory even for mid-sized graphs with millions of vertices. Moreover, it considers at most 30 edges for every vertex in generating random walks, causing poor result quality. In this paper, we propose Fast-Node2Vec, a family of efficient Node2Vec random w"},"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":"1805.00280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-01T12:01:10Z","cross_cats_sorted":[],"title_canon_sha256":"9816c9e458cb627539f728fdf3be51d24bdbced64725d8d6270682531dbb17e8","abstract_canon_sha256":"e2bc174e7e145cd682ac575134c1f2f1ca871bef2a3071efba4ac55bb34deb62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:10.065021Z","signature_b64":"vJXZbvWIIh+t3TU30+CcKzFc/JtUUNEJK03B4IR/wTVj1iqe1syt1YSUlAibrphJUIj+eOocLbs6zQUVnrCWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8d7a6609a43f15b09b05ccdbb243ed32fc01355cb80d42db6294701c0214ec8","last_reissued_at":"2026-05-18T00:17:10.064400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:10.064400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Graph Computation for Node2Vec","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dongyan Zhou, Shimin Chen, Songjie Niu","submitted_at":"2018-05-01T12:01:10Z","abstract_excerpt":"Node2Vec is a state-of-the-art general-purpose feature learning method for network analysis. However, current solutions cannot run Node2Vec on large-scale graphs with billions of vertices and edges, which are common in real-world applications. The existing distributed Node2Vec on Spark incurs significant space and time overhead. It runs out of memory even for mid-sized graphs with millions of vertices. Moreover, it considers at most 30 edges for every vertex in generating random walks, causing poor result quality. In this paper, we propose Fast-Node2Vec, a family of efficient Node2Vec random w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00280","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.00280","created_at":"2026-05-18T00:17:10.064511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.00280v1","created_at":"2026-05-18T00:17:10.064511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00280","created_at":"2026-05-18T00:17:10.064511+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DL2MYE2IPYV","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DL2MYE2IPYVWCNQ","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DL2MYE2","created_at":"2026-05-18T12:32:02.567920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.09419","citing_title":"NOMAD: Generating Embeddings for Massive Distributed Graphs","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3DL2MYE2IPYVWCNQLTG3WJB62M","json":"https://pith.science/pith/3DL2MYE2IPYVWCNQLTG3WJB62M.json","graph_json":"https://pith.science/api/pith-number/3DL2MYE2IPYVWCNQLTG3WJB62M/graph.json","events_json":"https://pith.science/api/pith-number/3DL2MYE2IPYVWCNQLTG3WJB62M/events.json","paper":"https://pith.science/paper/3DL2MYE2"},"agent_actions":{"view_html":"https://pith.science/pith/3DL2MYE2IPYVWCNQLTG3WJB62M","download_json":"https://pith.science/pith/3DL2MYE2IPYVWCNQLTG3WJB62M.json","view_paper":"https://pith.science/paper/3DL2MYE2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.00280&json=true","fetch_graph":"https://pith.science/api/pith-number/3DL2MYE2IPYVWCNQLTG3WJB62M/graph.json","fetch_events":"https://pith.science/api/pith-number/3DL2MYE2IPYVWCNQLTG3WJB62M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DL2MYE2IPYVWCNQLTG3WJB62M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DL2MYE2IPYVWCNQLTG3WJB62M/action/storage_attestation","attest_author":"https://pith.science/pith/3DL2MYE2IPYVWCNQLTG3WJB62M/action/author_attestation","sign_citation":"https://pith.science/pith/3DL2MYE2IPYVWCNQLTG3WJB62M/action/citation_signature","submit_replication":"https://pith.science/pith/3DL2MYE2IPYVWCNQLTG3WJB62M/action/replication_record"}},"created_at":"2026-05-18T00:17:10.064511+00:00","updated_at":"2026-05-18T00:17:10.064511+00:00"}