{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BK3JZ2GV564IQ6QID2K7NEIVW5","short_pith_number":"pith:BK3JZ2GV","schema_version":"1.0","canonical_sha256":"0ab69ce8d5efb8887a081e95f69115b76f9a680db9677885d925675e3d881f3b","source":{"kind":"arxiv","id":"1904.12575","version":1},"attestation_state":"computed","paper":{"title":"Knowledge Graph Convolutional Networks for Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Hongwei Wang, Miao Zhao, Minyi Guo, Wenjie Li, Xing Xie","submitted_at":"2019-03-18T17:17:34Z","abstract_excerpt":"To alleviate sparsity and cold start problem of collaborative filtering based recommender systems, researchers and engineers usually collect attributes of users and items, and design delicate algorithms to exploit these additional information. In general, the attributes are not isolated but connected with each other, which forms a knowledge graph (KG). In this paper, we propose Knowledge Graph Convolutional Networks (KGCN), an end-to-end framework that captures inter-item relatedness effectively by mining their associated attributes on the KG. To automatically discover both high-order structur"},"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":"1904.12575","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-18T17:17:34Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"cbe3cee691795e13a951939eedd128b8d2bb22ab2ed98baac8b806bcf58e27c2","abstract_canon_sha256":"19ff36fa5f740deb68cf720926fad6bde97a0523f77250db390bbcadb7e52ccc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:34.795997Z","signature_b64":"DtdjZleDAjGmHsPIq0K3RtXQqfczkEjAufe1NheD+VSskw2JLiPoRGJZj/aV94H7DBlzq37qAHQ0whM/pZVpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ab69ce8d5efb8887a081e95f69115b76f9a680db9677885d925675e3d881f3b","last_reissued_at":"2026-05-17T23:47:34.795379Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:34.795379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Knowledge Graph Convolutional Networks for Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Hongwei Wang, Miao Zhao, Minyi Guo, Wenjie Li, Xing Xie","submitted_at":"2019-03-18T17:17:34Z","abstract_excerpt":"To alleviate sparsity and cold start problem of collaborative filtering based recommender systems, researchers and engineers usually collect attributes of users and items, and design delicate algorithms to exploit these additional information. In general, the attributes are not isolated but connected with each other, which forms a knowledge graph (KG). In this paper, we propose Knowledge Graph Convolutional Networks (KGCN), an end-to-end framework that captures inter-item relatedness effectively by mining their associated attributes on the KG. To automatically discover both high-order structur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12575","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":"1904.12575","created_at":"2026-05-17T23:47:34.795499+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.12575v1","created_at":"2026-05-17T23:47:34.795499+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12575","created_at":"2026-05-17T23:47:34.795499+00:00"},{"alias_kind":"pith_short_12","alias_value":"BK3JZ2GV564I","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BK3JZ2GV564IQ6QI","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BK3JZ2GV","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.12651","citing_title":"Learning Chain Of Thoughts Prompts for Predicting Entities, Relations, and even Literals on Knowledge Graphs","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BK3JZ2GV564IQ6QID2K7NEIVW5","json":"https://pith.science/pith/BK3JZ2GV564IQ6QID2K7NEIVW5.json","graph_json":"https://pith.science/api/pith-number/BK3JZ2GV564IQ6QID2K7NEIVW5/graph.json","events_json":"https://pith.science/api/pith-number/BK3JZ2GV564IQ6QID2K7NEIVW5/events.json","paper":"https://pith.science/paper/BK3JZ2GV"},"agent_actions":{"view_html":"https://pith.science/pith/BK3JZ2GV564IQ6QID2K7NEIVW5","download_json":"https://pith.science/pith/BK3JZ2GV564IQ6QID2K7NEIVW5.json","view_paper":"https://pith.science/paper/BK3JZ2GV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.12575&json=true","fetch_graph":"https://pith.science/api/pith-number/BK3JZ2GV564IQ6QID2K7NEIVW5/graph.json","fetch_events":"https://pith.science/api/pith-number/BK3JZ2GV564IQ6QID2K7NEIVW5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BK3JZ2GV564IQ6QID2K7NEIVW5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BK3JZ2GV564IQ6QID2K7NEIVW5/action/storage_attestation","attest_author":"https://pith.science/pith/BK3JZ2GV564IQ6QID2K7NEIVW5/action/author_attestation","sign_citation":"https://pith.science/pith/BK3JZ2GV564IQ6QID2K7NEIVW5/action/citation_signature","submit_replication":"https://pith.science/pith/BK3JZ2GV564IQ6QID2K7NEIVW5/action/replication_record"}},"created_at":"2026-05-17T23:47:34.795499+00:00","updated_at":"2026-05-17T23:47:34.795499+00:00"}