{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/graph-convolutional-matrix-completion","title":"Graph Convolutional Matrix Completion","arxiv_id":"1706.02263","date":"2017-06-07","proceeding":null,"authors":["Rianne van den Berg","Thomas N. Kipf","Max Welling"],"abstract":"We consider matrix completion for recommender systems from the point of view\nof link prediction on graphs. Interaction data such as movie ratings can be\nrepresented by a bipartite user-item graph with labeled edges denoting observed\nratings. Building on recent progress in deep learning on graph-structured data,\nwe propose a graph auto-encoder framework based on differentiable message\npassing on the bipartite interaction graph. Our model shows competitive\nperformance on standard collaborative filtering benchmarks. In settings where\ncomplimentary feature information or structured data such as a social network\nis available, our framework outperforms recent state-of-the-art methods.","url_abs":"http://arxiv.org/abs/1706.02263v2","url_pdf":"http://arxiv.org/pdf/1706.02263v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"graph-convolutional-matrix-completion","repo_url":"https://github.com/riannevdberg/gc-mc","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"graph-convolutional-matrix-completion","repo_url":"https://github.com/OweysMomenzada/Graph-Neural-Networks-for-effecient-Recommender-Systems","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"graph-convolutional-matrix-completion","repo_url":"https://github.com/blueghostyi/id-grec","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"graph-convolutional-matrix-completion","repo_url":"https://github.com/hengruizhang98/GCMC-Pytorch-dgl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"graph-convolutional-matrix-completion","repo_url":"https://github.com/lmcRS/AWS-recommendation-papers","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"graph-convolutional-matrix-completion","repo_url":"https://github.com/paryanasr/HonoursProject-Recommender-System-gc-mc","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"graph-convolutional-matrix-completion","repo_url":"https://github.com/swtheing/Multiview-Link-Representation-Learning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"graph-convolutional-matrix-completion","repo_url":"https://github.com/tanimutomo/gcmc","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"graph-convolutional-matrix-completion","repo_url":"https://github.com/tjcdev/gcmc-tf2","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"graph-convolutional-matrix-completion","repo_url":"https://github.com/tobiasweede/rs-via-gnn","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"graph-convolutional-matrix-completion","repo_url":"https://github.com/tubamuzzaffar/g","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"graph-convolutional-matrix-completion","repo_url":"https://github.com/tubamuzzaffar/gc","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"graph-convolutional-matrix-completion","repo_url":"https://github.com/tubamuzzaffar/gc2","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"graph-convolutional-matrix-completion","repo_url":"https://github.com/tubamuzzaffar/gcmc-2","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"graph-convolutional-matrix-completion","repo_url":"https://github.com/xiaoleiHou214/gc-mc-master","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"graph-convolutional-matrix-completion","repo_url":"https://github.com/PreferredAI/cornac","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"graph-convolutional-matrix-completion","repo_url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/_deprecated/gcmc","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"collaborative-filtering","task_name":"Collaborative Filtering"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"matrix-completion","task_name":"Matrix Completion"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/recommendation-systems-on-douban-monti","task":"Recommendation Systems","dataset":"Douban Monti","model":"GC-MC","rank_in_archive_order":5,"of":8,"metrics":{"RMSE":"0.734"},"uses_additional_data":true},{"leaderboard":"/sota/recommendation-systems-on-flixster-monti","task":"Recommendation Systems","dataset":"Flixster Monti","model":"GC-MC","rank_in_archive_order":5,"of":7,"metrics":{"RMSE":"0.917"},"uses_additional_data":true},{"leaderboard":"/sota/collaborative-filtering-on-movielens-100k","task":"Recommendation Systems","dataset":"MovieLens 100K","model":"GC-MC","rank_in_archive_order":8,"of":18,"metrics":{"RMSE (u1 Splits)":"0.905"},"uses_additional_data":true},{"leaderboard":"/sota/collaborative-filtering-on-movielens-100k","task":"Recommendation Systems","dataset":"MovieLens 100K","model":"GC-MC","rank_in_archive_order":9,"of":18,"metrics":{"RMSE (u1 Splits)":"0.910"},"uses_additional_data":false},{"leaderboard":"/sota/collaborative-filtering-on-movielens-10m","task":"Recommendation Systems","dataset":"MovieLens 10M","model":"GC-MC","rank_in_archive_order":9,"of":17,"metrics":{"RMSE":"0.777"},"uses_additional_data":false},{"leaderboard":"/sota/collaborative-filtering-on-movielens-1m","task":"Recommendation Systems","dataset":"MovieLens 1M","model":"GC-MC","rank_in_archive_order":6,"of":31,"metrics":{"RMSE":"0.832"},"uses_additional_data":false},{"leaderboard":"/sota/recommendation-systems-on-yahoomusic-monti","task":"Recommendation Systems","dataset":"YahooMusic Monti","model":"GC-MC","rank_in_archive_order":4,"of":6,"metrics":{"RMSE":"20.5"},"uses_additional_data":true}],"syntology":{"syntology_url":"https://syntology.ai/paper/1706.02263","atlas_url":"https://app.syntology.ai/?focus=1706.02263","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1706.02263"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1706.02263\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1706.02263"},"call":"get_concepts_for_paper(arxiv_id=\"1706.02263\")"}],"by_repo":[{"repo":"riannevdberg/gc-mc","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"OweysMomenzada/Graph-Neural-Networks-for-effecient-Recommender-Systems","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"blueghostyi/id-grec","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"hengruizhang98/GCMC-Pytorch-dgl","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"lmcRS/AWS-recommendation-papers","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"paryanasr/HonoursProject-Recommender-System-gc-mc","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"swtheing/Multiview-Link-Representation-Learning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tanimutomo/gcmc","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tjcdev/gcmc-tf2","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tobiasweede/rs-via-gnn","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tubamuzzaffar/g","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tubamuzzaffar/gc","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tubamuzzaffar/gc2","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tubamuzzaffar/gcmc-2","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"xiaoleiHou214/gc-mc-master","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"PreferredAI/cornac","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2002.02126"],"harvested_for_calls":[{"arxiv_id":"2002.02126","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2002.02126"},"call":"get_harvested_code_for_paper(arxiv_id=\"2002.02126\")"}]},{"repo":"dmlc/dgl","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":6,"harvested_for":["1607.00653","1612.00222","1802.04364","1806.01973","2006.05582","2010.16103"],"harvested_for_calls":[{"arxiv_id":"1607.00653","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1607.00653"},"call":"get_harvested_code_for_paper(arxiv_id=\"1607.00653\")"},{"arxiv_id":"1612.00222","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1612.00222"},"call":"get_harvested_code_for_paper(arxiv_id=\"1612.00222\")"},{"arxiv_id":"1802.04364","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.04364"},"call":"get_harvested_code_for_paper(arxiv_id=\"1802.04364\")"},{"arxiv_id":"1806.01973","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1806.01973"},"call":"get_harvested_code_for_paper(arxiv_id=\"1806.01973\")"},{"arxiv_id":"2006.05582","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.05582"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.05582\")"},{"arxiv_id":"2010.16103","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.16103"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.16103\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"e5583845b40eb7b372251bb7adef82fae9f3ed90f576b71562aadfeab5baa78f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}