{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SBJFDU6NIHW5C3AO2WQDC4MGOS","short_pith_number":"pith:SBJFDU6N","schema_version":"1.0","canonical_sha256":"905251d3cd41edd16c0ed5a0317186749ac7c98ad0cf6c55e4c75cb4c306b3d5","source":{"kind":"arxiv","id":"1811.02798","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.02798","created_at":"2026-05-18T00:01:20.737186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02798v1","created_at":"2026-05-18T00:01:20.737186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02798","created_at":"2026-05-18T00:01:20.737186+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBJFDU6NIHW5","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBJFDU6NIHW5C3AO","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBJFDU6N","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.12330","citing_title":"Graph Star Net for Generalized Multi-Task Learning","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SBJFDU6NIHW5C3AO2WQDC4MGOS","json":"https://pith.science/pith/SBJFDU6NIHW5C3AO2WQDC4MGOS.json","graph_json":"https://pith.science/api/pith-number/SBJFDU6NIHW5C3AO2WQDC4MGOS/graph.json","events_json":"https://pith.science/api/pith-number/SBJFDU6NIHW5C3AO2WQDC4MGOS/events.json","paper":"https://pith.science/paper/SBJFDU6N"},"agent_actions":{"view_html":"https://pith.science/pith/SBJFDU6NIHW5C3AO2WQDC4MGOS","download_json":"https://pith.science/pith/SBJFDU6NIHW5C3AO2WQDC4MGOS.json","view_paper":"https://pith.science/paper/SBJFDU6N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02798&json=true","fetch_graph":"https://pith.science/api/pith-number/SBJFDU6NIHW5C3AO2WQDC4MGOS/graph.json","fetch_events":"https://pith.science/api/pith-number/SBJFDU6NIHW5C3AO2WQDC4MGOS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBJFDU6NIHW5C3AO2WQDC4MGOS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBJFDU6NIHW5C3AO2WQDC4MGOS/action/storage_attestation","attest_author":"https://pith.science/pith/SBJFDU6NIHW5C3AO2WQDC4MGOS/action/author_attestation","sign_citation":"https://pith.science/pith/SBJFDU6NIHW5C3AO2WQDC4MGOS/action/citation_signature","submit_replication":"https://pith.science/pith/SBJFDU6NIHW5C3AO2WQDC4MGOS/action/replication_record"}},"created_at":"2026-05-18T00:01:20.737186+00:00","updated_at":"2026-05-18T00:01:20.737186+00:00"}