{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RCMKBYEXU56FUMFYJ6Z75LJIMI","short_pith_number":"pith:RCMKBYEX","canonical_record":{"source":{"id":"1811.10797","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-27T04:15:14Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0d13f5d1b0dd11dc9faad42c328ad1c518e675090f2968fbdea3fca6dee74c08","abstract_canon_sha256":"e84765fb720b72d48d1a8ece643d755bb6dec7152387ebbf8667665ab3d8db12"},"schema_version":"1.0"},"canonical_sha256":"8898a0e097a77c5a30b84fb3fead286215c35d1b20b35d17e1e98eaa71f39a6d","source":{"kind":"arxiv","id":"1811.10797","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10797","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10797v3","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10797","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"RCMKBYEXU56F","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RCMKBYEXU56FUMFY","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RCMKBYEX","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RCMKBYEXU56FUMFYJ6Z75LJIMI","target":"record","payload":{"canonical_record":{"source":{"id":"1811.10797","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-27T04:15:14Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0d13f5d1b0dd11dc9faad42c328ad1c518e675090f2968fbdea3fca6dee74c08","abstract_canon_sha256":"e84765fb720b72d48d1a8ece643d755bb6dec7152387ebbf8667665ab3d8db12"},"schema_version":"1.0"},"canonical_sha256":"8898a0e097a77c5a30b84fb3fead286215c35d1b20b35d17e1e98eaa71f39a6d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:23.444399Z","signature_b64":"tmPZSuj5Cpi7rLFDdZiRd7nPzjZ8mpOzZ4H99lYkA1mLr2zc64kFhRzH6FEf0NqnwA/B+PeFmmocLgn00H5GBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8898a0e097a77c5a30b84fb3fead286215c35d1b20b35d17e1e98eaa71f39a6d","last_reissued_at":"2026-05-17T23:43:23.443848Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:23.443848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.10797","source_version":3,"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-17T23:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fd4om5PTUee16C0LUstwvWPNk/LRonK/wRMoccck+LiA2MNuuY4Ab1Wp9SvhF9Rc8jolGzdRDqWz4qOwukApAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:05:24.154031Z"},"content_sha256":"77d48e823fd2f36c0fd0a9ec372059367bd30d84057521fa7d9b336755fce002","schema_version":"1.0","event_id":"sha256:77d48e823fd2f36c0fd0a9ec372059367bd30d84057521fa7d9b336755fce002"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RCMKBYEXU56FUMFYJ6Z75LJIMI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Node Embedding with Adaptive Similarities for Scalable Learning over Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dimitris Berberidis, Georgios B. Giannakis","submitted_at":"2018-11-27T04:15:14Z","abstract_excerpt":"Node embedding is the task of extracting informative and descriptive features over the nodes of a graph. The importance of node embeddings for graph analytics, as well as learning tasks such as node classification, link prediction and community detection, has led to increased interest on the problem leading to a number of recent advances. Much like PCA in the feature domain, node embedding is an inherently \\emph{unsupervised} task; in lack of metadata used for validation, practical methods may require standardization and limiting the use of tunable hyperparameters. Finally, node embedding meth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10797","kind":"arxiv","version":3},"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-17T23:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i66b/PfxJbtgPPZ1rRO4kJNczNtMqTByssLWy6waCIIqlInMOUeIGteXsTShe7O9ijpWWvlK+pNRgAeWUjCbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:05:24.154747Z"},"content_sha256":"b914157a672dc5ff7bcac8b24db89d5677d153495b3c8b22f716f683a34ce229","schema_version":"1.0","event_id":"sha256:b914157a672dc5ff7bcac8b24db89d5677d153495b3c8b22f716f683a34ce229"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCMKBYEXU56FUMFYJ6Z75LJIMI/bundle.json","state_url":"https://pith.science/pith/RCMKBYEXU56FUMFYJ6Z75LJIMI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCMKBYEXU56FUMFYJ6Z75LJIMI/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-27T18:05:24Z","links":{"resolver":"https://pith.science/pith/RCMKBYEXU56FUMFYJ6Z75LJIMI","bundle":"https://pith.science/pith/RCMKBYEXU56FUMFYJ6Z75LJIMI/bundle.json","state":"https://pith.science/pith/RCMKBYEXU56FUMFYJ6Z75LJIMI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCMKBYEXU56FUMFYJ6Z75LJIMI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RCMKBYEXU56FUMFYJ6Z75LJIMI","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":"e84765fb720b72d48d1a8ece643d755bb6dec7152387ebbf8667665ab3d8db12","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-27T04:15:14Z","title_canon_sha256":"0d13f5d1b0dd11dc9faad42c328ad1c518e675090f2968fbdea3fca6dee74c08"},"schema_version":"1.0","source":{"id":"1811.10797","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10797","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10797v3","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10797","created_at":"2026-05-17T23:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"RCMKBYEXU56F","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RCMKBYEXU56FUMFY","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RCMKBYEX","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:b914157a672dc5ff7bcac8b24db89d5677d153495b3c8b22f716f683a34ce229","target":"graph","created_at":"2026-05-17T23:43:23Z","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":"Node embedding is the task of extracting informative and descriptive features over the nodes of a graph. The importance of node embeddings for graph analytics, as well as learning tasks such as node classification, link prediction and community detection, has led to increased interest on the problem leading to a number of recent advances. Much like PCA in the feature domain, node embedding is an inherently \\emph{unsupervised} task; in lack of metadata used for validation, practical methods may require standardization and limiting the use of tunable hyperparameters. Finally, node embedding meth","authors_text":"Dimitris Berberidis, Georgios B. Giannakis","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-27T04:15:14Z","title":"Node Embedding with Adaptive Similarities for Scalable Learning over Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10797","kind":"arxiv","version":3},"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:77d48e823fd2f36c0fd0a9ec372059367bd30d84057521fa7d9b336755fce002","target":"record","created_at":"2026-05-17T23:43:23Z","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":"e84765fb720b72d48d1a8ece643d755bb6dec7152387ebbf8667665ab3d8db12","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-27T04:15:14Z","title_canon_sha256":"0d13f5d1b0dd11dc9faad42c328ad1c518e675090f2968fbdea3fca6dee74c08"},"schema_version":"1.0","source":{"id":"1811.10797","kind":"arxiv","version":3}},"canonical_sha256":"8898a0e097a77c5a30b84fb3fead286215c35d1b20b35d17e1e98eaa71f39a6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8898a0e097a77c5a30b84fb3fead286215c35d1b20b35d17e1e98eaa71f39a6d","first_computed_at":"2026-05-17T23:43:23.443848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:23.443848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tmPZSuj5Cpi7rLFDdZiRd7nPzjZ8mpOzZ4H99lYkA1mLr2zc64kFhRzH6FEf0NqnwA/B+PeFmmocLgn00H5GBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:23.444399Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10797","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77d48e823fd2f36c0fd0a9ec372059367bd30d84057521fa7d9b336755fce002","sha256:b914157a672dc5ff7bcac8b24db89d5677d153495b3c8b22f716f683a34ce229"],"state_sha256":"52b1b48cafe0f547f92b90570371d9d5120e1f3433a9e549b7170f3bd11ba3b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EfyPGrSU8mgHFE9qoDyMBAZuq+uhnrYcpHx4Kt4IZoNJaxjMRuDtIEGTAVngIqKCqrwaETyHieL2zKZnKggxBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:05:24.158748Z","bundle_sha256":"03d45f3b0c5f596a7a6c79b9246acc0f2f98ed884edfc3221fc59e4b695a5f5a"}}