{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Y23OP2ZONDIZM6VLNUJQBETLLC","short_pith_number":"pith:Y23OP2ZO","schema_version":"1.0","canonical_sha256":"c6b6e7eb2e68d1967aab6d1300926b58be7665d2d6e30eee446ee8a3912b4eb5","source":{"kind":"arxiv","id":"2412.03097","version":1},"attestation_state":"computed","paper":{"title":"Enhancing Recommendation Systems with GNNs and Addressing Over-Smoothing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Jiacheng Hu, Junliang Du, Wenyi Liu, Xinshi Li, Yuanshuai Luo, Ziqi Zhang","submitted_at":"2024-12-04T07:50:27Z","abstract_excerpt":"This paper addresses key challenges in enhancing recommendation systems by leveraging Graph Neural Networks (GNNs) and addressing inherent limitations such as over-smoothing, which reduces model effectiveness as network hierarchy deepens. The proposed approach introduces three GNN-based recommendation models, specifically designed to mitigate over-smoothing through innovative mechanisms like residual connections and identity mapping within the aggregation propagation process. These modifications enable more effective information flow across layers, preserving essential user-item interaction de"},"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":"2412.03097","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-12-04T07:50:27Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d5e8514fcb15a374526919aa57a03c5b95b6cdcd388c0afaa1577b4039d69c59","abstract_canon_sha256":"57a7cb96ffc4575c4b6fff01b8f28f0a6c3582386c3df00298a5b974b23dae01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:44:24.910406Z","signature_b64":"UYYOowcqDWbwJ0TwksTv4ENnbdzilS3tWvAjNpE5D5spZbHboXlj5XKnKWjAXox6qvOvxWuUK7rrAUTu/qmeAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6b6e7eb2e68d1967aab6d1300926b58be7665d2d6e30eee446ee8a3912b4eb5","last_reissued_at":"2026-07-05T09:44:24.909958Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:44:24.909958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhancing Recommendation Systems with GNNs and Addressing Over-Smoothing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Jiacheng Hu, Junliang Du, Wenyi Liu, Xinshi Li, Yuanshuai Luo, Ziqi Zhang","submitted_at":"2024-12-04T07:50:27Z","abstract_excerpt":"This paper addresses key challenges in enhancing recommendation systems by leveraging Graph Neural Networks (GNNs) and addressing inherent limitations such as over-smoothing, which reduces model effectiveness as network hierarchy deepens. The proposed approach introduces three GNN-based recommendation models, specifically designed to mitigate over-smoothing through innovative mechanisms like residual connections and identity mapping within the aggregation propagation process. These modifications enable more effective information flow across layers, preserving essential user-item interaction de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03097","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/2412.03097/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":"2412.03097","created_at":"2026-07-05T09:44:24.910015+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.03097v1","created_at":"2026-07-05T09:44:24.910015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03097","created_at":"2026-07-05T09:44:24.910015+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y23OP2ZONDIZ","created_at":"2026-07-05T09:44:24.910015+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y23OP2ZONDIZM6VL","created_at":"2026-07-05T09:44:24.910015+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y23OP2ZO","created_at":"2026-07-05T09:44:24.910015+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.19420","citing_title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y23OP2ZONDIZM6VLNUJQBETLLC","json":"https://pith.science/pith/Y23OP2ZONDIZM6VLNUJQBETLLC.json","graph_json":"https://pith.science/api/pith-number/Y23OP2ZONDIZM6VLNUJQBETLLC/graph.json","events_json":"https://pith.science/api/pith-number/Y23OP2ZONDIZM6VLNUJQBETLLC/events.json","paper":"https://pith.science/paper/Y23OP2ZO"},"agent_actions":{"view_html":"https://pith.science/pith/Y23OP2ZONDIZM6VLNUJQBETLLC","download_json":"https://pith.science/pith/Y23OP2ZONDIZM6VLNUJQBETLLC.json","view_paper":"https://pith.science/paper/Y23OP2ZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.03097&json=true","fetch_graph":"https://pith.science/api/pith-number/Y23OP2ZONDIZM6VLNUJQBETLLC/graph.json","fetch_events":"https://pith.science/api/pith-number/Y23OP2ZONDIZM6VLNUJQBETLLC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y23OP2ZONDIZM6VLNUJQBETLLC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y23OP2ZONDIZM6VLNUJQBETLLC/action/storage_attestation","attest_author":"https://pith.science/pith/Y23OP2ZONDIZM6VLNUJQBETLLC/action/author_attestation","sign_citation":"https://pith.science/pith/Y23OP2ZONDIZM6VLNUJQBETLLC/action/citation_signature","submit_replication":"https://pith.science/pith/Y23OP2ZONDIZM6VLNUJQBETLLC/action/replication_record"}},"created_at":"2026-07-05T09:44:24.910015+00:00","updated_at":"2026-07-05T09:44:24.910015+00:00"}