{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5T3OJUZ3N27M2A3L5AM5VTCKY7","short_pith_number":"pith:5T3OJUZ3","schema_version":"1.0","canonical_sha256":"ecf6e4d33b6ebecd036be819dacc4ac7cfc2f26886e48326a8dca88a2a59e7ca","source":{"kind":"arxiv","id":"1611.07308","version":1},"attestation_state":"computed","paper":{"title":"Variational Graph Auto-Encoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Max Welling, Thomas N. Kipf","submitted_at":"2016-11-21T11:37:17Z","abstract_excerpt":"We introduce the variational graph auto-encoder (VGAE), a framework for unsupervised learning on graph-structured data based on the variational auto-encoder (VAE). This model makes use of latent variables and is capable of learning interpretable latent representations for undirected graphs. We demonstrate this model using a graph convolutional network (GCN) encoder and a simple inner product decoder. Our model achieves competitive results on a link prediction task in citation networks. In contrast to most existing models for unsupervised learning on graph-structured data and link prediction, o"},"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":"1611.07308","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-21T11:37:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3774c7521a6779b2102ba9e6be55f007f4e8b41089d189c00285bb446087889f","abstract_canon_sha256":"0f8684c7971b4865300ab0629e6efce0ba8ef714ef5188400784d09738d4e8df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:24.328676Z","signature_b64":"Vqrw/L9mmKMlGSm24zFRXJEcroWfuvgMkpIQ5m+Goi9NKMDD8xs19PMaY0nYM4NVXQyE9fSVrILfNzJCwjuJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecf6e4d33b6ebecd036be819dacc4ac7cfc2f26886e48326a8dca88a2a59e7ca","last_reissued_at":"2026-05-18T00:57:24.328189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:24.328189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variational Graph Auto-Encoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Max Welling, Thomas N. Kipf","submitted_at":"2016-11-21T11:37:17Z","abstract_excerpt":"We introduce the variational graph auto-encoder (VGAE), a framework for unsupervised learning on graph-structured data based on the variational auto-encoder (VAE). This model makes use of latent variables and is capable of learning interpretable latent representations for undirected graphs. We demonstrate this model using a graph convolutional network (GCN) encoder and a simple inner product decoder. Our model achieves competitive results on a link prediction task in citation networks. In contrast to most existing models for unsupervised learning on graph-structured data and link prediction, o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07308","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":"1611.07308","created_at":"2026-05-18T00:57:24.328265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07308v1","created_at":"2026-05-18T00:57:24.328265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07308","created_at":"2026-05-18T00:57:24.328265+00:00"},{"alias_kind":"pith_short_12","alias_value":"5T3OJUZ3N27M","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5T3OJUZ3N27M2A3L","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5T3OJUZ3","created_at":"2026-05-18T12:30:01.593930+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":41,"internal_anchor_count":26,"sample":[{"citing_arxiv_id":"1907.01705","citing_title":"Graph Embeddings at Scale","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2510.12369","citing_title":"A Hierarchical Quantized Tokenization Framework for Task-Adaptive Graph Representation Learning","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"2605.23239","citing_title":"Self-supervised Adversarial Purification for Graph Neural Networks","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"1907.05743","citing_title":"Semi-Supervised Graph Embedding for Multi-Label Graph Node Classification","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"1907.08990","citing_title":"Spectral-based Graph Convolutional Network for Directed Graphs","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2010.03496","citing_title":"Inductive Entity Representations from Text via Link Prediction","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2310.18215","citing_title":"CROSS-Net: Region-Agnostic Taxi-Demand Prediction Using Feature Disentanglement","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2405.04211","citing_title":"Leveraging Medical Foundation Model Features in Graph Neural Network-Based Retrieval of Breast Histopathology Images","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2406.15797","citing_title":"$\\texttt{SynC}$: Synergistic Boosting of Structure and Representation for Deep Graph Clustering","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2407.07639","citing_title":"Explaining Graph Neural Networks for Node Similarity on Graphs","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2408.13471","citing_title":"Disentangled Generative Graph Representation Learning","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2505.16527","citing_title":"Joint Relational Database Generation via Graph-Conditional Diffusion Models","ref_index":47,"is_internal_anchor":true},{"citing_arxiv_id":"2506.17312","citing_title":"Heterogeneous Temporal Hypergraph Neural Network","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2510.16416","citing_title":"SSL4RL: Revisiting Self-supervised Learning as Intrinsic Reward for Visual-Language Reasoning","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2601.15133","citing_title":"Building Deep Graph Predictors with Graph Imitation Learning","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16668","citing_title":"GraViti: Graph-Level Variational Autoencoders with Relaxed Permutation Invariance","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17359","citing_title":"Learning Transferable Topology Priors for Multi-Agent LLM Collaboration Across Domains","ref_index":39,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19916","citing_title":"Fast and Featureless Node Representation Learning with Partial Pairwise Supervision","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19733","citing_title":"Graph Neural Networks for Community Detection in Graph Signal Analysis","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2509.19929","citing_title":"Geometric Autoencoder Priors for Bayesian Inversion: Learn First Observe Later","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2511.02135","citing_title":"Graph-Based Alternatives to LLMs for Human Simulation","ref_index":42,"is_internal_anchor":true},{"citing_arxiv_id":"2511.03015","citing_title":"Discrete Bayesian Sample Inference for Graph Generation","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2511.04859","citing_title":"Decoder-only Clustering in Attributed Graphs","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2511.17113","citing_title":"AutoGraphAD: Unsupervised network anomaly detection using Variational Graph Autoencoders","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2512.06356","citing_title":"Mitigating Structural Overfitting: A Distribution-Aware Rectification Framework for Missing Feature Imputation","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5T3OJUZ3N27M2A3L5AM5VTCKY7","json":"https://pith.science/pith/5T3OJUZ3N27M2A3L5AM5VTCKY7.json","graph_json":"https://pith.science/api/pith-number/5T3OJUZ3N27M2A3L5AM5VTCKY7/graph.json","events_json":"https://pith.science/api/pith-number/5T3OJUZ3N27M2A3L5AM5VTCKY7/events.json","paper":"https://pith.science/paper/5T3OJUZ3"},"agent_actions":{"view_html":"https://pith.science/pith/5T3OJUZ3N27M2A3L5AM5VTCKY7","download_json":"https://pith.science/pith/5T3OJUZ3N27M2A3L5AM5VTCKY7.json","view_paper":"https://pith.science/paper/5T3OJUZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07308&json=true","fetch_graph":"https://pith.science/api/pith-number/5T3OJUZ3N27M2A3L5AM5VTCKY7/graph.json","fetch_events":"https://pith.science/api/pith-number/5T3OJUZ3N27M2A3L5AM5VTCKY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5T3OJUZ3N27M2A3L5AM5VTCKY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5T3OJUZ3N27M2A3L5AM5VTCKY7/action/storage_attestation","attest_author":"https://pith.science/pith/5T3OJUZ3N27M2A3L5AM5VTCKY7/action/author_attestation","sign_citation":"https://pith.science/pith/5T3OJUZ3N27M2A3L5AM5VTCKY7/action/citation_signature","submit_replication":"https://pith.science/pith/5T3OJUZ3N27M2A3L5AM5VTCKY7/action/replication_record"}},"created_at":"2026-05-18T00:57:24.328265+00:00","updated_at":"2026-05-18T00:57:24.328265+00:00"}