{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KUF55U34CW3LMNMR2ZVO55YV4S","short_pith_number":"pith:KUF55U34","canonical_record":{"source":{"id":"1707.03815","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-12T17:54:04Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"4b54ae52cbae376bb4bbf093254c673820bd75e60a017ac01dca259364f4b031","abstract_canon_sha256":"2b0e2b7e1364358a8fb417c23079c5ba72a9474fd911b83103d774a30857f5ae"},"schema_version":"1.0"},"canonical_sha256":"550bded37c15b6b63591d66aeef715e48a1fd74c9c2bc685dcdee8027b4be3bc","source":{"kind":"arxiv","id":"1707.03815","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03815","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03815v4","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03815","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"pith_short_12","alias_value":"KUF55U34CW3L","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KUF55U34CW3LMNMR","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KUF55U34","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KUF55U34CW3LMNMR2ZVO55YV4S","target":"record","payload":{"canonical_record":{"source":{"id":"1707.03815","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-12T17:54:04Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"4b54ae52cbae376bb4bbf093254c673820bd75e60a017ac01dca259364f4b031","abstract_canon_sha256":"2b0e2b7e1364358a8fb417c23079c5ba72a9474fd911b83103d774a30857f5ae"},"schema_version":"1.0"},"canonical_sha256":"550bded37c15b6b63591d66aeef715e48a1fd74c9c2bc685dcdee8027b4be3bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:53.216654Z","signature_b64":"lzY8JJNi5gtVDC9u/0lc6HmAn4wI5KeSlRPaFcue5fd9TA/xTQ/Z4Ulbf2n2Q2cdTRmnqHd52E50OGPDhHHvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"550bded37c15b6b63591d66aeef715e48a1fd74c9c2bc685dcdee8027b4be3bc","last_reissued_at":"2026-05-17T23:49:53.216276Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:53.216276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.03815","source_version":4,"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:49:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ixDHqGIGony09RdSUue8qDBdG/E8YfArJo1TJ4ixkpzPiB7xoc0GAZTebcLHqIwkvdZbYnXvv7/sqLVoe+QUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:56:24.261121Z"},"content_sha256":"3514059e07870c3b3ed6d3f8bce4a785a783ab3d892414852453eb9c03efe144","schema_version":"1.0","event_id":"sha256:3514059e07870c3b3ed6d3f8bce4a785a783ab3d892414852453eb9c03efe144"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KUF55U34CW3LMNMR2ZVO55YV4S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Aleksandar Bojchevski, Stephan G\\\"unnemann","submitted_at":"2017-07-12T17:54:04Z","abstract_excerpt":"Methods that learn representations of nodes in a graph play a critical role in network analysis since they enable many downstream learning tasks. We propose Graph2Gauss - an approach that can efficiently learn versatile node embeddings on large scale (attributed) graphs that show strong performance on tasks such as link prediction and node classification. Unlike most approaches that represent nodes as point vectors in a low-dimensional continuous space, we embed each node as a Gaussian distribution, allowing us to capture uncertainty about the representation. Furthermore, we propose an unsuper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03815","kind":"arxiv","version":4},"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:49:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UKwxApoK8D0bCiZ+7q/wPQlulPa/462fRQHCcJ+2mcx72gKWzQY0z5Rj1Eu1lQPurne/WQKCIp9isQbGq/ZDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:56:24.261477Z"},"content_sha256":"05315f38b4fa89a2c13c0cf627331539b663cc51930fe460e1aa04bf0031f9c3","schema_version":"1.0","event_id":"sha256:05315f38b4fa89a2c13c0cf627331539b663cc51930fe460e1aa04bf0031f9c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUF55U34CW3LMNMR2ZVO55YV4S/bundle.json","state_url":"https://pith.science/pith/KUF55U34CW3LMNMR2ZVO55YV4S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUF55U34CW3LMNMR2ZVO55YV4S/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-29T15:56:24Z","links":{"resolver":"https://pith.science/pith/KUF55U34CW3LMNMR2ZVO55YV4S","bundle":"https://pith.science/pith/KUF55U34CW3LMNMR2ZVO55YV4S/bundle.json","state":"https://pith.science/pith/KUF55U34CW3LMNMR2ZVO55YV4S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUF55U34CW3LMNMR2ZVO55YV4S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KUF55U34CW3LMNMR2ZVO55YV4S","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":"2b0e2b7e1364358a8fb417c23079c5ba72a9474fd911b83103d774a30857f5ae","cross_cats_sorted":["cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-12T17:54:04Z","title_canon_sha256":"4b54ae52cbae376bb4bbf093254c673820bd75e60a017ac01dca259364f4b031"},"schema_version":"1.0","source":{"id":"1707.03815","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.03815","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"arxiv_version","alias_value":"1707.03815v4","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03815","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"pith_short_12","alias_value":"KUF55U34CW3L","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KUF55U34CW3LMNMR","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KUF55U34","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:05315f38b4fa89a2c13c0cf627331539b663cc51930fe460e1aa04bf0031f9c3","target":"graph","created_at":"2026-05-17T23:49:53Z","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":"Methods that learn representations of nodes in a graph play a critical role in network analysis since they enable many downstream learning tasks. We propose Graph2Gauss - an approach that can efficiently learn versatile node embeddings on large scale (attributed) graphs that show strong performance on tasks such as link prediction and node classification. Unlike most approaches that represent nodes as point vectors in a low-dimensional continuous space, we embed each node as a Gaussian distribution, allowing us to capture uncertainty about the representation. Furthermore, we propose an unsuper","authors_text":"Aleksandar Bojchevski, Stephan G\\\"unnemann","cross_cats":["cs.LG","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-12T17:54:04Z","title":"Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03815","kind":"arxiv","version":4},"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:3514059e07870c3b3ed6d3f8bce4a785a783ab3d892414852453eb9c03efe144","target":"record","created_at":"2026-05-17T23:49:53Z","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":"2b0e2b7e1364358a8fb417c23079c5ba72a9474fd911b83103d774a30857f5ae","cross_cats_sorted":["cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-12T17:54:04Z","title_canon_sha256":"4b54ae52cbae376bb4bbf093254c673820bd75e60a017ac01dca259364f4b031"},"schema_version":"1.0","source":{"id":"1707.03815","kind":"arxiv","version":4}},"canonical_sha256":"550bded37c15b6b63591d66aeef715e48a1fd74c9c2bc685dcdee8027b4be3bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"550bded37c15b6b63591d66aeef715e48a1fd74c9c2bc685dcdee8027b4be3bc","first_computed_at":"2026-05-17T23:49:53.216276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:53.216276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lzY8JJNi5gtVDC9u/0lc6HmAn4wI5KeSlRPaFcue5fd9TA/xTQ/Z4Ulbf2n2Q2cdTRmnqHd52E50OGPDhHHvAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:53.216654Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.03815","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3514059e07870c3b3ed6d3f8bce4a785a783ab3d892414852453eb9c03efe144","sha256:05315f38b4fa89a2c13c0cf627331539b663cc51930fe460e1aa04bf0031f9c3"],"state_sha256":"84441bd7c5e8ad5fa46810e104405ac64780536d7462ceacd528f71a014c84ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C7YbcMmOCvwWWVwCz9Gbbgb/HC7tNhBZatdYr2S1bY61vHhdZuc8Ro4BfRjLdd2OgtNq7Oamn6xsacYCxcImAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T15:56:24.263351Z","bundle_sha256":"f1675368673831eae3fc4a6b54c5900c07d11967e7f1d1e456340432fe2606e6"}}