{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FRLOJYIH7ICSPDVUWVEKJHVLXA","short_pith_number":"pith:FRLOJYIH","schema_version":"1.0","canonical_sha256":"2c56e4e107fa05278eb4b548a49eabb81f366d2542c7027bbaea882b52107b4d","source":{"kind":"arxiv","id":"1905.10715","version":1},"attestation_state":"computed","paper":{"title":"Graph Attention Auto-Encoders","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amin Salehi, Hasan Davulcu","submitted_at":"2019-05-26T02:47:58Z","abstract_excerpt":"Auto-encoders have emerged as a successful framework for unsupervised learning. However, conventional auto-encoders are incapable of utilizing explicit relations in structured data. To take advantage of relations in graph-structured data, several graph auto-encoders have recently been proposed, but they neglect to reconstruct either the graph structure or node attributes. In this paper, we present the graph attention auto-encoder (GATE), a neural network architecture for unsupervised representation learning on graph-structured data. Our architecture is able to reconstruct graph-structured inpu"},"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":"1905.10715","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-26T02:47:58Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"f4ef3f07dcb65341fda6609819117713d0726cf94139f58f45ff3f655c49e401","abstract_canon_sha256":"a279d4dfcb08517c491953ede5cef5c18f1b23067c01f619bb2e7e97af189196"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:05.501740Z","signature_b64":"hjoxc5KtI9qUEUarTC1OI6E9yc76QnKiXGc8aEfHkHzDqqMYtaWRYuFrDtPdKPdHXr/MGXqDmkplyE+36y6FAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c56e4e107fa05278eb4b548a49eabb81f366d2542c7027bbaea882b52107b4d","last_reissued_at":"2026-05-17T23:45:05.501079Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:05.501079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Attention Auto-Encoders","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amin Salehi, Hasan Davulcu","submitted_at":"2019-05-26T02:47:58Z","abstract_excerpt":"Auto-encoders have emerged as a successful framework for unsupervised learning. However, conventional auto-encoders are incapable of utilizing explicit relations in structured data. To take advantage of relations in graph-structured data, several graph auto-encoders have recently been proposed, but they neglect to reconstruct either the graph structure or node attributes. In this paper, we present the graph attention auto-encoder (GATE), a neural network architecture for unsupervised representation learning on graph-structured data. Our architecture is able to reconstruct graph-structured inpu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10715","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":"1905.10715","created_at":"2026-05-17T23:45:05.501177+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10715v1","created_at":"2026-05-17T23:45:05.501177+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10715","created_at":"2026-05-17T23:45:05.501177+00:00"},{"alias_kind":"pith_short_12","alias_value":"FRLOJYIH7ICS","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"FRLOJYIH7ICSPDVU","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"FRLOJYIH","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.15699","citing_title":"Graph self-supervised learning based on frequency corruption","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FRLOJYIH7ICSPDVUWVEKJHVLXA","json":"https://pith.science/pith/FRLOJYIH7ICSPDVUWVEKJHVLXA.json","graph_json":"https://pith.science/api/pith-number/FRLOJYIH7ICSPDVUWVEKJHVLXA/graph.json","events_json":"https://pith.science/api/pith-number/FRLOJYIH7ICSPDVUWVEKJHVLXA/events.json","paper":"https://pith.science/paper/FRLOJYIH"},"agent_actions":{"view_html":"https://pith.science/pith/FRLOJYIH7ICSPDVUWVEKJHVLXA","download_json":"https://pith.science/pith/FRLOJYIH7ICSPDVUWVEKJHVLXA.json","view_paper":"https://pith.science/paper/FRLOJYIH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10715&json=true","fetch_graph":"https://pith.science/api/pith-number/FRLOJYIH7ICSPDVUWVEKJHVLXA/graph.json","fetch_events":"https://pith.science/api/pith-number/FRLOJYIH7ICSPDVUWVEKJHVLXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FRLOJYIH7ICSPDVUWVEKJHVLXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FRLOJYIH7ICSPDVUWVEKJHVLXA/action/storage_attestation","attest_author":"https://pith.science/pith/FRLOJYIH7ICSPDVUWVEKJHVLXA/action/author_attestation","sign_citation":"https://pith.science/pith/FRLOJYIH7ICSPDVUWVEKJHVLXA/action/citation_signature","submit_replication":"https://pith.science/pith/FRLOJYIH7ICSPDVUWVEKJHVLXA/action/replication_record"}},"created_at":"2026-05-17T23:45:05.501177+00:00","updated_at":"2026-05-17T23:45:05.501177+00:00"}