{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3DL2MYE2IPYVWCNQLTG3WJB62M","short_pith_number":"pith:3DL2MYE2","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"},"canonical_sha256":"d8d7a6609a43f15b09b05ccdbb243ed32fc01355cb80d42db6294701c0214ec8","source":{"kind":"arxiv","id":"1805.00280","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00280","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00280v1","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00280","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"pith_short_12","alias_value":"3DL2MYE2IPYV","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3DL2MYE2IPYVWCNQ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3DL2MYE2","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3DL2MYE2IPYVWCNQLTG3WJB62M","target":"record","payload":{"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"},"canonical_sha256":"d8d7a6609a43f15b09b05ccdbb243ed32fc01355cb80d42db6294701c0214ec8","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"},"source_kind":"arxiv","source_id":"1805.00280","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:17:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/9KOfTORMv29GRH7OyKXyqUcpYHs73rZUR6Z8Z+DAJOkCN84hIT3a57O/STxB9JhFrew0eYXXiIvgY5dV/mUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:55:29.731115Z"},"content_sha256":"8f47dab4f85a979ae4f794f6e1b786c0b0cc8b360daa7a56e4d27a418b7908ac","schema_version":"1.0","event_id":"sha256:8f47dab4f85a979ae4f794f6e1b786c0b0cc8b360daa7a56e4d27a418b7908ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3DL2MYE2IPYVWCNQLTG3WJB62M","target":"graph","payload":{"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"},"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:17:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oz0Bct19snOvRuIE5LlZ6d1dr2bkYsnb0APZKDjUXzTjZum2CQqgHIjO3V0RYv3ruIPiOXJd7pMQmnu2O4NhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:55:29.731905Z"},"content_sha256":"bb172c035976f4f18ff87c68f9d452d8a8fb3d15b5e6b304dc9d7bb9bd947a6c","schema_version":"1.0","event_id":"sha256:bb172c035976f4f18ff87c68f9d452d8a8fb3d15b5e6b304dc9d7bb9bd947a6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3DL2MYE2IPYVWCNQLTG3WJB62M/bundle.json","state_url":"https://pith.science/pith/3DL2MYE2IPYVWCNQLTG3WJB62M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3DL2MYE2IPYVWCNQLTG3WJB62M/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-12T03:55:29Z","links":{"resolver":"https://pith.science/pith/3DL2MYE2IPYVWCNQLTG3WJB62M","bundle":"https://pith.science/pith/3DL2MYE2IPYVWCNQLTG3WJB62M/bundle.json","state":"https://pith.science/pith/3DL2MYE2IPYVWCNQLTG3WJB62M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3DL2MYE2IPYVWCNQLTG3WJB62M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3DL2MYE2IPYVWCNQLTG3WJB62M","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":"e2bc174e7e145cd682ac575134c1f2f1ca871bef2a3071efba4ac55bb34deb62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-01T12:01:10Z","title_canon_sha256":"9816c9e458cb627539f728fdf3be51d24bdbced64725d8d6270682531dbb17e8"},"schema_version":"1.0","source":{"id":"1805.00280","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00280","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00280v1","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00280","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"pith_short_12","alias_value":"3DL2MYE2IPYV","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3DL2MYE2IPYVWCNQ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3DL2MYE2","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:bb172c035976f4f18ff87c68f9d452d8a8fb3d15b5e6b304dc9d7bb9bd947a6c","target":"graph","created_at":"2026-05-18T00:17:10Z","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":"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","authors_text":"Dongyan Zhou, Shimin Chen, Songjie Niu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-01T12:01:10Z","title":"Efficient Graph Computation for Node2Vec"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00280","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:8f47dab4f85a979ae4f794f6e1b786c0b0cc8b360daa7a56e4d27a418b7908ac","target":"record","created_at":"2026-05-18T00:17:10Z","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":"e2bc174e7e145cd682ac575134c1f2f1ca871bef2a3071efba4ac55bb34deb62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-01T12:01:10Z","title_canon_sha256":"9816c9e458cb627539f728fdf3be51d24bdbced64725d8d6270682531dbb17e8"},"schema_version":"1.0","source":{"id":"1805.00280","kind":"arxiv","version":1}},"canonical_sha256":"d8d7a6609a43f15b09b05ccdbb243ed32fc01355cb80d42db6294701c0214ec8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8d7a6609a43f15b09b05ccdbb243ed32fc01355cb80d42db6294701c0214ec8","first_computed_at":"2026-05-18T00:17:10.064400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:10.064400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vJXZbvWIIh+t3TU30+CcKzFc/JtUUNEJK03B4IR/wTVj1iqe1syt1YSUlAibrphJUIj+eOocLbs6zQUVnrCWAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:10.065021Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.00280","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f47dab4f85a979ae4f794f6e1b786c0b0cc8b360daa7a56e4d27a418b7908ac","sha256:bb172c035976f4f18ff87c68f9d452d8a8fb3d15b5e6b304dc9d7bb9bd947a6c"],"state_sha256":"84596587050cd61ce4d257ddcefc3333b96564e6ebde772bb63a9ac2ae08352b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R5PRm4vSy2CzQ/KHX1UhOD4LgBOLOcefxnOeYO5bsJgsEPrT8Swav3q7PZ16WXkTY8Pn0Kpkt5317gfnlvCMBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T03:55:29.736000Z","bundle_sha256":"eb9b699067d23de526362d540d6b6f6421d5629e5a944446769fd97be5fc36bc"}}