{"as_of":"2026-08-09T10:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e63f99d5168214a4a8930d9e2a3429e507cdd2f8061c16799a478e25eca0f0b4","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":26,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T16:37:05.856268Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T20:48:55.482437Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":"2406.01034","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-07-03T20:48:55.482437Z","title":"Fourierkan-gcf: Fourier kolmogorov-arnold network–an effective and efficient feature transformation for graph collaborative filtering","venue":null,"work_id":"788a1397-8e06-426d-9c5b-72a1c8d8c08e","year":2025},"citing_paper":{"arxiv_id":"2410.03801","last_updated":"2026-05-04T08:31:56Z","snapshot_observed_at":"2026-07-06T19:28:08.374354Z","submitted_at":"2024-10-04T08:14:24Z","title":"P1-KAN: an effective Kolmogorov-Arnold network with application to hydraulic valley optimization","version":5},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-23T19:55:26.613144Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2410.03801"},"observation_digest":"sha256:e51cc8d8bf0c0c07ffbc369763e83cdac7c1e4ea286f6ff212f75ac97fb5d765","observation_id":"76ab47b6-8736-43b6-9cae-05cd90754645","resolution":{"observed_at":"2026-05-23T19:55:47.274851Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":"2406.01034","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-07-03T20:48:55.482437Z","title":"Fourierkan-gcf: Fourier kolmogorov-arnold network–an effective and efficient feature transformation for graph collaborative filtering","venue":null,"work_id":"788a1397-8e06-426d-9c5b-72a1c8d8c08e","year":2025},"citing_paper":{"arxiv_id":"2410.04096","last_updated":"2026-05-27T13:27:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-10-05T09:33:39Z","title":"Sinc Kolmogorov-Arnold network and its application for solving PDEs with singularities","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-23T19:42:53.470132Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2410.04096"},"observation_digest":"sha256:9ccbc07426a3231329782efa8fa86aac998fa9a04557ed3beea05cafa7a6e519","observation_id":"00b5c1bf-5e7f-4c68-b83c-c4d8aa57b9b8","resolution":{"observed_at":"2026-05-23T19:43:22.901541Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":"2406.01034","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-07-03T20:48:55.482437Z","title":"Fourierkan-gcf: Fourier kolmogorov-arnold network–an effective and efficient feature transformation for graph collaborative filtering","venue":null,"work_id":"788a1397-8e06-426d-9c5b-72a1c8d8c08e","year":2025},"citing_paper":{"arxiv_id":"2410.04435","last_updated":"2026-05-13T08:15:37Z","snapshot_observed_at":"2026-07-06T19:28:35.110264Z","submitted_at":"2024-10-06T10:11:57Z","title":"QKAN: quantum Kolmogorov-Arnold networks with applications in machine learning and multivariate state preparation","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-23T20:14:02.080356Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2410.04435"},"observation_digest":"sha256:5f1b555504f602c50d828dfa83e4e72737f0c5bd928b5b7ca0ecffbc8a27dacd","observation_id":"bc66015c-c384-472c-82e8-47055218c1d8","resolution":{"observed_at":"2026-05-23T20:15:48.361527Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-08-08T16:37:05.856268Z","title":"FourierKAN-GCF: Fourier Kolmogorov-Arnold network–an effective and efficient feature transformation for graph collaborative filtering,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06153","last_updated":"2025-02-14T01:43:07Z","snapshot_observed_at":"2026-08-09T04:46:40.996804Z","submitted_at":"2025-02-10T04:57:07Z","title":"Low Tensor-Rank Adaptation of Kolmogorov--Arnold Networks","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T16:37:05.856268Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2502.06153"},"observation_digest":"sha256:efee140ce1bd4b5b097397256f8faf30717eafe060ed555e3f4a99335e663506","observation_id":"fcd5b1e7-58d0-43cb-a458-bb0d0cf469f7","resolution":{"observed_at":"2026-08-08T16:37:05.856268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-08-07T15:29:50.217805Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15103","last_updated":"2025-08-08T06:14:32Z","snapshot_observed_at":"2026-08-09T04:22:03.591072Z","submitted_at":"2025-05-21T04:54:18Z","title":"Khan-GCL: Kolmogorov-Arnold Network Based Graph Contrastive Learning with Hard Negatives","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:50.217805Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:297aa5d8b5dfa841ba68c0a274b4ce691c64c78d80ac092cd0856a3fadc27dc4","observation_id":"b74bc2b1-7662-42b6-8239-d1761997f2a7","resolution":{"observed_at":"2026-08-07T15:29:50.217805Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-08-07T15:01:33.807572Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16665","last_updated":"2025-05-22T13:28:55Z","snapshot_observed_at":"2026-08-09T05:54:31.207196Z","submitted_at":"2025-05-22T13:28:55Z","title":"MDVT: Enhancing Multimodal Recommendation with Model-Agnostic Multimodal-Driven Virtual Triplets","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T15:01:33.807572Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2505.16665"},"observation_digest":"sha256:a6f1926bc2cb2a9178699b86006e6672b173a4987bde827c3b151001c58f9006","observation_id":"e41abdc2-27f1-4116-a6f4-a161fb171438","resolution":{"observed_at":"2026-08-07T15:01:33.807572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-08-07T13:43:15.777531Z","title":"FourierKAN-GCF: Fourier Kolmogorov-Arnold Network–An Effective and Efficient Feature Transformation for Graph Collaborative Filtering,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21592","last_updated":"2025-05-27T14:29:35Z","snapshot_observed_at":"2026-08-08T00:04:15.838722Z","submitted_at":"2025-05-27T14:29:35Z","title":"Taylor expansion-based Kolmogorov-Arnold network for blind image quality assessment","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T13:43:15.777531Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2505.21592"},"observation_digest":"sha256:985df3d46f23e899685e8263678d14871859b7d15718d032f9479b39b1d48110","observation_id":"b6a076b2-daa9-4b25-aa35-44154ebb3cea","resolution":{"observed_at":"2026-08-07T13:43:15.777531Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-08-07T11:11:03.918121Z","title":"FourierKAN-GCF: Fourier Kolmogorov–Arnold network–an effective and efficient feature transformation for graph collaborative filtering,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.03302","last_updated":"2025-08-21T16:58:06Z","snapshot_observed_at":"2026-08-08T00:03:58.504463Z","submitted_at":"2025-06-03T18:41:30Z","title":"Multi-Exit Kolmogorov-Arnold Networks: enhancing accuracy and parsimony","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T11:11:03.918121Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2506.03302"},"observation_digest":"sha256:c8dfdb9e6181ae1d82f6b7230b57e807c9b4b80a979926abd51ba8cd539fa1ab","observation_id":"6e65e441-ed16-407b-8c18-bba1e230aa9d","resolution":{"observed_at":"2026-08-07T11:11:03.918121Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":"2406.01034","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-07-03T20:48:55.482437Z","title":"Fourierkan-gcf: Fourier kolmogorov-arnold network–an effective and efficient feature transformation for graph collaborative filtering","venue":null,"work_id":"788a1397-8e06-426d-9c5b-72a1c8d8c08e","year":2025},"citing_paper":{"arxiv_id":"2507.02466","last_updated":"2026-05-07T13:35:04Z","snapshot_observed_at":"2026-07-06T21:51:38.554688Z","submitted_at":"2025-07-03T09:24:09Z","title":"Variational Kolmogorov-Arnold Network","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-19T05:50:36.472912Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2507.02466"},"observation_digest":"sha256:278e541e912440b6a4e17c131028e726f42717b6a15d1a05a6fcc7ffd9c49ebd","observation_id":"ffa60b29-6805-4401-86c8-f0f1b5a30798","resolution":{"observed_at":"2026-05-19T05:52:07.203930Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-08-06T18:44:36.034408Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.07522","last_updated":"2025-07-10T08:12:39Z","snapshot_observed_at":"2026-08-06T18:36:19.400507Z","submitted_at":"2025-07-10T08:12:39Z","title":"NLGCL: Naturally Existing Neighbor Layers Graph Contrastive Learning for Recommendation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T18:44:36.034408Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2507.07522"},"observation_digest":"sha256:58c578e1dd92ab5e1afa4927d53967687809985773c8e2bd64aeba9c3ccf8fd0","observation_id":"59207009-bc55-4b50-b8a1-2445c52e5856","resolution":{"observed_at":"2026-08-06T18:44:36.034408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-08-06T14:36:54.077065Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.18489","last_updated":"2025-07-24T15:02:22Z","snapshot_observed_at":"2026-08-06T14:36:52.554843Z","submitted_at":"2025-07-24T15:02:22Z","title":"The Best is Yet to Come: Graph Convolution in the Testing Phase for Multimodal Recommendation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T14:36:54.077065Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2507.18489"},"observation_digest":"sha256:2ba975865b797d99a548708fa3d08ca6a007608ea3938fb130a4f2bf09044efd","observation_id":"689e3160-eb83-421d-b318-eacea6aa4603","resolution":{"observed_at":"2026-08-06T14:36:54.077065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-08-06T10:22:36.011666Z","title":"Fourierkan-gcf: Fourier kolmogorov-arnold network–an effective and efficient fea- ture transformation for graph collaborative filtering.arXiv preprint arXiv:2406.01034, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.00247","last_updated":"2025-08-01T01:16:09Z","snapshot_observed_at":"2026-08-07T07:05:38.679850Z","submitted_at":"2025-08-01T01:16:09Z","title":"Sinusoidal Approximation Theorem for Kolmogorov-Arnold Networks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T10:22:36.011666Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2508.00247"},"observation_digest":"sha256:c8dc6520120b32010591142bb2148ae7b8bb4626a106896e541151ef9aae2023","observation_id":"c600179b-0b1e-43df-bff1-d33fd72e7b7c","resolution":{"observed_at":"2026-08-06T10:22:36.011666Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-08-05T23:36:21.942242Z","title":"arXiv preprint arXiv:2406.01034 (2024) 21","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.05111","last_updated":"2025-08-07T07:44:27Z","snapshot_observed_at":"2026-08-09T07:24:46.288770Z","submitted_at":"2025-08-07T07:44:27Z","title":"Toroidal area-preserving parameterizations of genus-one closed surfaces","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T23:36:21.942242Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2508.05111"},"observation_digest":"sha256:267ffaa0dda84c98191cbd9a112cd12fa6eb8bf40ea936c9bd60f2bb4a5f7970","observation_id":"ba5d4fad-0f09-4a05-96cc-bb4833d11e49","resolution":{"observed_at":"2026-08-05T23:36:21.942242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-08-04T16:32:36.486726Z","title":"Fourierkan-gcf: Fourier kolmogorov-arnold network -- an effective and efficient feature transformation for graph collaborative filtering, 2024 a","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.14026","last_updated":"2026-07-06T11:24:08Z","snapshot_observed_at":"2026-08-07T08:29:53.256830Z","submitted_at":"2025-09-17T14:28:42Z","title":"Quantum Variational Activation Functions Empower Kolmogorov-Arnold Networks","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-04T16:32:36.486726Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2509.14026"},"observation_digest":"sha256:909648140928e99e609fb7bd9ab4ddb9c084b40e3bcd15e1911dd7c01075894d","observation_id":"f1c50d73-13d4-4abe-b968-05dccdecc632","resolution":{"observed_at":"2026-08-04T16:32:36.486726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":"2406.01034","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-07-03T20:48:55.482437Z","title":"Fourierkan-gcf: Fourier kolmogorov-arnold network–an effective and efficient feature transformation for graph collaborative filtering","venue":null,"work_id":"788a1397-8e06-426d-9c5b-72a1c8d8c08e","year":2025},"citing_paper":{"arxiv_id":"2510.25781","last_updated":"2026-05-07T06:10:04Z","snapshot_observed_at":"2026-07-06T22:34:23.736456Z","submitted_at":"2025-10-28T03:03:44Z","title":"A Practitioner's Guide to Kolmogorov-Arnold Networks","version":5},"reference_index":141,"source":"pdf_text","source_observed_at":"2026-05-18T03:29:15.570760Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2510.25781"},"observation_digest":"sha256:81061ff2e2c651d5a960e3fc00ec9f2fb55470f218c3d20b46146addd1a73aac","observation_id":"5e0510d3-0d2a-44eb-a9ef-cab05f81bcab","resolution":{"observed_at":"2026-05-18T03:30:50.812691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-08-03T22:18:43.898045Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.11228","last_updated":"2026-06-11T12:52:46Z","snapshot_observed_at":"2026-08-08T23:22:08.267344Z","submitted_at":"2025-11-14T12:30:16Z","title":"The modified Physics-Informed Hybrid Parallel Kolmogorov--Arnold and Multilayer Perceptron Architecture with domain decomposition","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T22:18:43.898045Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2511.11228"},"observation_digest":"sha256:33d29657a531e3788c124d289602ba4468462157c9409afef766d7a469a96d7c","observation_id":"138eb7f9-1013-4d7f-9ae4-ecaa4ad01779","resolution":{"observed_at":"2026-08-03T22:18:43.898045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":"2406.01034","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-07-03T20:48:55.482437Z","title":"Fourierkan-gcf: Fourier kolmogorov-arnold network–an effective and efficient feature transformation for graph collaborative filtering","venue":null,"work_id":"788a1397-8e06-426d-9c5b-72a1c8d8c08e","year":2025},"citing_paper":{"arxiv_id":"2604.03345","last_updated":"2026-06-23T08:55:44Z","snapshot_observed_at":"2026-07-13T13:39:35.980242Z","submitted_at":"2026-04-03T10:18:05Z","title":"Hardware-Oriented Inference Complexity of Kolmogorov-Arnold Networks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-13T20:29:26.735003Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2604.03345"},"observation_digest":"sha256:9ca72e76842b2883c87f48077255bf91a835fc459fb8faabc95e4d5571511fac","observation_id":"cd250763-020a-4999-85a2-077bdbf35f5f","resolution":{"observed_at":"2026-05-13T20:33:16.904401Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":"2406.01034","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-07-03T20:48:55.482437Z","title":"Fourierkan-gcf: Fourier kolmogorov-arnold network–an effective and efficient feature transformation for graph collaborative filtering","venue":null,"work_id":"788a1397-8e06-426d-9c5b-72a1c8d8c08e","year":2025},"citing_paper":{"arxiv_id":"2604.21174","last_updated":"2026-05-06T06:52:13Z","snapshot_observed_at":"2026-07-06T23:07:47.244208Z","submitted_at":"2026-04-23T00:41:21Z","title":"Scale-Parameter Selection in Gaussian Kolmogorov-Arnold Networks","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-08T13:42:17.380978Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2604.21174"},"observation_digest":"sha256:c660e95c5ffda6d46554a1c4b1d1704a3b1ea6a310c4d8182b29fce0742b3298","observation_id":"206f9b0c-6f90-4cf3-91de-debc0bf7f046","resolution":{"observed_at":"2026-05-11T18:51:07.189895Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":"2406.01034","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-07-03T20:48:55.482437Z","title":"Fourierkan-gcf: Fourier kolmogorov-arnold network–an effective and efficient feature transformation for graph collaborative filtering","venue":null,"work_id":"788a1397-8e06-426d-9c5b-72a1c8d8c08e","year":2025},"citing_paper":{"arxiv_id":"2604.23599","last_updated":"2026-05-03T07:38:23Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-26T08:24:03Z","title":"Partition-of-Unity Gaussian Kolmogorov-Arnold Networks","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-08T05:05:34.566530Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2604.23599"},"observation_digest":"sha256:4074f859bafb5053e0534e0957adec6d66438bcf9dffc11630eb13bbc412a403","observation_id":"78a15f7a-74bf-490a-abd3-82cfcf24bf05","resolution":{"observed_at":"2026-05-11T21:36:13.042533Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":"2406.01034","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-07-03T20:48:55.482437Z","title":"Fourierkan-gcf: Fourier kolmogorov-arnold network–an effective and efficient feature transformation for graph collaborative filtering","venue":null,"work_id":"788a1397-8e06-426d-9c5b-72a1c8d8c08e","year":2025},"citing_paper":{"arxiv_id":"2605.19031","last_updated":"2026-06-10T10:13:12Z","snapshot_observed_at":"2026-08-01T20:31:12.614654Z","submitted_at":"2026-05-18T18:55:46Z","title":"KAN-MLP-Mixer: A comprehensive investigation of the usage of Kolmogorov-Arnold Networks (KANs) for improving IMU-based Human Activity Recognition","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-20T10:36:27.993163Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2605.19031"},"observation_digest":"sha256:48b5c319e024b99049a1934e42389d22652d4c86643eb7dff3d58da10fa3a431","observation_id":"932e5f74-ae1e-4cae-abe0-6f6b9ba68e9e","resolution":{"observed_at":"2026-05-20T10:38:12.444454Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":"2406.01034","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-07-03T20:48:55.482437Z","title":"Fourierkan-gcf: Fourier kolmogorov-arnold network–an effective and efficient feature transformation for graph collaborative filtering","venue":null,"work_id":"788a1397-8e06-426d-9c5b-72a1c8d8c08e","year":2025},"citing_paper":{"arxiv_id":"2605.19031","last_updated":"2026-06-10T10:13:12Z","snapshot_observed_at":"2026-08-01T20:31:12.614654Z","submitted_at":"2026-05-18T18:55:46Z","title":"KAN-MLP-Mixer: A comprehensive investigation of the usage of Kolmogorov-Arnold Networks (KANs) for improving IMU-based Human Activity Recognition","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-30T18:14:45.068438Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2605.19031"},"observation_digest":"sha256:2466bd2127bdc7fa54429b4d96afc4d3953f0b8a5dd37d3b79cf2df5f7f6472f","observation_id":"5f916b35-9fa3-45b4-ae00-f9350cf9dd46","resolution":{"observed_at":"2026-06-30T18:14:59.260893Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":"2406.01034","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-07-03T20:48:55.482437Z","title":"Fourierkan-gcf: Fourier kolmogorov-arnold network–an effective and efficient feature transformation for graph collaborative filtering","venue":null,"work_id":"788a1397-8e06-426d-9c5b-72a1c8d8c08e","year":2025},"citing_paper":{"arxiv_id":"2605.31414","last_updated":"2026-05-29T15:15:21Z","snapshot_observed_at":"2026-07-06T23:40:36.926513Z","submitted_at":"2026-05-29T15:15:21Z","title":"Beyond Instance-Level Alignment and Uniformity: Semantic Factor Learning for Collaborative Filtering","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-28T20:49:00.592296Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2605.31414"},"observation_digest":"sha256:cdb4e0b5effe813722ac6dc3ec400f34f8a5868c0a04cf55e81171980a6ba02b","observation_id":"7969be7a-9378-4f20-aff9-11be89d96d1c","resolution":{"observed_at":"2026-06-28T20:52:37.378590Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":"2406.01034","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-07-03T20:48:55.482437Z","title":"Fourierkan-gcf: Fourier kolmogorov-arnold network–an effective and efficient feature transformation for graph collaborative filtering","venue":null,"work_id":"788a1397-8e06-426d-9c5b-72a1c8d8c08e","year":2025},"citing_paper":{"arxiv_id":"2606.05537","last_updated":"2026-06-04T00:40:58Z","snapshot_observed_at":"2026-08-06T13:10:10.404356Z","submitted_at":"2026-06-04T00:40:58Z","title":"PHKT:Personalized Dynamic Hypergraph-enhanced KAN-Transformer for Multi-behavior Sequential Recommendation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-28T00:04:22.923999Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2606.05537"},"observation_digest":"sha256:76cb42d6a70a066e6e25f2f8daa19339ca22a52c0eb2b8560137b9d80f175e35","observation_id":"aba1e2ca-1f3f-4449-a05f-fe40d364b937","resolution":{"observed_at":"2026-07-02T15:17:07.457787Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":"2406.01034","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-07-03T20:48:55.482437Z","title":"Fourierkan-gcf: Fourier kolmogorov-arnold network–an effective and efficient feature transformation for graph collaborative filtering","venue":null,"work_id":"788a1397-8e06-426d-9c5b-72a1c8d8c08e","year":2025},"citing_paper":{"arxiv_id":"2606.17927","last_updated":"2026-06-23T14:00:02Z","snapshot_observed_at":"2026-08-09T03:26:14.814637Z","submitted_at":"2026-06-16T13:38:58Z","title":"KANLib -- A Modular, Extensible and Fast Kolmogorov-Arnold Network Implementation","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T01:12:37.506026Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2606.17927"},"observation_digest":"sha256:8c9fc05cd137e6c039b25a56f57102a8af0c80a1b26acd91a012eee228e918ae","observation_id":"e18f9ed4-ab24-449e-87ea-4ab80bac35b3","resolution":{"observed_at":"2026-07-03T20:48:55.484357Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-08-02T09:24:29.868923Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.18290","last_updated":"2026-07-27T04:07:50Z","snapshot_observed_at":"2026-08-08T05:30:02.174526Z","submitted_at":"2026-06-30T15:31:59Z","title":"SechKAN: Kolmogorov-Arnold Networks with Hyperbolic Secant Functions","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T09:24:29.868923Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2607.18290"},"observation_digest":"sha256:fb7390f3352b098c3a238fe3b712d017d60d45e18f640c48fb44bbd35e082475","observation_id":"9e0d4aca-157c-40d9-824b-e776bb262483","resolution":{"observed_at":"2026-08-02T09:24:29.868923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01034","snapshot_observed_at":"2026-08-04T16:00:12.537577Z","title":"Enhancing graph collaborative filtering with fourierkan feature transformation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02063","last_updated":"2026-08-03T11:07:37Z","snapshot_observed_at":"2026-08-08T07:30:55.331967Z","submitted_at":"2026-08-03T11:07:37Z","title":"Cross-Fitted Residual Utility for Primary-Preserving Cognitive Decision Correction in Automatic Modulation Classification","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T16:00:12.537577Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2608.02063"},"observation_digest":"sha256:81ca3df73927b4624f73d8ff80c1012d014d10439d226945c26b19263f7d3ff8","observation_id":"d534f2ea-4c7c-4ef0-87e7-4a112b1e1cbb","resolution":{"observed_at":"2026-08-04T16:00:12.537577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2406.01034/citation-record","integrity":"/paper/2406.01034/integrity","json":"/paper/2406.01034/citation-record.json","paper":"/paper/2406.01034"},"outbound":[],"paper":{"arxiv_id":"2406.01034","last_updated":"2025-08-14T10:41:49Z","latest_version":3,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-05T02:05:56.574184Z","submitted_at":"2024-06-03T06:36:04Z","title":"Enhancing Graph Collaborative Filtering with FourierKAN Feature Transformation"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 26 inbound Pith citation observations for arXiv:2406.01034."}