{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZVHTZZIWE5CTJ5YQOIIO446BJ7","short_pith_number":"pith:ZVHTZZIW","schema_version":"1.0","canonical_sha256":"cd4f3ce516274534f7107210ee73c14fd0417a0346a9cb2e74a83d1dc6d2e0e0","source":{"kind":"arxiv","id":"2401.12590","version":2},"attestation_state":"computed","paper":{"title":"PolyCF: Towards the Optimal Spectral Graph Filters for Collaborative Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Ming Zhang, Wei Ju, Xiao Luo, Yifang Qin, Yiyang Gu, Zhiping Xiao","submitted_at":"2024-01-23T09:45:49Z","abstract_excerpt":"Collaborative Filtering (CF) is a pivotal research area in recommender systems that capitalizes on collaborative similarities between users and items to provide personalized recommendations. With the remarkable achievements of node embedding-based Graph Neural Networks (GNNs), we explore the upper bounds of expressiveness inherent to embedding-based methodologies and tackle the challenges by reframing the CF task as a graph signal processing problem. To this end, we propose PolyCF, a flexible graph signal filter that leverages polynomial graph filters to process interaction signals. PolyCF exh"},"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":"2401.12590","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-01-23T09:45:49Z","cross_cats_sorted":[],"title_canon_sha256":"84ee38c1221071eae2acb7e49a328e78d73a7e06a82eeb528ce26875ace34e4a","abstract_canon_sha256":"302b928bdf2aafd0aa9b13d7254029fba34118cc5743de1d02ce2d0d5d89e794"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:38:34.747727Z","signature_b64":"juwPvlW0vD1bKPitJl8tUSSPAiTXjdJ/GLLV0YEXk2+4s8i9yeFpQm+Vy00lXzkh+QWvnatUeORx5BdEzC50Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd4f3ce516274534f7107210ee73c14fd0417a0346a9cb2e74a83d1dc6d2e0e0","last_reissued_at":"2026-07-05T07:38:34.747149Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:38:34.747149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PolyCF: Towards the Optimal Spectral Graph Filters for Collaborative Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Ming Zhang, Wei Ju, Xiao Luo, Yifang Qin, Yiyang Gu, Zhiping Xiao","submitted_at":"2024-01-23T09:45:49Z","abstract_excerpt":"Collaborative Filtering (CF) is a pivotal research area in recommender systems that capitalizes on collaborative similarities between users and items to provide personalized recommendations. With the remarkable achievements of node embedding-based Graph Neural Networks (GNNs), we explore the upper bounds of expressiveness inherent to embedding-based methodologies and tackle the challenges by reframing the CF task as a graph signal processing problem. To this end, we propose PolyCF, a flexible graph signal filter that leverages polynomial graph filters to process interaction signals. PolyCF exh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.12590","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/2401.12590/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":"2401.12590","created_at":"2026-07-05T07:38:34.747221+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.12590v2","created_at":"2026-07-05T07:38:34.747221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.12590","created_at":"2026-07-05T07:38:34.747221+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVHTZZIWE5CT","created_at":"2026-07-05T07:38:34.747221+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVHTZZIWE5CTJ5YQ","created_at":"2026-07-05T07:38:34.747221+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVHTZZIW","created_at":"2026-07-05T07:38:34.747221+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.00384","citing_title":"S-Diff: An Anisotropic Diffusion Model for Collaborative Filtering in Spectral Domain","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZVHTZZIWE5CTJ5YQOIIO446BJ7","json":"https://pith.science/pith/ZVHTZZIWE5CTJ5YQOIIO446BJ7.json","graph_json":"https://pith.science/api/pith-number/ZVHTZZIWE5CTJ5YQOIIO446BJ7/graph.json","events_json":"https://pith.science/api/pith-number/ZVHTZZIWE5CTJ5YQOIIO446BJ7/events.json","paper":"https://pith.science/paper/ZVHTZZIW"},"agent_actions":{"view_html":"https://pith.science/pith/ZVHTZZIWE5CTJ5YQOIIO446BJ7","download_json":"https://pith.science/pith/ZVHTZZIWE5CTJ5YQOIIO446BJ7.json","view_paper":"https://pith.science/paper/ZVHTZZIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.12590&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVHTZZIWE5CTJ5YQOIIO446BJ7/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVHTZZIWE5CTJ5YQOIIO446BJ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVHTZZIWE5CTJ5YQOIIO446BJ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVHTZZIWE5CTJ5YQOIIO446BJ7/action/storage_attestation","attest_author":"https://pith.science/pith/ZVHTZZIWE5CTJ5YQOIIO446BJ7/action/author_attestation","sign_citation":"https://pith.science/pith/ZVHTZZIWE5CTJ5YQOIIO446BJ7/action/citation_signature","submit_replication":"https://pith.science/pith/ZVHTZZIWE5CTJ5YQOIIO446BJ7/action/replication_record"}},"created_at":"2026-07-05T07:38:34.747221+00:00","updated_at":"2026-07-05T07:38:34.747221+00:00"}