{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RTKGIGWSQOFJ6XIFXGESKTIDLN","short_pith_number":"pith:RTKGIGWS","schema_version":"1.0","canonical_sha256":"8cd4641ad2838a9f5d05b989254d035b72df5d6f5c33ca8cc0a29b256343e8e6","source":{"kind":"arxiv","id":"2304.07506","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical and Contrastive Representation Learning for Knowledge-aware Recommendation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Bei Guan, Bingchao Wu, Daoguang Zan, Yangyuxuan Kang, Yongji Wang","submitted_at":"2023-04-15T08:22:22Z","abstract_excerpt":"Incorporating knowledge graph into recommendation is an effective way to alleviate data sparsity. Most existing knowledge-aware methods usually perform recursive embedding propagation by enumerating graph neighbors. However, the number of nodes' neighbors grows exponentially as the hop number increases, forcing the nodes to be aware of vast neighbors under this recursive propagation for distilling the high-order semantic relatedness. This may induce more harmful noise than useful information into recommendation, leading the learned node representations to be indistinguishable from each other, "},"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":"2304.07506","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-04-15T08:22:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7593720a711a4a724a61fa0c1619deea9837d366ac017ff206a1bd9b222237de","abstract_canon_sha256":"601f6878af57aa9d243f1d7731912f849d22eb79dd81d5b1538dcd5a872646a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:01:22.308039Z","signature_b64":"01g85+R3DXFHlg7L1WLxURS9Bcwe3YRJxgLr+f57D95/LjfdcV5N25wEzDrjGP/qoqcRKfEtEFRx2Kbx57pqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cd4641ad2838a9f5d05b989254d035b72df5d6f5c33ca8cc0a29b256343e8e6","last_reissued_at":"2026-07-05T06:01:22.307634Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:01:22.307634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical and Contrastive Representation Learning for Knowledge-aware Recommendation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Bei Guan, Bingchao Wu, Daoguang Zan, Yangyuxuan Kang, Yongji Wang","submitted_at":"2023-04-15T08:22:22Z","abstract_excerpt":"Incorporating knowledge graph into recommendation is an effective way to alleviate data sparsity. Most existing knowledge-aware methods usually perform recursive embedding propagation by enumerating graph neighbors. However, the number of nodes' neighbors grows exponentially as the hop number increases, forcing the nodes to be aware of vast neighbors under this recursive propagation for distilling the high-order semantic relatedness. This may induce more harmful noise than useful information into recommendation, leading the learned node representations to be indistinguishable from each other, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.07506","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/2304.07506/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":"2304.07506","created_at":"2026-07-05T06:01:22.307691+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.07506v1","created_at":"2026-07-05T06:01:22.307691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.07506","created_at":"2026-07-05T06:01:22.307691+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTKGIGWSQOFJ","created_at":"2026-07-05T06:01:22.307691+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTKGIGWSQOFJ6XIF","created_at":"2026-07-05T06:01:22.307691+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTKGIGWS","created_at":"2026-07-05T06:01:22.307691+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RTKGIGWSQOFJ6XIFXGESKTIDLN","json":"https://pith.science/pith/RTKGIGWSQOFJ6XIFXGESKTIDLN.json","graph_json":"https://pith.science/api/pith-number/RTKGIGWSQOFJ6XIFXGESKTIDLN/graph.json","events_json":"https://pith.science/api/pith-number/RTKGIGWSQOFJ6XIFXGESKTIDLN/events.json","paper":"https://pith.science/paper/RTKGIGWS"},"agent_actions":{"view_html":"https://pith.science/pith/RTKGIGWSQOFJ6XIFXGESKTIDLN","download_json":"https://pith.science/pith/RTKGIGWSQOFJ6XIFXGESKTIDLN.json","view_paper":"https://pith.science/paper/RTKGIGWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.07506&json=true","fetch_graph":"https://pith.science/api/pith-number/RTKGIGWSQOFJ6XIFXGESKTIDLN/graph.json","fetch_events":"https://pith.science/api/pith-number/RTKGIGWSQOFJ6XIFXGESKTIDLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTKGIGWSQOFJ6XIFXGESKTIDLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTKGIGWSQOFJ6XIFXGESKTIDLN/action/storage_attestation","attest_author":"https://pith.science/pith/RTKGIGWSQOFJ6XIFXGESKTIDLN/action/author_attestation","sign_citation":"https://pith.science/pith/RTKGIGWSQOFJ6XIFXGESKTIDLN/action/citation_signature","submit_replication":"https://pith.science/pith/RTKGIGWSQOFJ6XIFXGESKTIDLN/action/replication_record"}},"created_at":"2026-07-05T06:01:22.307691+00:00","updated_at":"2026-07-05T06:01:22.307691+00:00"}