{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BK3JZ2GV564IQ6QID2K7NEIVW5","short_pith_number":"pith:BK3JZ2GV","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"},"canonical_sha256":"0ab69ce8d5efb8887a081e95f69115b76f9a680db9677885d925675e3d881f3b","source":{"kind":"arxiv","id":"1904.12575","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12575","created_at":"2026-05-17T23:47:34Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12575v1","created_at":"2026-05-17T23:47:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12575","created_at":"2026-05-17T23:47:34Z"},{"alias_kind":"pith_short_12","alias_value":"BK3JZ2GV564I","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BK3JZ2GV564IQ6QI","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BK3JZ2GV","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BK3JZ2GV564IQ6QID2K7NEIVW5","target":"record","payload":{"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"},"canonical_sha256":"0ab69ce8d5efb8887a081e95f69115b76f9a680db9677885d925675e3d881f3b","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"},"source_kind":"arxiv","source_id":"1904.12575","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u94vppUujIq4CTnbSKV5TCDnC6unnf/07X7FyDEvKcOlNCdjgUctP8DQKpkDswoPDnuX7GVEJmn4q/UlJM+EAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:54:42.748435Z"},"content_sha256":"de6062cd200db2745d32863669ac8898fd90e2adf74c5faf2a0b402adb828555","schema_version":"1.0","event_id":"sha256:de6062cd200db2745d32863669ac8898fd90e2adf74c5faf2a0b402adb828555"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BK3JZ2GV564IQ6QID2K7NEIVW5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:47:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qEtOS+tsOxnD7/Uvh4FlPFFXUtR8Sj0ikcbshoBfF7gaF/hIbWHUCo04IWO3+hyF+vU10VmIlAUNWa5JDdOYDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:54:42.749075Z"},"content_sha256":"41612617de5b573dca20cb27a75d06c64cf93e19e89afd41ccef2d3cad1883fa","schema_version":"1.0","event_id":"sha256:41612617de5b573dca20cb27a75d06c64cf93e19e89afd41ccef2d3cad1883fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BK3JZ2GV564IQ6QID2K7NEIVW5/bundle.json","state_url":"https://pith.science/pith/BK3JZ2GV564IQ6QID2K7NEIVW5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BK3JZ2GV564IQ6QID2K7NEIVW5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T16:54:42Z","links":{"resolver":"https://pith.science/pith/BK3JZ2GV564IQ6QID2K7NEIVW5","bundle":"https://pith.science/pith/BK3JZ2GV564IQ6QID2K7NEIVW5/bundle.json","state":"https://pith.science/pith/BK3JZ2GV564IQ6QID2K7NEIVW5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BK3JZ2GV564IQ6QID2K7NEIVW5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BK3JZ2GV564IQ6QID2K7NEIVW5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"19ff36fa5f740deb68cf720926fad6bde97a0523f77250db390bbcadb7e52ccc","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-18T17:17:34Z","title_canon_sha256":"cbe3cee691795e13a951939eedd128b8d2bb22ab2ed98baac8b806bcf58e27c2"},"schema_version":"1.0","source":{"id":"1904.12575","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12575","created_at":"2026-05-17T23:47:34Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12575v1","created_at":"2026-05-17T23:47:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12575","created_at":"2026-05-17T23:47:34Z"},{"alias_kind":"pith_short_12","alias_value":"BK3JZ2GV564I","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BK3JZ2GV564IQ6QI","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BK3JZ2GV","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:41612617de5b573dca20cb27a75d06c64cf93e19e89afd41ccef2d3cad1883fa","target":"graph","created_at":"2026-05-17T23:47:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Hongwei Wang, Miao Zhao, Minyi Guo, Wenjie Li, Xing Xie","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-18T17:17:34Z","title":"Knowledge Graph Convolutional Networks for Recommender Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12575","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:de6062cd200db2745d32863669ac8898fd90e2adf74c5faf2a0b402adb828555","target":"record","created_at":"2026-05-17T23:47:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"19ff36fa5f740deb68cf720926fad6bde97a0523f77250db390bbcadb7e52ccc","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-18T17:17:34Z","title_canon_sha256":"cbe3cee691795e13a951939eedd128b8d2bb22ab2ed98baac8b806bcf58e27c2"},"schema_version":"1.0","source":{"id":"1904.12575","kind":"arxiv","version":1}},"canonical_sha256":"0ab69ce8d5efb8887a081e95f69115b76f9a680db9677885d925675e3d881f3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ab69ce8d5efb8887a081e95f69115b76f9a680db9677885d925675e3d881f3b","first_computed_at":"2026-05-17T23:47:34.795379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:34.795379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DtdjZleDAjGmHsPIq0K3RtXQqfczkEjAufe1NheD+VSskw2JLiPoRGJZj/aV94H7DBlzq37qAHQ0whM/pZVpBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:34.795997Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.12575","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de6062cd200db2745d32863669ac8898fd90e2adf74c5faf2a0b402adb828555","sha256:41612617de5b573dca20cb27a75d06c64cf93e19e89afd41ccef2d3cad1883fa"],"state_sha256":"f2a7c66ef46f9018e3afd4e41965c050f16bed2810fee1590cb5768f4a83e2ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gBervGyWNC6LGZZVKPJP3kcmonnH8khgs6wF9EHc1lopUXMMXYpER8MTV0Qjvx5CNvbYcAKsGF5ccwe11zEDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:54:42.752668Z","bundle_sha256":"104d16607d04d013bf07d099731624757d26e2222953cb807be0405a9902b1c5"}}