{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:TC25NK4WYOU4CICMAT7TD3VLYZ","short_pith_number":"pith:TC25NK4W","schema_version":"1.0","canonical_sha256":"98b5d6ab96c3a9c1204c04ff31eeabc6650ebf5a345cfa48be4ca028109e0fb7","source":{"kind":"arxiv","id":"2204.08807","version":1},"attestation_state":"computed","paper":{"title":"Multi-level Cross-view Contrastive Learning for Knowledge-aware Recommender System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Ding Zou, Feida Zhu, Minghui Qiu, Wei Wei, Xian-Ling Mao, Xin Cao, Ziyang Wang","submitted_at":"2022-04-19T11:07:30Z","abstract_excerpt":"Knowledge graph (KG) plays an increasingly important role in recommender systems. Recently, graph neural networks (GNNs) based model has gradually become the theme of knowledge-aware recommendation (KGR). However, there is a natural deficiency for GNN-based KGR models, that is, the sparse supervised signal problem, which may make their actual performance drop to some extent. Inspired by the recent success of contrastive learning in mining supervised signals from data itself, in this paper, we focus on exploring the contrastive learning in KG-aware recommendation and propose a novel multi-level"},"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":"2204.08807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2022-04-19T11:07:30Z","cross_cats_sorted":[],"title_canon_sha256":"7bb060801fb5d5153a9228e3123e8c3f0dfbfbc4d158783ded5aa60cf4b1fadc","abstract_canon_sha256":"0fe7ae510310403f3890963c2e4956ae24720e6727ba75f2436327637f5d00df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:16:07.572657Z","signature_b64":"Stan2iPxDcrGpDjxVDzaAIw4fJm4qRkR7i6tayzQqaIm8hb9nOOOambtMXpRHm/ct+7BMDXF0TKTqwUgXnKLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98b5d6ab96c3a9c1204c04ff31eeabc6650ebf5a345cfa48be4ca028109e0fb7","last_reissued_at":"2026-07-05T04:16:07.572186Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:16:07.572186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-level Cross-view Contrastive Learning for Knowledge-aware Recommender System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Ding Zou, Feida Zhu, Minghui Qiu, Wei Wei, Xian-Ling Mao, Xin Cao, Ziyang Wang","submitted_at":"2022-04-19T11:07:30Z","abstract_excerpt":"Knowledge graph (KG) plays an increasingly important role in recommender systems. Recently, graph neural networks (GNNs) based model has gradually become the theme of knowledge-aware recommendation (KGR). However, there is a natural deficiency for GNN-based KGR models, that is, the sparse supervised signal problem, which may make their actual performance drop to some extent. Inspired by the recent success of contrastive learning in mining supervised signals from data itself, in this paper, we focus on exploring the contrastive learning in KG-aware recommendation and propose a novel multi-level"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.08807","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2204.08807/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2204.08807","created_at":"2026-07-05T04:16:07.572250+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.08807v1","created_at":"2026-07-05T04:16:07.572250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.08807","created_at":"2026-07-05T04:16:07.572250+00:00"},{"alias_kind":"pith_short_12","alias_value":"TC25NK4WYOU4","created_at":"2026-07-05T04:16:07.572250+00:00"},{"alias_kind":"pith_short_16","alias_value":"TC25NK4WYOU4CICM","created_at":"2026-07-05T04:16:07.572250+00:00"},{"alias_kind":"pith_short_8","alias_value":"TC25NK4W","created_at":"2026-07-05T04:16:07.572250+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08499","citing_title":"Multi-Level Graph Attention Network Contrastive Learning for Knowledge-Aware Recommendation","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TC25NK4WYOU4CICMAT7TD3VLYZ","json":"https://pith.science/pith/TC25NK4WYOU4CICMAT7TD3VLYZ.json","graph_json":"https://pith.science/api/pith-number/TC25NK4WYOU4CICMAT7TD3VLYZ/graph.json","events_json":"https://pith.science/api/pith-number/TC25NK4WYOU4CICMAT7TD3VLYZ/events.json","paper":"https://pith.science/paper/TC25NK4W"},"agent_actions":{"view_html":"https://pith.science/pith/TC25NK4WYOU4CICMAT7TD3VLYZ","download_json":"https://pith.science/pith/TC25NK4WYOU4CICMAT7TD3VLYZ.json","view_paper":"https://pith.science/paper/TC25NK4W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.08807&json=true","fetch_graph":"https://pith.science/api/pith-number/TC25NK4WYOU4CICMAT7TD3VLYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/TC25NK4WYOU4CICMAT7TD3VLYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TC25NK4WYOU4CICMAT7TD3VLYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TC25NK4WYOU4CICMAT7TD3VLYZ/action/storage_attestation","attest_author":"https://pith.science/pith/TC25NK4WYOU4CICMAT7TD3VLYZ/action/author_attestation","sign_citation":"https://pith.science/pith/TC25NK4WYOU4CICMAT7TD3VLYZ/action/citation_signature","submit_replication":"https://pith.science/pith/TC25NK4WYOU4CICMAT7TD3VLYZ/action/replication_record"}},"created_at":"2026-07-05T04:16:07.572250+00:00","updated_at":"2026-07-05T04:16:07.572250+00:00"}