{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:E4T5QITTD2EUEM66N4DKC3Z2DP","short_pith_number":"pith:E4T5QITT","schema_version":"1.0","canonical_sha256":"2727d822731e894233de6f06a16f3a1bf72e0c83053c0859b0c18af16211fffe","source":{"kind":"arxiv","id":"2108.07567","version":1},"attestation_state":"computed","paper":{"title":"How Powerful is Graph Convolution for Recommendation?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP"],"primary_cat":"cs.IR","authors_text":"Caihua Shan, Dongsheng Li, Jun Zhang, Khaled B. Letaief, Yao Zhang, Yifei Shen, Yongji Wu","submitted_at":"2021-08-17T11:38:18Z","abstract_excerpt":"Graph convolutional networks (GCNs) have recently enabled a popular class of algorithms for collaborative filtering (CF). Nevertheless, the theoretical underpinnings of their empirical successes remain elusive. In this paper, we endeavor to obtain a better understanding of GCN-based CF methods via the lens of graph signal processing. By identifying the critical role of smoothness, a key concept in graph signal processing, we develop a unified graph convolution-based framework for CF. We prove that many existing CF methods are special cases of this framework, including the neighborhood-based me"},"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":"2108.07567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-08-17T11:38:18Z","cross_cats_sorted":["cs.LG","eess.SP"],"title_canon_sha256":"b01fe12bdaab26fdfc0d5af96e547d95716888317d8b295b97511b576b51911a","abstract_canon_sha256":"4813af298599807377167f63729231baad329bb6661955fa6896290ec24603f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:06:40.352720Z","signature_b64":"4wk8XPYaqJJARiIzodMW6yWxuMWFqHxMxLTjWtuSntCG2sJlgVhtAog3h373BfQrYvXwi4JuOeyNJ4AvLHIdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2727d822731e894233de6f06a16f3a1bf72e0c83053c0859b0c18af16211fffe","last_reissued_at":"2026-07-05T03:06:40.352281Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:06:40.352281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How Powerful is Graph Convolution for Recommendation?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP"],"primary_cat":"cs.IR","authors_text":"Caihua Shan, Dongsheng Li, Jun Zhang, Khaled B. Letaief, Yao Zhang, Yifei Shen, Yongji Wu","submitted_at":"2021-08-17T11:38:18Z","abstract_excerpt":"Graph convolutional networks (GCNs) have recently enabled a popular class of algorithms for collaborative filtering (CF). Nevertheless, the theoretical underpinnings of their empirical successes remain elusive. In this paper, we endeavor to obtain a better understanding of GCN-based CF methods via the lens of graph signal processing. By identifying the critical role of smoothness, a key concept in graph signal processing, we develop a unified graph convolution-based framework for CF. We prove that many existing CF methods are special cases of this framework, including the neighborhood-based me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.07567","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/2108.07567/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":"2108.07567","created_at":"2026-07-05T03:06:40.352351+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.07567v1","created_at":"2026-07-05T03:06:40.352351+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.07567","created_at":"2026-07-05T03:06:40.352351+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4T5QITTD2EU","created_at":"2026-07-05T03:06:40.352351+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4T5QITTD2EUEM66","created_at":"2026-07-05T03:06:40.352351+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4T5QITT","created_at":"2026-07-05T03:06:40.352351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.10247","citing_title":"DualSpectralCF: Training-Free Sign-Aware Spectral Collaborative Filtering","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E4T5QITTD2EUEM66N4DKC3Z2DP","json":"https://pith.science/pith/E4T5QITTD2EUEM66N4DKC3Z2DP.json","graph_json":"https://pith.science/api/pith-number/E4T5QITTD2EUEM66N4DKC3Z2DP/graph.json","events_json":"https://pith.science/api/pith-number/E4T5QITTD2EUEM66N4DKC3Z2DP/events.json","paper":"https://pith.science/paper/E4T5QITT"},"agent_actions":{"view_html":"https://pith.science/pith/E4T5QITTD2EUEM66N4DKC3Z2DP","download_json":"https://pith.science/pith/E4T5QITTD2EUEM66N4DKC3Z2DP.json","view_paper":"https://pith.science/paper/E4T5QITT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.07567&json=true","fetch_graph":"https://pith.science/api/pith-number/E4T5QITTD2EUEM66N4DKC3Z2DP/graph.json","fetch_events":"https://pith.science/api/pith-number/E4T5QITTD2EUEM66N4DKC3Z2DP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4T5QITTD2EUEM66N4DKC3Z2DP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4T5QITTD2EUEM66N4DKC3Z2DP/action/storage_attestation","attest_author":"https://pith.science/pith/E4T5QITTD2EUEM66N4DKC3Z2DP/action/author_attestation","sign_citation":"https://pith.science/pith/E4T5QITTD2EUEM66N4DKC3Z2DP/action/citation_signature","submit_replication":"https://pith.science/pith/E4T5QITTD2EUEM66N4DKC3Z2DP/action/replication_record"}},"created_at":"2026-07-05T03:06:40.352351+00:00","updated_at":"2026-07-05T03:06:40.352351+00:00"}