{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:N6OFUMF2W4FTHUXIE6K3XOHVZ4","short_pith_number":"pith:N6OFUMF2","schema_version":"1.0","canonical_sha256":"6f9c5a30bab70b33d2e82795bbb8f5cf0fa667272d9108efc15cdaa1916b478a","source":{"kind":"arxiv","id":"1607.00653","version":1},"attestation_state":"computed","paper":{"title":"node2vec: Scalable Feature Learning for Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Aditya Grover, Jure Leskovec","submitted_at":"2016-07-03T16:09:30Z","abstract_excerpt":"Prediction tasks over nodes and edges in networks require careful effort in engineering features used by learning algorithms. Recent research in the broader field of representation learning has led to significant progress in automating prediction by learning the features themselves. However, present feature learning approaches are not expressive enough to capture the diversity of connectivity patterns observed in networks. Here we propose node2vec, an algorithmic framework for learning continuous feature representations for nodes in networks. In node2vec, we learn a mapping of nodes to a low-d"},"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":"1607.00653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-07-03T16:09:30Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"08d32bae855f1470bf001c6d68518a0ef7953db2c766356792ba470db07a869a","abstract_canon_sha256":"e9bac409222e9399899032a32a3926eb499d072af5aa0a0fd2ba6771262d6302"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:34.540551Z","signature_b64":"L6rZYKHYj5ijjOQd2+e+GhqGGuekjYjgg4UtkWKcSJpkUsJZ2D9y9cwEueabUrrnugXqPjxROIZS29x8RQULAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f9c5a30bab70b33d2e82795bbb8f5cf0fa667272d9108efc15cdaa1916b478a","last_reissued_at":"2026-05-18T01:11:34.540143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:34.540143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"node2vec: Scalable Feature Learning for Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Aditya Grover, Jure Leskovec","submitted_at":"2016-07-03T16:09:30Z","abstract_excerpt":"Prediction tasks over nodes and edges in networks require careful effort in engineering features used by learning algorithms. Recent research in the broader field of representation learning has led to significant progress in automating prediction by learning the features themselves. However, present feature learning approaches are not expressive enough to capture the diversity of connectivity patterns observed in networks. Here we propose node2vec, an algorithmic framework for learning continuous feature representations for nodes in networks. In node2vec, we learn a mapping of nodes to a low-d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00653","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":"1607.00653","created_at":"2026-05-18T01:11:34.540198+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.00653v1","created_at":"2026-05-18T01:11:34.540198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00653","created_at":"2026-05-18T01:11:34.540198+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6OFUMF2W4FT","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6OFUMF2W4FTHUXI","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6OFUMF2","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":5,"sample":[{"citing_arxiv_id":"1907.01705","citing_title":"Graph Embeddings at Scale","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"1907.07225","citing_title":"DeepTrax: Embedding Graphs of Financial Transactions","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19916","citing_title":"Fast and Featureless Node Representation Learning with Partial Pairwise Supervision","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18410","citing_title":"From Node2Vec to GPT-based GraphRAG: scientific impact prediction across graph and language models","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12511","citing_title":"Real-World Challenges in Fake News Detection: Dealing with Posts by Cold Users","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2604.20982","citing_title":"MediaGraph: A Network Theoretic Framework to Analyze Reporting Preferences in Indian News Media","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N6OFUMF2W4FTHUXIE6K3XOHVZ4","json":"https://pith.science/pith/N6OFUMF2W4FTHUXIE6K3XOHVZ4.json","graph_json":"https://pith.science/api/pith-number/N6OFUMF2W4FTHUXIE6K3XOHVZ4/graph.json","events_json":"https://pith.science/api/pith-number/N6OFUMF2W4FTHUXIE6K3XOHVZ4/events.json","paper":"https://pith.science/paper/N6OFUMF2"},"agent_actions":{"view_html":"https://pith.science/pith/N6OFUMF2W4FTHUXIE6K3XOHVZ4","download_json":"https://pith.science/pith/N6OFUMF2W4FTHUXIE6K3XOHVZ4.json","view_paper":"https://pith.science/paper/N6OFUMF2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.00653&json=true","fetch_graph":"https://pith.science/api/pith-number/N6OFUMF2W4FTHUXIE6K3XOHVZ4/graph.json","fetch_events":"https://pith.science/api/pith-number/N6OFUMF2W4FTHUXIE6K3XOHVZ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6OFUMF2W4FTHUXIE6K3XOHVZ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6OFUMF2W4FTHUXIE6K3XOHVZ4/action/storage_attestation","attest_author":"https://pith.science/pith/N6OFUMF2W4FTHUXIE6K3XOHVZ4/action/author_attestation","sign_citation":"https://pith.science/pith/N6OFUMF2W4FTHUXIE6K3XOHVZ4/action/citation_signature","submit_replication":"https://pith.science/pith/N6OFUMF2W4FTHUXIE6K3XOHVZ4/action/replication_record"}},"created_at":"2026-05-18T01:11:34.540198+00:00","updated_at":"2026-05-18T01:11:34.540198+00:00"}