{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MOGBYYQG6SRYO2SIDO6J3RBOWJ","short_pith_number":"pith:MOGBYYQG","schema_version":"1.0","canonical_sha256":"638c1c6206f4a3876a481bbc9dc42eb2797886bec1d871729e9b5deea4388ce4","source":{"kind":"arxiv","id":"1706.02263","version":2},"attestation_state":"computed","paper":{"title":"Graph Convolutional Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.IR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Max Welling, Rianne van den Berg, Thomas N. Kipf","submitted_at":"2017-06-07T17:05:19Z","abstract_excerpt":"We consider matrix completion for recommender systems from the point of view of link prediction on graphs. Interaction data such as movie ratings can be represented by a bipartite user-item graph with labeled edges denoting observed ratings. Building on recent progress in deep learning on graph-structured data, we propose a graph auto-encoder framework based on differentiable message passing on the bipartite interaction graph. Our model shows competitive performance on standard collaborative filtering benchmarks. In settings where complimentary feature information or structured data such as a "},"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":"1706.02263","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-07T17:05:19Z","cross_cats_sorted":["cs.DB","cs.IR","cs.LG"],"title_canon_sha256":"7fc632c6af8f2231c55806a6a6dde9b2feb57157fd24897c97b95356ac4be272","abstract_canon_sha256":"583cf278120d2083fea5a7931a008c7686b08b8c1e48bfeae05470bbcd650986"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:59.588029Z","signature_b64":"lbYBH0nL52xfabmYHQ6BfkpywKNh+nbtxF52LuUOPzgZO24UAtoon4c7a4Hn/kv2D0/+/WFMijq5FqC4a3esCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"638c1c6206f4a3876a481bbc9dc42eb2797886bec1d871729e9b5deea4388ce4","last_reissued_at":"2026-05-18T00:31:59.587622Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:59.587622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Convolutional Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.IR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Max Welling, Rianne van den Berg, Thomas N. Kipf","submitted_at":"2017-06-07T17:05:19Z","abstract_excerpt":"We consider matrix completion for recommender systems from the point of view of link prediction on graphs. Interaction data such as movie ratings can be represented by a bipartite user-item graph with labeled edges denoting observed ratings. Building on recent progress in deep learning on graph-structured data, we propose a graph auto-encoder framework based on differentiable message passing on the bipartite interaction graph. Our model shows competitive performance on standard collaborative filtering benchmarks. In settings where complimentary feature information or structured data such as a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02263","kind":"arxiv","version":2},"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":"1706.02263","created_at":"2026-05-18T00:31:59.587667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02263v2","created_at":"2026-05-18T00:31:59.587667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02263","created_at":"2026-05-18T00:31:59.587667+00:00"},{"alias_kind":"pith_short_12","alias_value":"MOGBYYQG6SRY","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MOGBYYQG6SRYO2SI","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MOGBYYQG","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":7,"sample":[{"citing_arxiv_id":"1906.08541","citing_title":"Regional based query in graph active learning","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"1907.06853","citing_title":"Deep Social Collaborative Filtering","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"1909.01315","citing_title":"Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2502.15699","citing_title":"Disentangling Popularity and Quality: An Edge Classification Approach for Fair Recommendation","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2504.13614","citing_title":"Adaptive Long-term Embedding with Denoising and Augmentation for Recommendation","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2507.19067","citing_title":"PBiLoss: Popularity-Aware Regularization to Improve Fairness in Graph-Based Recommender Systems","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2511.02135","citing_title":"Graph-Based Alternatives to LLMs for Human Simulation","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2604.12965","citing_title":"Efficient Retrieval Scaling with Hierarchical Indexing for Large Scale Recommendation","ref_index":57,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MOGBYYQG6SRYO2SIDO6J3RBOWJ","json":"https://pith.science/pith/MOGBYYQG6SRYO2SIDO6J3RBOWJ.json","graph_json":"https://pith.science/api/pith-number/MOGBYYQG6SRYO2SIDO6J3RBOWJ/graph.json","events_json":"https://pith.science/api/pith-number/MOGBYYQG6SRYO2SIDO6J3RBOWJ/events.json","paper":"https://pith.science/paper/MOGBYYQG"},"agent_actions":{"view_html":"https://pith.science/pith/MOGBYYQG6SRYO2SIDO6J3RBOWJ","download_json":"https://pith.science/pith/MOGBYYQG6SRYO2SIDO6J3RBOWJ.json","view_paper":"https://pith.science/paper/MOGBYYQG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02263&json=true","fetch_graph":"https://pith.science/api/pith-number/MOGBYYQG6SRYO2SIDO6J3RBOWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/MOGBYYQG6SRYO2SIDO6J3RBOWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MOGBYYQG6SRYO2SIDO6J3RBOWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MOGBYYQG6SRYO2SIDO6J3RBOWJ/action/storage_attestation","attest_author":"https://pith.science/pith/MOGBYYQG6SRYO2SIDO6J3RBOWJ/action/author_attestation","sign_citation":"https://pith.science/pith/MOGBYYQG6SRYO2SIDO6J3RBOWJ/action/citation_signature","submit_replication":"https://pith.science/pith/MOGBYYQG6SRYO2SIDO6J3RBOWJ/action/replication_record"}},"created_at":"2026-05-18T00:31:59.587667+00:00","updated_at":"2026-05-18T00:31:59.587667+00:00"}