{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JSZ32MLP3YHJANTYCGLSHKXBFP","short_pith_number":"pith:JSZ32MLP","canonical_record":{"source":{"id":"1808.02590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-08T00:54:01Z","cross_cats_sorted":[],"title_canon_sha256":"f18f7c220fcb86f8261e37dc47e6fb3a83afd0f9721f5a49e2824109db0b7ea2","abstract_canon_sha256":"a54ab1e37882436b994adaef0f7fef58aa1bd3e980f2c6c63b7e2b5042f13fe5"},"schema_version":"1.0"},"canonical_sha256":"4cb3bd316fde0e903678119723aae12bfb4be1bfa9b58a7bfd0a3ab079541e02","source":{"kind":"arxiv","id":"1808.02590","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02590","created_at":"2026-05-18T00:08:34Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02590v1","created_at":"2026-05-18T00:08:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02590","created_at":"2026-05-18T00:08:34Z"},{"alias_kind":"pith_short_12","alias_value":"JSZ32MLP3YHJ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JSZ32MLP3YHJANTY","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JSZ32MLP","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JSZ32MLP3YHJANTYCGLSHKXBFP","target":"record","payload":{"canonical_record":{"source":{"id":"1808.02590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-08T00:54:01Z","cross_cats_sorted":[],"title_canon_sha256":"f18f7c220fcb86f8261e37dc47e6fb3a83afd0f9721f5a49e2824109db0b7ea2","abstract_canon_sha256":"a54ab1e37882436b994adaef0f7fef58aa1bd3e980f2c6c63b7e2b5042f13fe5"},"schema_version":"1.0"},"canonical_sha256":"4cb3bd316fde0e903678119723aae12bfb4be1bfa9b58a7bfd0a3ab079541e02","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:34.895268Z","signature_b64":"PBySbnMSGUVTtEwhHs9Ysw6UtcF/eqpe4QWMcNRl7vg51gtRst+5SYZy6wu/gSzXgGJOJW7k2LqjnWj9/4iBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cb3bd316fde0e903678119723aae12bfb4be1bfa9b58a7bfd0a3ab079541e02","last_reissued_at":"2026-05-18T00:08:34.894593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:34.894593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.02590","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:08:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FgHkVijYTQ+dLoZyxRsup1iH8ZjceH61hDgUasObe/SOhASHPbI3yJriR6V4GU+CuHa3T7MTo4WkhZOdWFksDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:08:59.353865Z"},"content_sha256":"749a24bfa80c5a1a053e907267c236e9352ac0f30711d3889db112a8c35b1f05","schema_version":"1.0","event_id":"sha256:749a24bfa80c5a1a053e907267c236e9352ac0f30711d3889db112a8c35b1f05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JSZ32MLP3YHJANTYCGLSHKXBFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tutorial on Network Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Bryan Perozzi, Haochen Chen, Rami Al-Rfou, Steven Skiena","submitted_at":"2018-08-08T00:54:01Z","abstract_excerpt":"Network embedding methods aim at learning low-dimensional latent representation of nodes in a network. These representations can be used as features for a wide range of tasks on graphs such as classification, clustering, link prediction, and visualization. In this survey, we give an overview of network embeddings by summarizing and categorizing recent advancements in this research field. We first discuss the desirable properties of network embeddings and briefly introduce the history of network embedding algorithms. Then, we discuss network embedding methods under different scenarios, such as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02590","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:08:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GcFnTS2L2vUsYuvw35hTcjMzUKY4qT9HArFNN5FQ9gpb9UsHEGaJoqxK6LMxcpFrxlnYvM6sMROCUA2g1ntGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:08:59.354614Z"},"content_sha256":"093f70e7482947aa0b2737221ebc5279a0cd0487cc98ae94472a42b51fc92c22","schema_version":"1.0","event_id":"sha256:093f70e7482947aa0b2737221ebc5279a0cd0487cc98ae94472a42b51fc92c22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JSZ32MLP3YHJANTYCGLSHKXBFP/bundle.json","state_url":"https://pith.science/pith/JSZ32MLP3YHJANTYCGLSHKXBFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JSZ32MLP3YHJANTYCGLSHKXBFP/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-05-25T23:08:59Z","links":{"resolver":"https://pith.science/pith/JSZ32MLP3YHJANTYCGLSHKXBFP","bundle":"https://pith.science/pith/JSZ32MLP3YHJANTYCGLSHKXBFP/bundle.json","state":"https://pith.science/pith/JSZ32MLP3YHJANTYCGLSHKXBFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JSZ32MLP3YHJANTYCGLSHKXBFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JSZ32MLP3YHJANTYCGLSHKXBFP","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":"a54ab1e37882436b994adaef0f7fef58aa1bd3e980f2c6c63b7e2b5042f13fe5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-08T00:54:01Z","title_canon_sha256":"f18f7c220fcb86f8261e37dc47e6fb3a83afd0f9721f5a49e2824109db0b7ea2"},"schema_version":"1.0","source":{"id":"1808.02590","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02590","created_at":"2026-05-18T00:08:34Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02590v1","created_at":"2026-05-18T00:08:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02590","created_at":"2026-05-18T00:08:34Z"},{"alias_kind":"pith_short_12","alias_value":"JSZ32MLP3YHJ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JSZ32MLP3YHJANTY","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JSZ32MLP","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:093f70e7482947aa0b2737221ebc5279a0cd0487cc98ae94472a42b51fc92c22","target":"graph","created_at":"2026-05-18T00:08:34Z","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":"Network embedding methods aim at learning low-dimensional latent representation of nodes in a network. These representations can be used as features for a wide range of tasks on graphs such as classification, clustering, link prediction, and visualization. In this survey, we give an overview of network embeddings by summarizing and categorizing recent advancements in this research field. We first discuss the desirable properties of network embeddings and briefly introduce the history of network embedding algorithms. Then, we discuss network embedding methods under different scenarios, such as ","authors_text":"Bryan Perozzi, Haochen Chen, Rami Al-Rfou, Steven Skiena","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-08T00:54:01Z","title":"A Tutorial on Network Embeddings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02590","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:749a24bfa80c5a1a053e907267c236e9352ac0f30711d3889db112a8c35b1f05","target":"record","created_at":"2026-05-18T00:08:34Z","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":"a54ab1e37882436b994adaef0f7fef58aa1bd3e980f2c6c63b7e2b5042f13fe5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-08-08T00:54:01Z","title_canon_sha256":"f18f7c220fcb86f8261e37dc47e6fb3a83afd0f9721f5a49e2824109db0b7ea2"},"schema_version":"1.0","source":{"id":"1808.02590","kind":"arxiv","version":1}},"canonical_sha256":"4cb3bd316fde0e903678119723aae12bfb4be1bfa9b58a7bfd0a3ab079541e02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cb3bd316fde0e903678119723aae12bfb4be1bfa9b58a7bfd0a3ab079541e02","first_computed_at":"2026-05-18T00:08:34.894593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:34.894593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PBySbnMSGUVTtEwhHs9Ysw6UtcF/eqpe4QWMcNRl7vg51gtRst+5SYZy6wu/gSzXgGJOJW7k2LqjnWj9/4iBDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:34.895268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02590","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:749a24bfa80c5a1a053e907267c236e9352ac0f30711d3889db112a8c35b1f05","sha256:093f70e7482947aa0b2737221ebc5279a0cd0487cc98ae94472a42b51fc92c22"],"state_sha256":"4cefb4b5407959d83b382f7aa7d7725666ab9ec781685a3049ec04f4a0e66d69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M3/IcF5d52TrmpzdupqGZcwROmSR2/qNCq6URsdPv5pXoYY2e3qlEcBb79sP7SCxKImtc+yzrpjgZ5EcspmQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:08:59.359059Z","bundle_sha256":"98339c1d56bba890322834982d1bb073c6f34ec996842e96a3ad6dec334388d5"}}