{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FTZTK3LXWUFSJUALAWGJJP6VF2","short_pith_number":"pith:FTZTK3LX","canonical_record":{"source":{"id":"2503.23822","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-31T08:16:03Z","cross_cats_sorted":[],"title_canon_sha256":"8e38e69ac217284276158826e4c0bd2d271f243aa51c11e6d060eeafb73bc982","abstract_canon_sha256":"1bba20f3a4ac2a348257b80e167eb44e3b34856bf550da14211d539a3ae0af50"},"schema_version":"1.0"},"canonical_sha256":"2cf3356d77b50b24d00b058c94bfd52ebf42b6329aed91846c0fe94da1d1c094","source":{"kind":"arxiv","id":"2503.23822","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.23822","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"arxiv_version","alias_value":"2503.23822v2","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.23822","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"pith_short_12","alias_value":"FTZTK3LXWUFS","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"pith_short_16","alias_value":"FTZTK3LXWUFSJUAL","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"pith_short_8","alias_value":"FTZTK3LX","created_at":"2026-06-09T01:05:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FTZTK3LXWUFSJUALAWGJJP6VF2","target":"record","payload":{"canonical_record":{"source":{"id":"2503.23822","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-31T08:16:03Z","cross_cats_sorted":[],"title_canon_sha256":"8e38e69ac217284276158826e4c0bd2d271f243aa51c11e6d060eeafb73bc982","abstract_canon_sha256":"1bba20f3a4ac2a348257b80e167eb44e3b34856bf550da14211d539a3ae0af50"},"schema_version":"1.0"},"canonical_sha256":"2cf3356d77b50b24d00b058c94bfd52ebf42b6329aed91846c0fe94da1d1c094","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:06.114583Z","signature_b64":"U1GvCu1hvbcDifhoQVXO2FgtBX8kd5psXWInx4R6ii5EBG7jxjveYIr18QYaadnUXKdbON4EXWMr8CBHsIKbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cf3356d77b50b24d00b058c94bfd52ebf42b6329aed91846c0fe94da1d1c094","last_reissued_at":"2026-06-09T01:05:06.113975Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:06.113975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.23822","source_version":2,"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-06-09T01:05:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ubeY7pNvsu2ToThAGdses0k97qQRafV6MlucPCoIbO2itiV0bOuLakVEuSmpJ6zPDCC8ITWQbrVBBUWtmSHeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:00:26.956560Z"},"content_sha256":"32068ad721a66d5e244f812e04f2df6e446a228763af8cbe4209e80a2407bfb1","schema_version":"1.0","event_id":"sha256:32068ad721a66d5e244f812e04f2df6e446a228763af8cbe4209e80a2407bfb1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FTZTK3LXWUFSJUALAWGJJP6VF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Node Embeddings via Neighbor Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alica Guzm\\'an, Andrew Draganov, Dmitry Kobak, Jan Niklas B\\\"ohm, Marius Keute, Sebastian Damrich","submitted_at":"2025-03-31T08:16:03Z","abstract_excerpt":"Node embeddings are a paradigm in non-parametric graph representation learning, where graph nodes are embedded into a given vector space to enable downstream processing. State-of-the-art node-embedding algorithms, such as DeepWalk and node2vec, are based on random-walk notions of node similarity and on contrastive learning. In this work, we introduce the graph neighbor-embedding (graph NE) framework that directly pulls together embedding vectors of adjacent nodes without relying on any random walks. We show that graph NE strongly outperforms state-of-the-art node-embedding algorithms in terms "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.23822","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.23822/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-09T01:05:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g9381D7uEk3RJxMslO/odHsStxpFYmkwkabMIBy6BwiQp6a8zSDn3Cmp2Z06zAT6u0NuKRhOotMU5cMxBJXJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:00:26.957679Z"},"content_sha256":"6dafc8ffb3b882e87bea414093a84b6734f9ca9c69310849c030cb95d22876d3","schema_version":"1.0","event_id":"sha256:6dafc8ffb3b882e87bea414093a84b6734f9ca9c69310849c030cb95d22876d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FTZTK3LXWUFSJUALAWGJJP6VF2/bundle.json","state_url":"https://pith.science/pith/FTZTK3LXWUFSJUALAWGJJP6VF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FTZTK3LXWUFSJUALAWGJJP6VF2/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-09T10:00:26Z","links":{"resolver":"https://pith.science/pith/FTZTK3LXWUFSJUALAWGJJP6VF2","bundle":"https://pith.science/pith/FTZTK3LXWUFSJUALAWGJJP6VF2/bundle.json","state":"https://pith.science/pith/FTZTK3LXWUFSJUALAWGJJP6VF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FTZTK3LXWUFSJUALAWGJJP6VF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FTZTK3LXWUFSJUALAWGJJP6VF2","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":"1bba20f3a4ac2a348257b80e167eb44e3b34856bf550da14211d539a3ae0af50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-31T08:16:03Z","title_canon_sha256":"8e38e69ac217284276158826e4c0bd2d271f243aa51c11e6d060eeafb73bc982"},"schema_version":"1.0","source":{"id":"2503.23822","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.23822","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"arxiv_version","alias_value":"2503.23822v2","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.23822","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"pith_short_12","alias_value":"FTZTK3LXWUFS","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"pith_short_16","alias_value":"FTZTK3LXWUFSJUAL","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"pith_short_8","alias_value":"FTZTK3LX","created_at":"2026-06-09T01:05:06Z"}],"graph_snapshots":[{"event_id":"sha256:6dafc8ffb3b882e87bea414093a84b6734f9ca9c69310849c030cb95d22876d3","target":"graph","created_at":"2026-06-09T01:05:06Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.23822/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Node embeddings are a paradigm in non-parametric graph representation learning, where graph nodes are embedded into a given vector space to enable downstream processing. State-of-the-art node-embedding algorithms, such as DeepWalk and node2vec, are based on random-walk notions of node similarity and on contrastive learning. In this work, we introduce the graph neighbor-embedding (graph NE) framework that directly pulls together embedding vectors of adjacent nodes without relying on any random walks. We show that graph NE strongly outperforms state-of-the-art node-embedding algorithms in terms ","authors_text":"Alica Guzm\\'an, Andrew Draganov, Dmitry Kobak, Jan Niklas B\\\"ohm, Marius Keute, Sebastian Damrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-31T08:16:03Z","title":"Node Embeddings via Neighbor Embeddings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.23822","kind":"arxiv","version":2},"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:32068ad721a66d5e244f812e04f2df6e446a228763af8cbe4209e80a2407bfb1","target":"record","created_at":"2026-06-09T01:05:06Z","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":"1bba20f3a4ac2a348257b80e167eb44e3b34856bf550da14211d539a3ae0af50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-31T08:16:03Z","title_canon_sha256":"8e38e69ac217284276158826e4c0bd2d271f243aa51c11e6d060eeafb73bc982"},"schema_version":"1.0","source":{"id":"2503.23822","kind":"arxiv","version":2}},"canonical_sha256":"2cf3356d77b50b24d00b058c94bfd52ebf42b6329aed91846c0fe94da1d1c094","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cf3356d77b50b24d00b058c94bfd52ebf42b6329aed91846c0fe94da1d1c094","first_computed_at":"2026-06-09T01:05:06.113975Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:05:06.113975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U1GvCu1hvbcDifhoQVXO2FgtBX8kd5psXWInx4R6ii5EBG7jxjveYIr18QYaadnUXKdbON4EXWMr8CBHsIKbDQ==","signature_status":"signed_v1","signed_at":"2026-06-09T01:05:06.114583Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.23822","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32068ad721a66d5e244f812e04f2df6e446a228763af8cbe4209e80a2407bfb1","sha256:6dafc8ffb3b882e87bea414093a84b6734f9ca9c69310849c030cb95d22876d3"],"state_sha256":"bf297129fd1a476feb21e6ec16ba392f020ee1f86880eef61e53d6a3009df273"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oDpp/BXCV+NiviiffBRD+xWuomvI/REpNYlwru5b3wBIQE62pe4oFQC1pVvE93gQH5pb/bPmChDPuwohgY6ZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T10:00:26.962361Z","bundle_sha256":"c65265958f5fa14223fa98ebbc62453019bc6022d015582f7507f5cd0e6d46a9"}}