{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BHRFO7GH22RI62IZLEGVTNNSTB","short_pith_number":"pith:BHRFO7GH","schema_version":"1.0","canonical_sha256":"09e2577cc7d6a28f6919590d59b5b2985fc5b0dee552e1987e3ae6195f5efc8e","source":{"kind":"arxiv","id":"1901.08296","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.08296","created_at":"2026-05-17T23:55:37.418346+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.08296v1","created_at":"2026-05-17T23:55:37.418346+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08296","created_at":"2026-05-17T23:55:37.418346+00:00"},{"alias_kind":"pith_short_12","alias_value":"BHRFO7GH22RI","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BHRFO7GH22RI62IZ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BHRFO7GH","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BHRFO7GH22RI62IZLEGVTNNSTB","json":"https://pith.science/pith/BHRFO7GH22RI62IZLEGVTNNSTB.json","graph_json":"https://pith.science/api/pith-number/BHRFO7GH22RI62IZLEGVTNNSTB/graph.json","events_json":"https://pith.science/api/pith-number/BHRFO7GH22RI62IZLEGVTNNSTB/events.json","paper":"https://pith.science/paper/BHRFO7GH"},"agent_actions":{"view_html":"https://pith.science/pith/BHRFO7GH22RI62IZLEGVTNNSTB","download_json":"https://pith.science/pith/BHRFO7GH22RI62IZLEGVTNNSTB.json","view_paper":"https://pith.science/paper/BHRFO7GH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.08296&json=true","fetch_graph":"https://pith.science/api/pith-number/BHRFO7GH22RI62IZLEGVTNNSTB/graph.json","fetch_events":"https://pith.science/api/pith-number/BHRFO7GH22RI62IZLEGVTNNSTB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BHRFO7GH22RI62IZLEGVTNNSTB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BHRFO7GH22RI62IZLEGVTNNSTB/action/storage_attestation","attest_author":"https://pith.science/pith/BHRFO7GH22RI62IZLEGVTNNSTB/action/author_attestation","sign_citation":"https://pith.science/pith/BHRFO7GH22RI62IZLEGVTNNSTB/action/citation_signature","submit_replication":"https://pith.science/pith/BHRFO7GH22RI62IZLEGVTNNSTB/action/replication_record"}},"created_at":"2026-05-17T23:55:37.418346+00:00","updated_at":"2026-05-17T23:55:37.418346+00:00"}