{"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"}