{"as_of":"2026-08-13T11:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e3a8ec315e316a73ab7fdcac2942ad17c205a38b67542ee0d2fe21750252dcb0","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T12:21:08.084304Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.17296/citation-record","integrity":"/paper/2411.17296/integrity","json":"/paper/2411.17296/citation-record.json","paper":"/paper/2411.17296"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.19756","last_updated":"2025-02-09T21:09:09Z","snapshot_observed_at":"2026-07-06T18:07:47.744531Z","submitted_at":"2024-04-30T17:58:29Z","title":"KAN: Kolmogorov-Arnold Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.19756","snapshot_observed_at":"2026-08-12T12:21:08.029786Z","title":"Y ., and Tegmark, M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.17296","last_updated":"2025-05-29T04:23:01Z","snapshot_observed_at":"2026-08-12T12:13:49.250972Z","submitted_at":"2024-11-26T10:38:00Z","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T12:21:08.029786Z"},"links":{"cited_paper":"/paper/2404.19756","citing_paper":"/paper/2411.17296"},"observation_digest":"sha256:d805fe0e6fe20cd020c7dda68177255cfc33c63843eb5717f1e9cb2c1f897216","observation_id":"6715a87d-9e8b-4de2-a1e8-14fdb3f4095e","resolution":{"observed_at":"2026-08-12T12:21:08.029786Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:21:08.254331Z","title":"However, polynomial filter of BernNet is difficult to fit these filters, especially other complex filters beyond low-pass and high-pass filters","venue":null,"work_id":"6a57fd51-9faa-436d-8d4a-51d7e9d1dd4e","year":2021},"citing_paper":{"arxiv_id":"2411.17296","last_updated":"2025-05-29T04:23:01Z","snapshot_observed_at":"2026-08-12T12:13:49.250972Z","submitted_at":"2024-11-26T10:38:00Z","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T12:21:08.071518Z"},"links":{"citing_paper":"/paper/2411.17296"},"observation_digest":"sha256:ec5544949e277ceb838a31b83dcbe37bef8e45547df4547952032109365854a5","observation_id":"80f631e7-7c17-4ca1-8f43-608f6e3b76f7","resolution":{"observed_at":"2026-08-12T12:21:08.258375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.05868","last_updated":"2019-06-18T13:15:39Z","snapshot_observed_at":"2026-08-10T09:46:29.797564Z","submitted_at":"2018-11-14T15:53:19Z","title":"Pitfalls of Graph Neural Network Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.05868","snapshot_observed_at":"2026-08-12T12:21:08.038771Z","title":"Pitfalls of graph neural network evaluation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.17296","last_updated":"2025-05-29T04:23:01Z","snapshot_observed_at":"2026-08-12T12:13:49.250972Z","submitted_at":"2024-11-26T10:38:00Z","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T12:21:08.038771Z"},"links":{"cited_paper":"/paper/1811.05868","citing_paper":"/paper/2411.17296"},"observation_digest":"sha256:cec87ccdfa58426db79a1a3b9750256c64c63e98b5f42ce6d5c5298ed1dd4e8b","observation_id":"017a99ab-fed2-480d-8993-920d81c1c4f4","resolution":{"observed_at":"2026-08-12T12:21:08.038771Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:21:08.302295Z","title":"Graph convolutional networks using heat kernel for semi- supervised learning","venue":null,"work_id":"021c6866-4f4d-4364-802a-b4c2869ce898","year":1928},"citing_paper":{"arxiv_id":"2411.17296","last_updated":"2025-05-29T04:23:01Z","snapshot_observed_at":"2026-08-12T12:13:49.250972Z","submitted_at":"2024-11-26T10:38:00Z","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T12:21:08.046830Z"},"links":{"citing_paper":"/paper/2411.17296"},"observation_digest":"sha256:0438ff3f6b4f37b6edcc7766d7e27bc32407760005239af8ace91e49361f091a","observation_id":"b87c7f13-8290-4319-b768-71d8edb44c84","resolution":{"observed_at":"2026-08-12T12:21:08.306593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.05140","last_updated":"2020-01-22T15:16:10Z","snapshot_observed_at":"2026-08-10T07:44:45.814048Z","submitted_at":"2020-01-15T05:56:59Z","title":"Graph-Bert: Only Attention is Needed for Learning Graph Representations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.05140","snapshot_observed_at":"2026-08-12T12:21:08.054950Z","title":"Graph-bert: Only attention is needed for learning graph representations","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2411.17296","last_updated":"2025-05-29T04:23:01Z","snapshot_observed_at":"2026-08-12T12:13:49.250972Z","submitted_at":"2024-11-26T10:38:00Z","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T12:21:08.054950Z"},"links":{"cited_paper":"/paper/2001.05140","citing_paper":"/paper/2411.17296"},"observation_digest":"sha256:9cf8f73551fdc595c72054f34edfac06dcd23de3cc83e50083e58982ca5aaf72","observation_id":"7969e504-e3e4-4c7d-b533-7a3ac9f64220","resolution":{"observed_at":"2026-08-12T12:21:08.054950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:21:08.291119Z","title":"EXPERIMENTAL DETAILS A.1","venue":null,"work_id":"83931132-3090-4bdd-af9f-940086ab5669","year":2020},"citing_paper":{"arxiv_id":"2411.17296","last_updated":"2025-05-29T04:23:01Z","snapshot_observed_at":"2026-08-12T12:13:49.250972Z","submitted_at":"2024-11-26T10:38:00Z","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T12:21:08.058956Z"},"links":{"citing_paper":"/paper/2411.17296"},"observation_digest":"sha256:72fa2cd536a173b5a466e34208d207ecbd89f8322a93780f53c068ba07a112fd","observation_id":"8052e20e-b5ed-4275-885a-267597b11e7c","resolution":{"observed_at":"2026-08-12T12:21:08.294667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:21:08.266119Z","title":"For other datasets, we run the experiments ten times, each with a different random split","venue":null,"work_id":"14d022e2-206f-473e-949d-52159a18d884","year":2020},"citing_paper":{"arxiv_id":"2411.17296","last_updated":"2025-05-29T04:23:01Z","snapshot_observed_at":"2026-08-12T12:13:49.250972Z","submitted_at":"2024-11-26T10:38:00Z","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T12:21:08.067258Z"},"links":{"citing_paper":"/paper/2411.17296"},"observation_digest":"sha256:a8f23d20bec0cda29d3ba7a6aeec3b81e8fbb87b95b7e753b4f004e8956ff6db","observation_id":"f5d62347-1cb6-4367-abff-08e61a13e9a4","resolution":{"observed_at":"2026-08-12T12:21:08.270121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:21:08.241919Z","title":"As a result, GrokFormer learns to adaptively use a larger K to capture a broader range of frequency components, rather than restricting itself to a small K","venue":null,"work_id":"03f97297-bb08-4cb2-92c0-069a5a9aa7d8","year":2012},"citing_paper":{"arxiv_id":"2411.17296","last_updated":"2025-05-29T04:23:01Z","snapshot_observed_at":"2026-08-12T12:13:49.250972Z","submitted_at":"2024-11-26T10:38:00Z","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T12:21:08.076004Z"},"links":{"citing_paper":"/paper/2411.17296"},"observation_digest":"sha256:1ff91af6c1eb21156fdd6c1266ff3bf03a53a35ecabf3652fcad7c031846d407","observation_id":"1b2f2440-de33-4137-b8f8-7efce99da15e","resolution":{"observed_at":"2026-08-12T12:21:08.246736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:21:08.229361Z","title":null,"venue":null,"work_id":"903f4f95-a107-40c6-a454-ad9228fb8b4a","year":2024},"citing_paper":{"arxiv_id":"2411.17296","last_updated":"2025-05-29T04:23:01Z","snapshot_observed_at":"2026-08-12T12:13:49.250972Z","submitted_at":"2024-11-26T10:38:00Z","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T12:21:08.080231Z"},"links":{"citing_paper":"/paper/2411.17296"},"observation_digest":"sha256:6786e87b3fdc96f451a9f37048e17ca2d73ad0136de81e71cee16955986156a8","observation_id":"4d93eb73-8290-46bd-a4b7-3d0dae69c190","resolution":{"observed_at":"2026-08-12T12:21:08.233710Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:21:08.216050Z","title":"ai and bi are learnable parameters","venue":null,"work_id":"e262b515-8399-480b-927a-ce81ae300ea1","year":2011},"citing_paper":{"arxiv_id":"2411.17296","last_updated":"2025-05-29T04:23:01Z","snapshot_observed_at":"2026-08-12T12:13:49.250972Z","submitted_at":"2024-11-26T10:38:00Z","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T12:21:08.084304Z"},"links":{"citing_paper":"/paper/2411.17296"},"observation_digest":"sha256:f345f7b97bc80bf51430fbac7b742f1a538324a27e1d0d8398327ea4fc046db8","observation_id":"df52c5c7-6a0e-4a7c-938d-dba46ac6f0ba","resolution":{"observed_at":"2026-08-12T12:21:08.221053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.07553","last_updated":"2018-04-24T08:19:32Z","snapshot_observed_at":"2026-08-12T14:23:30.636240Z","submitted_at":"2017-11-20T21:28:40Z","title":"Residual Gated Graph ConvNets","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-12T12:21:08.014064Z","title":"and Laurent, T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.17296","last_updated":"2025-05-29T04:23:01Z","snapshot_observed_at":"2026-08-12T12:13:49.250972Z","submitted_at":"2024-11-26T10:38:00Z","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","version":3},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-12T12:21:08.014064Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2411.17296"},"observation_digest":"sha256:dd0c97f3dc88bccd07c481a4fed75b52640e149f27992dcc7fa23131bfdda730","observation_id":"3084986c-5095-49c3-a10c-b3f5cf1004d6","resolution":{"observed_at":"2026-08-12T12:21:08.014064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:21:08.278963Z","title":"We run the experiments with 2,000 epochs and stop the training in advance if the validation loss does not continuously decrease for 200 epochs","venue":null,"work_id":"b03c703a-86d4-4222-8af3-666c5d9dd30e","year":2021},"citing_paper":{"arxiv_id":"2411.17296","last_updated":"2025-05-29T04:23:01Z","snapshot_observed_at":"2026-08-12T12:13:49.250972Z","submitted_at":"2024-11-26T10:38:00Z","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","version":3},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-12T12:21:08.063194Z"},"links":{"citing_paper":"/paper/2411.17296"},"observation_digest":"sha256:d13ae442f78ca8780a542bcee246c5c443f99d3eb18d197b0248799c94317b70","observation_id":"fd94045e-83e2-4725-9300-e0f03dfa5cf8","resolution":{"observed_at":"2026-08-12T12:21:08.283264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T23:51:53.402066Z","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-12T12:21:08.050856Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.17296","last_updated":"2025-05-29T04:23:01Z","snapshot_observed_at":"2026-08-12T12:13:49.250972Z","submitted_at":"2024-11-26T10:38:00Z","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","version":3},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-12T12:21:08.050856Z"},"links":{"cited_paper":"/paper/2406.01034","citing_paper":"/paper/2411.17296"},"observation_digest":"sha256:7656ceb6808ce68814670c474fbcd2072e77853be23a206abfa962009080f0e6","observation_id":"6db51c52-6fdd-4db2-824e-753947feadd1","resolution":{"observed_at":"2026-08-12T12:21:08.050856Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:21:08.313999Z","title":"D., Kramer, S., and Helma, C","venue":null,"work_id":"b728ffdf-a908-41ca-b2b1-9f4efe0a033a","year":2000},"citing_paper":{"arxiv_id":"2411.17296","last_updated":"2025-05-29T04:23:01Z","snapshot_observed_at":"2026-08-12T12:13:49.250972Z","submitted_at":"2024-11-26T10:38:00Z","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","version":3},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-12T12:21:08.042998Z"},"links":{"citing_paper":"/paper/2411.17296"},"observation_digest":"sha256:95d94ecd2d91c3000ae9c3c1bdc9d4eaedfbe70ee600f209bb03476a051d17fd","observation_id":"bd60c87b-7ef1-4cec-a49b-885428c78053","resolution":{"observed_at":"2026-08-12T12:21:08.317705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.09699","last_updated":"2021-01-24T09:38:54Z","snapshot_observed_at":"2026-08-05T19:35:00.334774Z","submitted_at":"2020-12-17T16:11:47Z","title":"A Generalization of Transformer Networks to Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.09699","snapshot_observed_at":"2026-08-12T12:21:08.024557Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2411.17296","last_updated":"2025-05-29T04:23:01Z","snapshot_observed_at":"2026-08-12T12:13:49.250972Z","submitted_at":"2024-11-26T10:38:00Z","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-12T12:21:08.024557Z"},"links":{"cited_paper":"/paper/2012.09699","citing_paper":"/paper/2411.17296"},"observation_digest":"sha256:bfbde741c408143906c3f0ed2805da27613a716ec3bfd8a63d02add8df9797d1","observation_id":"3b79fd7f-1752-4135-b2c5-4cbc29f423ad","resolution":{"observed_at":"2026-08-12T12:21:08.024557Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11025","last_updated":"2023-10-17T06:42:11Z","snapshot_observed_at":"2026-08-13T05:47:51.139607Z","submitted_at":"2023-10-17T06:42:11Z","title":"SignGT: Signed Attention-based Graph Transformer for Graph Representation Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11025","snapshot_observed_at":"2026-08-12T12:21:08.019107Z","title":"Nagphormer: A tokenized graph transformer for node classification in large graphs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.17296","last_updated":"2025-05-29T04:23:01Z","snapshot_observed_at":"2026-08-12T12:13:49.250972Z","submitted_at":"2024-11-26T10:38:00Z","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-12T12:21:08.019107Z"},"links":{"cited_paper":"/paper/2310.11025","citing_paper":"/paper/2411.17296"},"observation_digest":"sha256:f47b1a0b0febeaf5abbabfdefec0f17e74aa8012fe88af8907ca5fbf824da4d3","observation_id":"d5a3b494-4f3d-4c38-a17c-6c88ac37b83a","resolution":{"observed_at":"2026-08-12T12:21:08.019107Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.08264","last_updated":"2020-02-19T16:14:48Z","snapshot_observed_at":"2026-08-05T06:14:46.294612Z","submitted_at":"2020-02-19T16:14:48Z","title":"Molecule Attention Transformer","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.08264","snapshot_observed_at":"2026-08-12T12:21:08.034556Z","title":"Molecule attention transformer","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2411.17296","last_updated":"2025-05-29T04:23:01Z","snapshot_observed_at":"2026-08-12T12:13:49.250972Z","submitted_at":"2024-11-26T10:38:00Z","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-12T12:21:08.034556Z"},"links":{"cited_paper":"/paper/2002.08264","citing_paper":"/paper/2411.17296"},"observation_digest":"sha256:4bd97afc4b285056af968e9b2056d1e90c302408d4b8ac379c5e7048032f9302","observation_id":"7a7107f1-e615-43eb-b8d3-3225f9a11b8a","resolution":{"observed_at":"2026-08-12T12:21:08.034556Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.17296","last_updated":"2025-05-29T04:23:01Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T12:13:49.250972Z","submitted_at":"2024-11-26T10:38:00Z","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":8},"total_outbound_references":17},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2411.17296."}