{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:INL4EC3BTSSFC7VIQBLL3R3SM4","short_pith_number":"pith:INL4EC3B","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"},"canonical_sha256":"4357c20b619ca4517ea88056bdc7726714b775825f52f24d67495ab15a9b8f7d","source":{"kind":"arxiv","id":"1501.00358","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00358","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00358v1","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00358","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"pith_short_12","alias_value":"INL4EC3BTSSF","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"INL4EC3BTSSFC7VI","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"INL4EC3B","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:INL4EC3BTSSFC7VIQBLL3R3SM4","target":"record","payload":{"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"},"canonical_sha256":"4357c20b619ca4517ea88056bdc7726714b775825f52f24d67495ab15a9b8f7d","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"},"source_kind":"arxiv","source_id":"1501.00358","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-18T02:30:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CzJCnsrW42eZA2VxJg0SsYSz9dVEv6ne+xdoEtSP32tfJK1focedEkwbgLS/XtPnM6rDsOqA4RWhKDMZezUTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:30:09.906683Z"},"content_sha256":"11b048ac50f37a76bdcef832338d9bc6caad10ef319fdaedafa6b94e5e6d0428","schema_version":"1.0","event_id":"sha256:11b048ac50f37a76bdcef832338d9bc6caad10ef319fdaedafa6b94e5e6d0428"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:INL4EC3BTSSFC7VIQBLL3R3SM4","target":"graph","payload":{"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"},"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-18T02:30:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IkAbk+13pS2pm3U6rxDOASJxyMWDzAalhQwFyhHzXT7pN9cQrDYydOrP0WR4sbWjo4TyJxXKNWuSY0eAweu8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:30:09.907028Z"},"content_sha256":"996c8f1d080233399452810434b2c7dde4216212085658abf83b7756acd4702b","schema_version":"1.0","event_id":"sha256:996c8f1d080233399452810434b2c7dde4216212085658abf83b7756acd4702b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/INL4EC3BTSSFC7VIQBLL3R3SM4/bundle.json","state_url":"https://pith.science/pith/INL4EC3BTSSFC7VIQBLL3R3SM4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/INL4EC3BTSSFC7VIQBLL3R3SM4/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-05T08:30:09Z","links":{"resolver":"https://pith.science/pith/INL4EC3BTSSFC7VIQBLL3R3SM4","bundle":"https://pith.science/pith/INL4EC3BTSSFC7VIQBLL3R3SM4/bundle.json","state":"https://pith.science/pith/INL4EC3BTSSFC7VIQBLL3R3SM4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/INL4EC3BTSSFC7VIQBLL3R3SM4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:INL4EC3BTSSFC7VIQBLL3R3SM4","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":"1b777b8a0ea3146160b968cb6a2ae215faf520f30dbe25d248c6a6b5db7bca54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-02T07:57:14Z","title_canon_sha256":"1e44285362937af317b5ac8271f28577bd803751ce592af1e4c5b433d727e020"},"schema_version":"1.0","source":{"id":"1501.00358","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00358","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00358v1","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00358","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"pith_short_12","alias_value":"INL4EC3BTSSF","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"INL4EC3BTSSFC7VI","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"INL4EC3B","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:996c8f1d080233399452810434b2c7dde4216212085658abf83b7756acd4702b","target":"graph","created_at":"2026-05-18T02:30:09Z","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":"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.","authors_text":"Cheng Yang, Zhiyuan Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-02T07:57:14Z","title":"Comprehend DeepWalk as Matrix Factorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00358","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:11b048ac50f37a76bdcef832338d9bc6caad10ef319fdaedafa6b94e5e6d0428","target":"record","created_at":"2026-05-18T02:30:09Z","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":"1b777b8a0ea3146160b968cb6a2ae215faf520f30dbe25d248c6a6b5db7bca54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-01-02T07:57:14Z","title_canon_sha256":"1e44285362937af317b5ac8271f28577bd803751ce592af1e4c5b433d727e020"},"schema_version":"1.0","source":{"id":"1501.00358","kind":"arxiv","version":1}},"canonical_sha256":"4357c20b619ca4517ea88056bdc7726714b775825f52f24d67495ab15a9b8f7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4357c20b619ca4517ea88056bdc7726714b775825f52f24d67495ab15a9b8f7d","first_computed_at":"2026-05-18T02:30:09.409586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:09.409586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CcHjSP9V/o4UhhX0akl1frgfZtCQcgcQYMnAKPFgVO1fKIpQb3dKqK4Xd9pPXl47pWvl8T7qtOhFQ63CAWcvCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:09.410257Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00358","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11b048ac50f37a76bdcef832338d9bc6caad10ef319fdaedafa6b94e5e6d0428","sha256:996c8f1d080233399452810434b2c7dde4216212085658abf83b7756acd4702b"],"state_sha256":"c0ddc0b7af20ba1bed3ddd5660c19ba7597fe6da258e29f3722bd66b1eac2f2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GJdv8B+Y3hXNRvKdEQkMzgI7IINJncORR16ifwm7SDUe8zuoWSpVgHGB7OrAXfn9aATrpw3i7wRw1ZijOLUoDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T08:30:09.909324Z","bundle_sha256":"96fe77a60d2d0aba4287164c783dbe0b283f9d16cdab49df4e937152e60b2197"}}