{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SKVRZT6WKMI2U77XJOMGWD4RWL","short_pith_number":"pith:SKVRZT6W","canonical_record":{"source":{"id":"1803.04742","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2018-03-13T12:05:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"969bd5271f714a7edee94a2d98345de7bbf44bd4824a551215637a6a833c77d6","abstract_canon_sha256":"2b69ce078069c7e9062bcc18b05a661e2340e8287c632b88551afcfbff302fea"},"schema_version":"1.0"},"canonical_sha256":"92ab1ccfd65311aa7ff74b986b0f91b2c4f3109dd77458a1e34b651079244707","source":{"kind":"arxiv","id":"1803.04742","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04742","created_at":"2026-05-18T00:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04742v1","created_at":"2026-05-18T00:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04742","created_at":"2026-05-18T00:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"SKVRZT6WKMI2","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SKVRZT6WKMI2U77X","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SKVRZT6W","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SKVRZT6WKMI2U77XJOMGWD4RWL","target":"record","payload":{"canonical_record":{"source":{"id":"1803.04742","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2018-03-13T12:05:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"969bd5271f714a7edee94a2d98345de7bbf44bd4824a551215637a6a833c77d6","abstract_canon_sha256":"2b69ce078069c7e9062bcc18b05a661e2340e8287c632b88551afcfbff302fea"},"schema_version":"1.0"},"canonical_sha256":"92ab1ccfd65311aa7ff74b986b0f91b2c4f3109dd77458a1e34b651079244707","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:17.991182Z","signature_b64":"u+NoOLlTjtoEqxL6jiC4DWuum/IPV5E2CRAaXPKEpfwyrhfpK1vncJ6oB6zjwMOlExvdQTAOBfvhbO3p7HYwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92ab1ccfd65311aa7ff74b986b0f91b2c4f3109dd77458a1e34b651079244707","last_reissued_at":"2026-05-18T00:21:17.990704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:17.990704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.04742","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:21:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ti6Um4HGYo2USh8OPkL8CnjhgNT+HnxH2/nVRjssqZ9F1b27mTI3nHtXFfZyfSe3+j6S9IMK+3yHAMAB1XFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:42:43.858899Z"},"content_sha256":"87b7086a8450ad9fbbc0fed19865410d399dcabb08acd17eee47834a10341cf3","schema_version":"1.0","event_id":"sha256:87b7086a8450ad9fbbc0fed19865410d399dcabb08acd17eee47834a10341cf3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SKVRZT6WKMI2U77XJOMGWD4RWL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"VERSE: Versatile Graph Embeddings from Similarity Measures","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Anton Tsitsulin, Davide Mottin, Emmanuel M\\\"uller, Panagiotis Karras","submitted_at":"2018-03-13T12:05:58Z","abstract_excerpt":"Embedding a web-scale information network into a low-dimensional vector space facilitates tasks such as link prediction, classification, and visualization. Past research has addressed the problem of extracting such embeddings by adopting methods from words to graphs, without defining a clearly comprehensible graph-related objective. Yet, as we show, the objectives used in past works implicitly utilize similarity measures among graph nodes.\n  In this paper, we carry the similarity orientation of previous works to its logical conclusion; we propose VERtex Similarity Embeddings (VERSE), a simple,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04742","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:21:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WScQM0UgSWhbBwxksa16uslREO2kG3rgCiKebSPJhKViDZsmvzibwOe5qaOm9RnTZgHDkU0M/sBuzf3Gef0nBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:42:43.859253Z"},"content_sha256":"bcf850b5cc338cc7e1a2c17da7f7666704877f0b730369e1df6a111758891f27","schema_version":"1.0","event_id":"sha256:bcf850b5cc338cc7e1a2c17da7f7666704877f0b730369e1df6a111758891f27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SKVRZT6WKMI2U77XJOMGWD4RWL/bundle.json","state_url":"https://pith.science/pith/SKVRZT6WKMI2U77XJOMGWD4RWL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SKVRZT6WKMI2U77XJOMGWD4RWL/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-24T18:42:43Z","links":{"resolver":"https://pith.science/pith/SKVRZT6WKMI2U77XJOMGWD4RWL","bundle":"https://pith.science/pith/SKVRZT6WKMI2U77XJOMGWD4RWL/bundle.json","state":"https://pith.science/pith/SKVRZT6WKMI2U77XJOMGWD4RWL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SKVRZT6WKMI2U77XJOMGWD4RWL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SKVRZT6WKMI2U77XJOMGWD4RWL","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":"2b69ce078069c7e9062bcc18b05a661e2340e8287c632b88551afcfbff302fea","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2018-03-13T12:05:58Z","title_canon_sha256":"969bd5271f714a7edee94a2d98345de7bbf44bd4824a551215637a6a833c77d6"},"schema_version":"1.0","source":{"id":"1803.04742","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04742","created_at":"2026-05-18T00:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04742v1","created_at":"2026-05-18T00:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04742","created_at":"2026-05-18T00:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"SKVRZT6WKMI2","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SKVRZT6WKMI2U77X","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SKVRZT6W","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:bcf850b5cc338cc7e1a2c17da7f7666704877f0b730369e1df6a111758891f27","target":"graph","created_at":"2026-05-18T00:21:17Z","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":"Embedding a web-scale information network into a low-dimensional vector space facilitates tasks such as link prediction, classification, and visualization. Past research has addressed the problem of extracting such embeddings by adopting methods from words to graphs, without defining a clearly comprehensible graph-related objective. Yet, as we show, the objectives used in past works implicitly utilize similarity measures among graph nodes.\n  In this paper, we carry the similarity orientation of previous works to its logical conclusion; we propose VERtex Similarity Embeddings (VERSE), a simple,","authors_text":"Anton Tsitsulin, Davide Mottin, Emmanuel M\\\"uller, Panagiotis Karras","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2018-03-13T12:05:58Z","title":"VERSE: Versatile Graph Embeddings from Similarity Measures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04742","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:87b7086a8450ad9fbbc0fed19865410d399dcabb08acd17eee47834a10341cf3","target":"record","created_at":"2026-05-18T00:21:17Z","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":"2b69ce078069c7e9062bcc18b05a661e2340e8287c632b88551afcfbff302fea","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2018-03-13T12:05:58Z","title_canon_sha256":"969bd5271f714a7edee94a2d98345de7bbf44bd4824a551215637a6a833c77d6"},"schema_version":"1.0","source":{"id":"1803.04742","kind":"arxiv","version":1}},"canonical_sha256":"92ab1ccfd65311aa7ff74b986b0f91b2c4f3109dd77458a1e34b651079244707","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92ab1ccfd65311aa7ff74b986b0f91b2c4f3109dd77458a1e34b651079244707","first_computed_at":"2026-05-18T00:21:17.990704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:17.990704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u+NoOLlTjtoEqxL6jiC4DWuum/IPV5E2CRAaXPKEpfwyrhfpK1vncJ6oB6zjwMOlExvdQTAOBfvhbO3p7HYwCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:17.991182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04742","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87b7086a8450ad9fbbc0fed19865410d399dcabb08acd17eee47834a10341cf3","sha256:bcf850b5cc338cc7e1a2c17da7f7666704877f0b730369e1df6a111758891f27"],"state_sha256":"fcca1029bdaf0014dbca4b917fc437fcb705c4a03bbf240a50156718e121eea9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2hWgrOzneBhU8iQ/K+YyMAiDCJbDGpR+fOWHahJkTS+Z2fOZjNzDM/9NL7Mh5EJI6NlX+Z2lE686yC95L3gCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T18:42:43.861227Z","bundle_sha256":"8aa2a5b9ae654864661bf6269d9126391ae5a3546981135b280a76af1714c8ef"}}