{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SBJFDU6NIHW5C3AO2WQDC4MGOS","short_pith_number":"pith:SBJFDU6N","canonical_record":{"source":{"id":"1811.02798","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-11-07T08:27:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5f956bf85f6a6b0f82313195fc61e0867cb1c20615490319f0b8c87368442c39","abstract_canon_sha256":"3472170ead417cf7073e40eb4eb6e307b465c22ab4f02be058dcf077d14fddda"},"schema_version":"1.0"},"canonical_sha256":"905251d3cd41edd16c0ed5a0317186749ac7c98ad0cf6c55e4c75cb4c306b3d5","source":{"kind":"arxiv","id":"1811.02798","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02798","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02798v1","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02798","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"SBJFDU6NIHW5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"SBJFDU6NIHW5C3AO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"SBJFDU6N","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SBJFDU6NIHW5C3AO2WQDC4MGOS","target":"record","payload":{"canonical_record":{"source":{"id":"1811.02798","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-11-07T08:27:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5f956bf85f6a6b0f82313195fc61e0867cb1c20615490319f0b8c87368442c39","abstract_canon_sha256":"3472170ead417cf7073e40eb4eb6e307b465c22ab4f02be058dcf077d14fddda"},"schema_version":"1.0"},"canonical_sha256":"905251d3cd41edd16c0ed5a0317186749ac7c98ad0cf6c55e4c75cb4c306b3d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:20.737597Z","signature_b64":"Ggot73/lSe/KzyjcAhGv0N753BDzQeKamjbqFnSf20RRCoyjts3GR9hbRPaYjAhy5+w/050m5rT4fT54Ig7OCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"905251d3cd41edd16c0ed5a0317186749ac7c98ad0cf6c55e4c75cb4c306b3d5","last_reissued_at":"2026-05-18T00:01:20.737116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:20.737116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.02798","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-18T00:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QVYsAew7a9m3mGAyDuNsVH5ZbTB02qDY3MZEnLEKFr+TeR2pSVn8szT6N2gFT8SIiKDxPNxyqqwrPqlNhkFPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:18:23.493699Z"},"content_sha256":"a2a70f179771daf7a2923c324e09545c8898aad1b21f1326b56bce6d62445c51","schema_version":"1.0","event_id":"sha256:a2a70f179771daf7a2923c324e09545c8898aad1b21f1326b56bce6d62445c51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SBJFDU6NIHW5C3AO2WQDC4MGOS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Task Graph Autoencoders","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Phi Vu Tran","submitted_at":"2018-11-07T08:27:52Z","abstract_excerpt":"We examine two fundamental tasks associated with graph representation learning: link prediction and node classification. We present a new autoencoder architecture capable of learning a joint representation of local graph structure and available node features for the simultaneous multi-task learning of unsupervised link prediction and semi-supervised node classification. Our simple, yet effective and versatile model is efficiently trained end-to-end in a single stage, whereas previous related deep graph embedding methods require multiple training steps that are difficult to optimize. We provide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02798","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-18T00:01:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ocKuL6tKbUcPPGwY4olCP0tGH0mKenPNCPWoLdZx7zK5dckQqq3KIUANbDKj3OHypr1gZLxiY1VHbsMjRAyVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:18:23.494278Z"},"content_sha256":"b70a10236b2a024f6a2f8677c0f9c3ad6010c5970a2d8ceff8d5e17a636c955e","schema_version":"1.0","event_id":"sha256:b70a10236b2a024f6a2f8677c0f9c3ad6010c5970a2d8ceff8d5e17a636c955e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBJFDU6NIHW5C3AO2WQDC4MGOS/bundle.json","state_url":"https://pith.science/pith/SBJFDU6NIHW5C3AO2WQDC4MGOS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBJFDU6NIHW5C3AO2WQDC4MGOS/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-05-26T08:18:23Z","links":{"resolver":"https://pith.science/pith/SBJFDU6NIHW5C3AO2WQDC4MGOS","bundle":"https://pith.science/pith/SBJFDU6NIHW5C3AO2WQDC4MGOS/bundle.json","state":"https://pith.science/pith/SBJFDU6NIHW5C3AO2WQDC4MGOS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBJFDU6NIHW5C3AO2WQDC4MGOS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SBJFDU6NIHW5C3AO2WQDC4MGOS","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":"3472170ead417cf7073e40eb4eb6e307b465c22ab4f02be058dcf077d14fddda","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-11-07T08:27:52Z","title_canon_sha256":"5f956bf85f6a6b0f82313195fc61e0867cb1c20615490319f0b8c87368442c39"},"schema_version":"1.0","source":{"id":"1811.02798","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02798","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02798v1","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02798","created_at":"2026-05-18T00:01:20Z"},{"alias_kind":"pith_short_12","alias_value":"SBJFDU6NIHW5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"SBJFDU6NIHW5C3AO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"SBJFDU6N","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:b70a10236b2a024f6a2f8677c0f9c3ad6010c5970a2d8ceff8d5e17a636c955e","target":"graph","created_at":"2026-05-18T00:01:20Z","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":"We examine two fundamental tasks associated with graph representation learning: link prediction and node classification. We present a new autoencoder architecture capable of learning a joint representation of local graph structure and available node features for the simultaneous multi-task learning of unsupervised link prediction and semi-supervised node classification. Our simple, yet effective and versatile model is efficiently trained end-to-end in a single stage, whereas previous related deep graph embedding methods require multiple training steps that are difficult to optimize. We provide","authors_text":"Phi Vu Tran","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-11-07T08:27:52Z","title":"Multi-Task Graph Autoencoders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02798","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:a2a70f179771daf7a2923c324e09545c8898aad1b21f1326b56bce6d62445c51","target":"record","created_at":"2026-05-18T00:01:20Z","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":"3472170ead417cf7073e40eb4eb6e307b465c22ab4f02be058dcf077d14fddda","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-11-07T08:27:52Z","title_canon_sha256":"5f956bf85f6a6b0f82313195fc61e0867cb1c20615490319f0b8c87368442c39"},"schema_version":"1.0","source":{"id":"1811.02798","kind":"arxiv","version":1}},"canonical_sha256":"905251d3cd41edd16c0ed5a0317186749ac7c98ad0cf6c55e4c75cb4c306b3d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"905251d3cd41edd16c0ed5a0317186749ac7c98ad0cf6c55e4c75cb4c306b3d5","first_computed_at":"2026-05-18T00:01:20.737116Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:20.737116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ggot73/lSe/KzyjcAhGv0N753BDzQeKamjbqFnSf20RRCoyjts3GR9hbRPaYjAhy5+w/050m5rT4fT54Ig7OCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:20.737597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02798","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2a70f179771daf7a2923c324e09545c8898aad1b21f1326b56bce6d62445c51","sha256:b70a10236b2a024f6a2f8677c0f9c3ad6010c5970a2d8ceff8d5e17a636c955e"],"state_sha256":"9be5865e27dd0f3610511a2b54ec22e0df37ce999a9ad8027ad0d275b5d9f554"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9v46rif9x9pUT2LNOURMYXHrRukG2MuO+GuidOQ0tdcEgBmne+nlrC66DL7mAURDxACFdJWeYIMBXxRMAyOBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:18:23.498546Z","bundle_sha256":"8c792bdbf0dce0022223068ee014f72c5760c2d4bd68ea8ef9e278ea19e80707"}}