{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GOTGUPBAS6XNUL5ME6M2CHCYQP","short_pith_number":"pith:GOTGUPBA","schema_version":"1.0","canonical_sha256":"33a66a3c2097aeda2fac2799a11c5883f31460747698209c709a63b0a3aced24","source":{"kind":"arxiv","id":"2406.01034","version":3},"attestation_state":"computed","paper":{"title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Edith Ngai, Jinfeng Xu, Jinze Li, Shuo Yang, Wei Wang, Xiping Hu, Zheyu Chen","submitted_at":"2024-06-03T06:36:04Z","abstract_excerpt":"Graph Collaborative Filtering (GCF) has emerged as a dominant paradigm in modern recommendation systems, excelling at modeling complex user-item interactions and capturing high-order collaborative signals through graph-structured learning. Most existing GCF models predominantly rely on simplified graph architectures like LightGCN, which strategically remove feature transformation and activation functions from vanilla graph convolution networks. Through systematic analysis, we reveal that feature transformation in message propagation can enhance model representation, though at the cost of incre"},"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":"2406.01034","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2024-06-03T06:36:04Z","cross_cats_sorted":[],"title_canon_sha256":"afffe693ef8d5e7ba436fc05d064db1194a0c22c05ce75fac5f882a60e875bb5","abstract_canon_sha256":"fc7cc33801969012e87a739845db6507359a7c28d5bdd84dce901e4fec08a7ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:40.848398Z","signature_b64":"ngQm9/AjHHPYwxU3ciC1pzluLWKZYY8Cp2xQ+ZHjtYM5LMh/FgD0ILkgf6rrC7dHvwCkn7cAVWVbp04ZJdGTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33a66a3c2097aeda2fac2799a11c5883f31460747698209c709a63b0a3aced24","last_reissued_at":"2026-07-05T11:53:40.847822Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:40.847822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Edith Ngai, Jinfeng Xu, Jinze Li, Shuo Yang, Wei Wang, Xiping Hu, Zheyu Chen","submitted_at":"2024-06-03T06:36:04Z","abstract_excerpt":"Graph Collaborative Filtering (GCF) has emerged as a dominant paradigm in modern recommendation systems, excelling at modeling complex user-item interactions and capturing high-order collaborative signals through graph-structured learning. Most existing GCF models predominantly rely on simplified graph architectures like LightGCN, which strategically remove feature transformation and activation functions from vanilla graph convolution networks. Through systematic analysis, we reveal that feature transformation in message propagation can enhance model representation, though at the cost of incre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.01034","kind":"arxiv","version":3},"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/2406.01034/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":"2406.01034","created_at":"2026-07-05T11:53:40.847890+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.01034v3","created_at":"2026-07-05T11:53:40.847890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.01034","created_at":"2026-07-05T11:53:40.847890+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOTGUPBAS6XN","created_at":"2026-07-05T11:53:40.847890+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOTGUPBAS6XNUL5M","created_at":"2026-07-05T11:53:40.847890+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOTGUPBA","created_at":"2026-07-05T11:53:40.847890+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":13,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17927","citing_title":"KANLib -- A Modular, Extensible and Fast Kolmogorov-Arnold Network Implementation","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05537","citing_title":"PHKT:Personalized Dynamic Hypergraph-enhanced KAN-Transformer for Multi-behavior Sequential Recommendation","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19031","citing_title":"KAN-MLP-Mixer: A comprehensive investigation of the usage of Kolmogorov-Arnold Networks (KANs) for improving IMU-based Human Activity Recognition","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2605.31414","citing_title":"Beyond Instance-Level Alignment and Uniformity: Semantic Factor Learning for Collaborative Filtering","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2410.04435","citing_title":"QKAN: quantum Kolmogorov-Arnold networks with applications in machine learning and multivariate state preparation","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2410.03801","citing_title":"P1-KAN: an effective Kolmogorov-Arnold network with application to hydraulic valley optimization","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2410.04096","citing_title":"Sinc Kolmogorov-Arnold network and its application for solving PDEs with singularities","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19031","citing_title":"KAN-MLP-Mixer: A comprehensive investigation of the usage of Kolmogorov-Arnold Networks (KANs) for improving IMU-based Human Activity Recognition","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2507.02466","citing_title":"Variational Kolmogorov-Arnold Network","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2510.25781","citing_title":"A Practitioner's Guide to Kolmogorov-Arnold Networks","ref_index":141,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03345","citing_title":"Hardware-Oriented Inference Complexity of Kolmogorov-Arnold Networks","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23599","citing_title":"Partition-of-Unity Gaussian Kolmogorov-Arnold Networks","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21174","citing_title":"Scale-Parameter Selection in Gaussian Kolmogorov-Arnold Networks","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GOTGUPBAS6XNUL5ME6M2CHCYQP","json":"https://pith.science/pith/GOTGUPBAS6XNUL5ME6M2CHCYQP.json","graph_json":"https://pith.science/api/pith-number/GOTGUPBAS6XNUL5ME6M2CHCYQP/graph.json","events_json":"https://pith.science/api/pith-number/GOTGUPBAS6XNUL5ME6M2CHCYQP/events.json","paper":"https://pith.science/paper/GOTGUPBA"},"agent_actions":{"view_html":"https://pith.science/pith/GOTGUPBAS6XNUL5ME6M2CHCYQP","download_json":"https://pith.science/pith/GOTGUPBAS6XNUL5ME6M2CHCYQP.json","view_paper":"https://pith.science/paper/GOTGUPBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.01034&json=true","fetch_graph":"https://pith.science/api/pith-number/GOTGUPBAS6XNUL5ME6M2CHCYQP/graph.json","fetch_events":"https://pith.science/api/pith-number/GOTGUPBAS6XNUL5ME6M2CHCYQP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOTGUPBAS6XNUL5ME6M2CHCYQP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOTGUPBAS6XNUL5ME6M2CHCYQP/action/storage_attestation","attest_author":"https://pith.science/pith/GOTGUPBAS6XNUL5ME6M2CHCYQP/action/author_attestation","sign_citation":"https://pith.science/pith/GOTGUPBAS6XNUL5ME6M2CHCYQP/action/citation_signature","submit_replication":"https://pith.science/pith/GOTGUPBAS6XNUL5ME6M2CHCYQP/action/replication_record"}},"created_at":"2026-07-05T11:53:40.847890+00:00","updated_at":"2026-07-05T11:53:40.847890+00:00"}