{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BHRFO7GH22RI62IZLEGVTNNSTB","short_pith_number":"pith:BHRFO7GH","canonical_record":{"source":{"id":"1901.08296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-24T09:12:33Z","cross_cats_sorted":["cs.CV","cs.NE","stat.ML"],"title_canon_sha256":"fe4bbe8889e4abf900f2794811b1e4b8ba71da121800d3a002b4a2f6334a0036","abstract_canon_sha256":"2fe58bee144cefe7dfa36fc36f41c0de62ed26e6c5e8c9a3a727f3f69501c870"},"schema_version":"1.0"},"canonical_sha256":"09e2577cc7d6a28f6919590d59b5b2985fc5b0dee552e1987e3ae6195f5efc8e","source":{"kind":"arxiv","id":"1901.08296","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08296","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08296v1","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08296","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"pith_short_12","alias_value":"BHRFO7GH22RI","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BHRFO7GH22RI62IZ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BHRFO7GH","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BHRFO7GH22RI62IZLEGVTNNSTB","target":"record","payload":{"canonical_record":{"source":{"id":"1901.08296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-24T09:12:33Z","cross_cats_sorted":["cs.CV","cs.NE","stat.ML"],"title_canon_sha256":"fe4bbe8889e4abf900f2794811b1e4b8ba71da121800d3a002b4a2f6334a0036","abstract_canon_sha256":"2fe58bee144cefe7dfa36fc36f41c0de62ed26e6c5e8c9a3a727f3f69501c870"},"schema_version":"1.0"},"canonical_sha256":"09e2577cc7d6a28f6919590d59b5b2985fc5b0dee552e1987e3ae6195f5efc8e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:37.418741Z","signature_b64":"Y2l9iLoUznE0UFGTouTrp7olko4kBV6m43wQ7aEb49e5G/KZptk6H6D63ijH1QDeM3MZ/qUYQ0boPmiGjoVkCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09e2577cc7d6a28f6919590d59b5b2985fc5b0dee552e1987e3ae6195f5efc8e","last_reissued_at":"2026-05-17T23:55:37.418248Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:37.418248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.08296","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-17T23:55:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uhTqxbEoO9VqN0MCT51x2tlyfkYoZ+7guS0WJpBlVti0seQE2BaEjbCmzV7FHMl6iienG3OCRNe/Cf8CuPd1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:36:39.887461Z"},"content_sha256":"a36b3798985388c0cf9cdd9fb3fc7ecf287310e7ba5b67f16bd095fc7a81787f","schema_version":"1.0","event_id":"sha256:a36b3798985388c0cf9cdd9fb3fc7ecf287310e7ba5b67f16bd095fc7a81787f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BHRFO7GH22RI62IZLEGVTNNSTB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Learning on Attributed Graphs: A Journey from Graphs to Their Embeddings and Back","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Martin Simonovsky","submitted_at":"2019-01-24T09:12:33Z","abstract_excerpt":"A graph is a powerful concept for representation of relations between pairs of entities. Data with underlying graph structure can be found across many disciplines and there is a natural desire for understanding such data better. Deep learning (DL) has achieved significant breakthroughs in a variety of machine learning tasks in recent years, especially where data is structured on a grid, such as in text, speech, or image understanding. However, surprisingly little has been done to explore the applicability of DL on arbitrary graph-structured data directly.\n  The goal of this thesis is to invest"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08296","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-17T23:55:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xu+MrzPlxPo17s5iyBL/27h8UTtLMDLCUfBZi8LS7bEYBY90NLBRMtmTtGeK8i1jBSU/ZNgO+AgW/7zv2orxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:36:39.887800Z"},"content_sha256":"3bc923fc80b89f76141487b5d6a309d667ca17d95012332dc39eb0c26e3bf5d6","schema_version":"1.0","event_id":"sha256:3bc923fc80b89f76141487b5d6a309d667ca17d95012332dc39eb0c26e3bf5d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BHRFO7GH22RI62IZLEGVTNNSTB/bundle.json","state_url":"https://pith.science/pith/BHRFO7GH22RI62IZLEGVTNNSTB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BHRFO7GH22RI62IZLEGVTNNSTB/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-02T15:36:39Z","links":{"resolver":"https://pith.science/pith/BHRFO7GH22RI62IZLEGVTNNSTB","bundle":"https://pith.science/pith/BHRFO7GH22RI62IZLEGVTNNSTB/bundle.json","state":"https://pith.science/pith/BHRFO7GH22RI62IZLEGVTNNSTB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BHRFO7GH22RI62IZLEGVTNNSTB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BHRFO7GH22RI62IZLEGVTNNSTB","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":"2fe58bee144cefe7dfa36fc36f41c0de62ed26e6c5e8c9a3a727f3f69501c870","cross_cats_sorted":["cs.CV","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-24T09:12:33Z","title_canon_sha256":"fe4bbe8889e4abf900f2794811b1e4b8ba71da121800d3a002b4a2f6334a0036"},"schema_version":"1.0","source":{"id":"1901.08296","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08296","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08296v1","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08296","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"pith_short_12","alias_value":"BHRFO7GH22RI","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BHRFO7GH22RI62IZ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BHRFO7GH","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:3bc923fc80b89f76141487b5d6a309d667ca17d95012332dc39eb0c26e3bf5d6","target":"graph","created_at":"2026-05-17T23:55:37Z","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":"A graph is a powerful concept for representation of relations between pairs of entities. Data with underlying graph structure can be found across many disciplines and there is a natural desire for understanding such data better. Deep learning (DL) has achieved significant breakthroughs in a variety of machine learning tasks in recent years, especially where data is structured on a grid, such as in text, speech, or image understanding. However, surprisingly little has been done to explore the applicability of DL on arbitrary graph-structured data directly.\n  The goal of this thesis is to invest","authors_text":"Martin Simonovsky","cross_cats":["cs.CV","cs.NE","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-24T09:12:33Z","title":"Deep Learning on Attributed Graphs: A Journey from Graphs to Their Embeddings and Back"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08296","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:a36b3798985388c0cf9cdd9fb3fc7ecf287310e7ba5b67f16bd095fc7a81787f","target":"record","created_at":"2026-05-17T23:55:37Z","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":"2fe58bee144cefe7dfa36fc36f41c0de62ed26e6c5e8c9a3a727f3f69501c870","cross_cats_sorted":["cs.CV","cs.NE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-24T09:12:33Z","title_canon_sha256":"fe4bbe8889e4abf900f2794811b1e4b8ba71da121800d3a002b4a2f6334a0036"},"schema_version":"1.0","source":{"id":"1901.08296","kind":"arxiv","version":1}},"canonical_sha256":"09e2577cc7d6a28f6919590d59b5b2985fc5b0dee552e1987e3ae6195f5efc8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09e2577cc7d6a28f6919590d59b5b2985fc5b0dee552e1987e3ae6195f5efc8e","first_computed_at":"2026-05-17T23:55:37.418248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:37.418248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y2l9iLoUznE0UFGTouTrp7olko4kBV6m43wQ7aEb49e5G/KZptk6H6D63ijH1QDeM3MZ/qUYQ0boPmiGjoVkCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:37.418741Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.08296","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a36b3798985388c0cf9cdd9fb3fc7ecf287310e7ba5b67f16bd095fc7a81787f","sha256:3bc923fc80b89f76141487b5d6a309d667ca17d95012332dc39eb0c26e3bf5d6"],"state_sha256":"756d47725e2d094f7610aba8509018d9596215d47b643d31975cb362c0e50d08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CLnrXzajRMdO0FfI3MpZP8FQWtN7INbNc+m3MaN4QEAfIBZcbeax4kBFML0hwuy5jbrEee2DnBMOuvtKQocjCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:36:39.889639Z","bundle_sha256":"f5ab704c7f99a6a4e51fb66a161ecbeb214ca036bac0a7b3a1588a7b95437ec1"}}