{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:INL4EC3BTSSFC7VIQBLL3R3SM4","short_pith_number":"pith:INL4EC3B","schema_version":"1.0","canonical_sha256":"4357c20b619ca4517ea88056bdc7726714b775825f52f24d67495ab15a9b8f7d","source":{"kind":"arxiv","id":"1501.00358","version":1},"attestation_state":"computed","paper":{"title":"Comprehend DeepWalk as Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cheng Yang, Zhiyuan Liu","submitted_at":"2015-01-02T07:57:14Z","abstract_excerpt":"Word2vec, as an efficient tool for learning vector representation of words has shown its effectiveness in many natural language processing tasks. Mikolov et al. issued Skip-Gram and Negative Sampling model for developing this toolbox. Perozzi et al. introduced the Skip-Gram model into the study of social network for the first time, and designed an algorithm named DeepWalk for learning node embedding on a graph. We prove that the DeepWalk algorithm is actually factoring a matrix M where each entry M_{ij} is logarithm of the average probability that node i randomly walks to node j in fix steps."},"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":"1501.00358","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-02T07:57:14Z","cross_cats_sorted":[],"title_canon_sha256":"1e44285362937af317b5ac8271f28577bd803751ce592af1e4c5b433d727e020","abstract_canon_sha256":"1b777b8a0ea3146160b968cb6a2ae215faf520f30dbe25d248c6a6b5db7bca54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:09.410257Z","signature_b64":"CcHjSP9V/o4UhhX0akl1frgfZtCQcgcQYMnAKPFgVO1fKIpQb3dKqK4Xd9pPXl47pWvl8T7qtOhFQ63CAWcvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4357c20b619ca4517ea88056bdc7726714b775825f52f24d67495ab15a9b8f7d","last_reissued_at":"2026-05-18T02:30:09.409586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:09.409586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comprehend DeepWalk as Matrix Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cheng Yang, Zhiyuan Liu","submitted_at":"2015-01-02T07:57:14Z","abstract_excerpt":"Word2vec, as an efficient tool for learning vector representation of words has shown its effectiveness in many natural language processing tasks. Mikolov et al. issued Skip-Gram and Negative Sampling model for developing this toolbox. Perozzi et al. introduced the Skip-Gram model into the study of social network for the first time, and designed an algorithm named DeepWalk for learning node embedding on a graph. We prove that the DeepWalk algorithm is actually factoring a matrix M where each entry M_{ij} is logarithm of the average probability that node i randomly walks to node j in fix steps."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00358","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":"1501.00358","created_at":"2026-05-18T02:30:09.409693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00358v1","created_at":"2026-05-18T02:30:09.409693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00358","created_at":"2026-05-18T02:30:09.409693+00:00"},{"alias_kind":"pith_short_12","alias_value":"INL4EC3BTSSF","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"INL4EC3BTSSFC7VI","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"INL4EC3B","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/INL4EC3BTSSFC7VIQBLL3R3SM4","json":"https://pith.science/pith/INL4EC3BTSSFC7VIQBLL3R3SM4.json","graph_json":"https://pith.science/api/pith-number/INL4EC3BTSSFC7VIQBLL3R3SM4/graph.json","events_json":"https://pith.science/api/pith-number/INL4EC3BTSSFC7VIQBLL3R3SM4/events.json","paper":"https://pith.science/paper/INL4EC3B"},"agent_actions":{"view_html":"https://pith.science/pith/INL4EC3BTSSFC7VIQBLL3R3SM4","download_json":"https://pith.science/pith/INL4EC3BTSSFC7VIQBLL3R3SM4.json","view_paper":"https://pith.science/paper/INL4EC3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00358&json=true","fetch_graph":"https://pith.science/api/pith-number/INL4EC3BTSSFC7VIQBLL3R3SM4/graph.json","fetch_events":"https://pith.science/api/pith-number/INL4EC3BTSSFC7VIQBLL3R3SM4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/INL4EC3BTSSFC7VIQBLL3R3SM4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/INL4EC3BTSSFC7VIQBLL3R3SM4/action/storage_attestation","attest_author":"https://pith.science/pith/INL4EC3BTSSFC7VIQBLL3R3SM4/action/author_attestation","sign_citation":"https://pith.science/pith/INL4EC3BTSSFC7VIQBLL3R3SM4/action/citation_signature","submit_replication":"https://pith.science/pith/INL4EC3BTSSFC7VIQBLL3R3SM4/action/replication_record"}},"created_at":"2026-05-18T02:30:09.409693+00:00","updated_at":"2026-05-18T02:30:09.409693+00:00"}