{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:YY56RJKXTNBT4JIHR2AZAATWCS","short_pith_number":"pith:YY56RJKX","schema_version":"1.0","canonical_sha256":"c63be8a5579b433e25078e8190027614a9023c0187be966514c8dda04de5bfe7","source":{"kind":"arxiv","id":"2207.11088","version":2},"attestation_state":"computed","paper":{"title":"Layer-refined Graph Convolutional Networks for Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chunyan Miao, Donghui Lin, Xin Zhou, Yong Liu","submitted_at":"2022-07-22T13:54:59Z","abstract_excerpt":"Recommendation models utilizing Graph Convolutional Networks (GCNs) have achieved state-of-the-art performance, as they can integrate both the node information and the topological structure of the user-item interaction graph. However, these GCN-based recommendation models not only suffer from over-smoothing when stacking too many layers but also bear performance degeneration resulting from the existence of noise in user-item interactions. In this paper, we first identify a recommendation dilemma of over-smoothing and solution collapsing in current GCN-based models. Specifically, these models u"},"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":"2207.11088","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2022-07-22T13:54:59Z","cross_cats_sorted":[],"title_canon_sha256":"8037628e640e7f9848d0db585ed8ac182c82974d91a42f1792b64b5e823a326a","abstract_canon_sha256":"74250b60ad96a8ae17fd9ebd63c4b82f3d98c9360ebaac72dbee51e6d29859c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:19:17.823835Z","signature_b64":"eq2zRa5lb80VFBxV0FNvupwjNbHF7ghDCbkI6ORyPjSYqa04DcFpbrm0fS5CMNwf9ChA37EHYV/5X5YxixeZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c63be8a5579b433e25078e8190027614a9023c0187be966514c8dda04de5bfe7","last_reissued_at":"2026-07-05T05:19:17.823391Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:19:17.823391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Layer-refined Graph Convolutional Networks for Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chunyan Miao, Donghui Lin, Xin Zhou, Yong Liu","submitted_at":"2022-07-22T13:54:59Z","abstract_excerpt":"Recommendation models utilizing Graph Convolutional Networks (GCNs) have achieved state-of-the-art performance, as they can integrate both the node information and the topological structure of the user-item interaction graph. However, these GCN-based recommendation models not only suffer from over-smoothing when stacking too many layers but also bear performance degeneration resulting from the existence of noise in user-item interactions. In this paper, we first identify a recommendation dilemma of over-smoothing and solution collapsing in current GCN-based models. Specifically, these models u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.11088","kind":"arxiv","version":2},"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/2207.11088/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":"2207.11088","created_at":"2026-07-05T05:19:17.823450+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.11088v2","created_at":"2026-07-05T05:19:17.823450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.11088","created_at":"2026-07-05T05:19:17.823450+00:00"},{"alias_kind":"pith_short_12","alias_value":"YY56RJKXTNBT","created_at":"2026-07-05T05:19:17.823450+00:00"},{"alias_kind":"pith_short_16","alias_value":"YY56RJKXTNBT4JIH","created_at":"2026-07-05T05:19:17.823450+00:00"},{"alias_kind":"pith_short_8","alias_value":"YY56RJKX","created_at":"2026-07-05T05:19:17.823450+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.13908","citing_title":"Graph Neural Controlled Differential Equations For Collaborative Filtering","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YY56RJKXTNBT4JIHR2AZAATWCS","json":"https://pith.science/pith/YY56RJKXTNBT4JIHR2AZAATWCS.json","graph_json":"https://pith.science/api/pith-number/YY56RJKXTNBT4JIHR2AZAATWCS/graph.json","events_json":"https://pith.science/api/pith-number/YY56RJKXTNBT4JIHR2AZAATWCS/events.json","paper":"https://pith.science/paper/YY56RJKX"},"agent_actions":{"view_html":"https://pith.science/pith/YY56RJKXTNBT4JIHR2AZAATWCS","download_json":"https://pith.science/pith/YY56RJKXTNBT4JIHR2AZAATWCS.json","view_paper":"https://pith.science/paper/YY56RJKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.11088&json=true","fetch_graph":"https://pith.science/api/pith-number/YY56RJKXTNBT4JIHR2AZAATWCS/graph.json","fetch_events":"https://pith.science/api/pith-number/YY56RJKXTNBT4JIHR2AZAATWCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YY56RJKXTNBT4JIHR2AZAATWCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YY56RJKXTNBT4JIHR2AZAATWCS/action/storage_attestation","attest_author":"https://pith.science/pith/YY56RJKXTNBT4JIHR2AZAATWCS/action/author_attestation","sign_citation":"https://pith.science/pith/YY56RJKXTNBT4JIHR2AZAATWCS/action/citation_signature","submit_replication":"https://pith.science/pith/YY56RJKXTNBT4JIHR2AZAATWCS/action/replication_record"}},"created_at":"2026-07-05T05:19:17.823450+00:00","updated_at":"2026-07-05T05:19:17.823450+00:00"}