{"as_of":"2026-08-12T04:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:16c1d83f28836c26205c2b982d8d2df574edc690dbc7152b0e8f315e2599b60c","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":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":14,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:47:22.571359Z","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-01T15:35:48.629523Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.18380","last_updated":"2025-03-06T10:25:17Z","snapshot_observed_at":"2026-07-06T18:37:21.973331Z","submitted_at":"2024-06-26T14:21:21Z","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18380","snapshot_observed_at":"2026-08-10T22:47:22.571359Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.00709","last_updated":"2025-01-22T07:55:26Z","snapshot_observed_at":"2026-08-11T16:55:19.343445Z","submitted_at":"2025-01-01T03:12:18Z","title":"KAN KAN Buff Signed Graph Neural Networks?","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T22:47:22.571359Z"},"links":{"cited_paper":"/paper/2406.18380","citing_paper":"/paper/2501.00709"},"observation_digest":"sha256:67d6dd94b38c4d6a44ec234c55d9f49b8c0fe22f73a9a0e5ad926d785805620f","observation_id":"c1e02856-3268-46ed-936f-7bba1344a1e4","resolution":{"observed_at":"2026-08-10T22:47:22.571359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18380","last_updated":"2025-03-06T10:25:17Z","snapshot_observed_at":"2026-07-06T18:37:21.973331Z","submitted_at":"2024-06-26T14:21:21Z","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","version":4},"cited_work":{"arxiv_id":"2406.18380","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.18380","snapshot_observed_at":"2026-07-01T15:35:48.629523Z","title":"Kagnns: Kolmogorov-arnold networks meet graph learning","venue":null,"work_id":"ba1fa65c-aeb4-4d0a-94e6-695b9798b385","year":2024},"citing_paper":{"arxiv_id":"2501.04757","last_updated":"2026-04-30T22:21:33Z","snapshot_observed_at":"2026-07-06T20:18:21.419068Z","submitted_at":"2025-01-08T17:11:56Z","title":"Distance-Aware Error for Spline Networks: A Bottom-Up Approach to Uncertainty","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-23T06:19:21.221350Z"},"links":{"cited_paper":"/paper/2406.18380","citing_paper":"/paper/2501.04757"},"observation_digest":"sha256:2344f470ce236c2d83030aac223bd91aacafa3f39c97e455a102b706f9a8c42e","observation_id":"90cceb73-be43-4ec4-a903-354d1fc9e527","resolution":{"observed_at":"2026-05-23T06:22:38.528904Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18380","last_updated":"2025-03-06T10:25:17Z","snapshot_observed_at":"2026-07-06T18:37:21.973331Z","submitted_at":"2024-06-26T14:21:21Z","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18380","snapshot_observed_at":"2026-08-10T20:55:22.839868Z","title":"Kagnns: Kolmogorov-arnold networks meet graph learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.07032","last_updated":"2025-02-11T06:47:56Z","snapshot_observed_at":"2026-08-10T20:47:19.328518Z","submitted_at":"2025-01-13T03:07:39Z","title":"PRKAN: Parameter-Reduced Kolmogorov-Arnold Networks","version":4},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T20:55:22.839868Z"},"links":{"cited_paper":"/paper/2406.18380","citing_paper":"/paper/2501.07032"},"observation_digest":"sha256:4ed763aa8c8851f2bc0adc2eea2611aa651d5dc420286b9eebba6650572a544f","observation_id":"e32ae1f1-05c9-437f-90da-bab6876c0a4b","resolution":{"observed_at":"2026-08-10T20:55:22.839868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18380","last_updated":"2025-03-06T10:25:17Z","snapshot_observed_at":"2026-07-06T18:37:21.973331Z","submitted_at":"2024-06-26T14:21:21Z","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18380","snapshot_observed_at":"2026-08-10T16:16:19.035443Z","title":"Kagnns: Kolmogorov-arnold networks meet graph learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13456","last_updated":"2025-03-11T08:59:12Z","snapshot_observed_at":"2026-08-11T16:55:17.654277Z","submitted_at":"2025-01-23T08:14:55Z","title":"KAA: Kolmogorov-Arnold Attention for Enhancing Attentive Graph Neural Networks","version":4},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T16:16:19.035443Z"},"links":{"cited_paper":"/paper/2406.18380","citing_paper":"/paper/2501.13456"},"observation_digest":"sha256:26f3cf57d971d4291d10880cc310169df2a8d2ad29c92e95bb2caddfd36cd721","observation_id":"adb5bf8d-9f2c-4e3f-9b14-ad7209b941b9","resolution":{"observed_at":"2026-08-10T16:16:19.035443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18380","last_updated":"2025-03-06T10:25:17Z","snapshot_observed_at":"2026-07-06T18:37:21.973331Z","submitted_at":"2024-06-26T14:21:21Z","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18380","snapshot_observed_at":"2026-08-10T18:53:21.421696Z","title":"Kagnns: Kolmogorov-arnold networks meet graph learning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.15704","last_updated":"2025-01-19T06:27:46Z","snapshot_observed_at":"2026-08-11T16:56:46.313010Z","submitted_at":"2025-01-19T06:27:46Z","title":"EMK-KEN: A High-Performance Approach for Assessing Knowledge Value in Citation Network","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T18:53:21.421696Z"},"links":{"cited_paper":"/paper/2406.18380","citing_paper":"/paper/2502.15704"},"observation_digest":"sha256:769b40a2da7e1af2d285c1aa01d991b7827500bb838b66b2a373470b5b315d04","observation_id":"7f0f1188-39f2-407c-aadc-a88ab0d12bea","resolution":{"observed_at":"2026-08-10T18:53:21.421696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18380","last_updated":"2025-03-06T10:25:17Z","snapshot_observed_at":"2026-07-06T18:37:21.973331Z","submitted_at":"2024-06-26T14:21:21Z","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18380","snapshot_observed_at":"2026-08-07T15:29:47.503684Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15103","last_updated":"2025-08-08T06:14:32Z","snapshot_observed_at":"2026-08-11T08:06:44.193378Z","submitted_at":"2025-05-21T04:54:18Z","title":"Khan-GCL: Kolmogorov-Arnold Network Based Graph Contrastive Learning with Hard Negatives","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:47.503684Z"},"links":{"cited_paper":"/paper/2406.18380","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:ba01df3169d04dedc118c619897092b26b3e992421569c4fb8b24faf038d1c7a","observation_id":"03d4e6d9-46fd-498e-aa1e-8116878206af","resolution":{"observed_at":"2026-08-07T15:29:47.503684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18380","last_updated":"2025-03-06T10:25:17Z","snapshot_observed_at":"2026-07-06T18:37:21.973331Z","submitted_at":"2024-06-26T14:21:21Z","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18380","snapshot_observed_at":"2026-08-07T14:41:33.400103Z","title":"Kagnns: Kolmogorov-arnold networks meet graph learning.arXiv preprint arXiv:2406.18380,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.18131","last_updated":"2025-05-23T17:41:18Z","snapshot_observed_at":"2026-08-08T00:04:10.552363Z","submitted_at":"2025-05-23T17:41:18Z","title":"Leveraging KANs for Expedient Training of Multichannel MLPs via Preconditioning and Geometric Refinement","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-07T14:41:33.400103Z"},"links":{"cited_paper":"/paper/2406.18380","citing_paper":"/paper/2505.18131"},"observation_digest":"sha256:1c7568a5b0b527d6085be2297a50af3710211fad202f66414346a2e4ce6fd733","observation_id":"ba797265-2eec-44f5-8d10-dc9e4b5ecda9","resolution":{"observed_at":"2026-08-07T14:41:33.400103Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18380","last_updated":"2025-03-06T10:25:17Z","snapshot_observed_at":"2026-07-06T18:37:21.973331Z","submitted_at":"2024-06-26T14:21:21Z","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18380","snapshot_observed_at":"2026-08-07T05:37:57.677191Z","title":"Kagnns: Kolmogorov-arnold networks meet graph learning.arXiv preprint arXiv:2406.18380,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.07549","last_updated":"2025-06-09T08:38:26Z","snapshot_observed_at":"2026-08-11T03:33:15.086029Z","submitted_at":"2025-06-09T08:38:26Z","title":"Improving Memory Efficiency for Training KANs via Meta Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T05:37:57.677191Z"},"links":{"cited_paper":"/paper/2406.18380","citing_paper":"/paper/2506.07549"},"observation_digest":"sha256:1cd61d9059fff9cecccf14455e07e85da63b24df468b92199919eda2b8801f30","observation_id":"d5c4f6af-9367-4412-9182-60f41967e8c1","resolution":{"observed_at":"2026-08-07T05:37:57.677191Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18380","last_updated":"2025-03-06T10:25:17Z","snapshot_observed_at":"2026-07-06T18:37:21.973331Z","submitted_at":"2024-06-26T14:21:21Z","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18380","snapshot_observed_at":"2026-08-07T00:33:26.001511Z","title":"arXiv preprint arXiv:2406.18380 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.13740","last_updated":"2025-06-16T17:50:23Z","snapshot_observed_at":"2026-08-10T00:18:25.667982Z","submitted_at":"2025-06-16T17:50:23Z","title":"Kolmogorov-Arnold Network for Gene Regulatory Network Inference","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T00:33:26.001511Z"},"links":{"cited_paper":"/paper/2406.18380","citing_paper":"/paper/2506.13740"},"observation_digest":"sha256:f8691940d33dadd3f58fdaa29dffbf17d311823d4bd20f62d6ba653c93ced2f4","observation_id":"fdcc75a2-4781-414a-8c7f-f2c144032e22","resolution":{"observed_at":"2026-08-07T00:33:26.001511Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18380","last_updated":"2025-03-06T10:25:17Z","snapshot_observed_at":"2026-07-06T18:37:21.973331Z","submitted_at":"2024-06-26T14:21:21Z","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18380","snapshot_observed_at":"2026-08-05T12:58:09.141234Z","title":"Kagnns: Kolmogorov-arnold networks meet graph learning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.01124","last_updated":"2025-09-01T04:37:51Z","snapshot_observed_at":"2026-08-09T08:29:54.751648Z","submitted_at":"2025-09-01T04:37:51Z","title":"Towards Propagation-aware Representation Learning for Supervised Social Media Graph Analytics","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T12:58:09.141234Z"},"links":{"cited_paper":"/paper/2406.18380","citing_paper":"/paper/2509.01124"},"observation_digest":"sha256:e2212a844de47763acbf1978c1bd85872e0b18c621bffb9658bc652df113ebce","observation_id":"1491e71b-14e9-4f59-a5c8-252a2e94ed13","resolution":{"observed_at":"2026-08-05T12:58:09.141234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18380","last_updated":"2025-03-06T10:25:17Z","snapshot_observed_at":"2026-07-06T18:37:21.973331Z","submitted_at":"2024-06-26T14:21:21Z","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","version":4},"cited_work":{"arxiv_id":"2406.18380","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.18380","snapshot_observed_at":"2026-07-01T15:35:48.629523Z","title":"Kagnns: Kolmogorov-arnold networks meet graph learning","venue":null,"work_id":"ba1fa65c-aeb4-4d0a-94e6-695b9798b385","year":2024},"citing_paper":{"arxiv_id":"2604.16586","last_updated":"2026-04-17T15:16:33Z","snapshot_observed_at":"2026-07-06T23:03:52.631613Z","submitted_at":"2026-04-17T15:16:33Z","title":"A Systematic Survey and Benchmark of Deep Learning for Molecular Property Prediction in the Foundation Model Era","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-05-10T08:40:51.408244Z"},"links":{"cited_paper":"/paper/2406.18380","citing_paper":"/paper/2604.16586"},"observation_digest":"sha256:9b8129694927026793b3a071951ff091bfd6c9e0fa5a3d9c7e7c6e8e12ac52a4","observation_id":"d598b27f-80a4-487d-896c-c944b7c7b494","resolution":{"observed_at":"2026-05-10T08:43:01.487003Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18380","last_updated":"2025-03-06T10:25:17Z","snapshot_observed_at":"2026-07-06T18:37:21.973331Z","submitted_at":"2024-06-26T14:21:21Z","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","version":4},"cited_work":{"arxiv_id":"2406.18380","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.18380","snapshot_observed_at":"2026-07-01T15:35:48.629523Z","title":"Kagnns: Kolmogorov-arnold networks meet graph learning","venue":null,"work_id":"ba1fa65c-aeb4-4d0a-94e6-695b9798b385","year":2024},"citing_paper":{"arxiv_id":"2604.16842","last_updated":"2026-04-18T05:24:35Z","snapshot_observed_at":"2026-08-11T07:09:08.245947Z","submitted_at":"2026-04-18T05:24:35Z","title":"Singularity Formation: Synergy in Theoretical, Numerical and Machine Learning Approaches","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-10T07:13:10.140500Z"},"links":{"cited_paper":"/paper/2406.18380","citing_paper":"/paper/2604.16842"},"observation_digest":"sha256:979f2e9d49b7a9e7cba55c4aa643608ba140a153d2bb3a23097513807742df2e","observation_id":"e798ee22-4ef6-4a5c-8523-0bd0ff253797","resolution":{"observed_at":"2026-05-10T09:18:32.770502Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18380","last_updated":"2025-03-06T10:25:17Z","snapshot_observed_at":"2026-07-06T18:37:21.973331Z","submitted_at":"2024-06-26T14:21:21Z","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","version":4},"cited_work":{"arxiv_id":"2406.18380","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.18380","snapshot_observed_at":"2026-07-01T15:35:48.629523Z","title":"Kagnns: Kolmogorov-arnold networks meet graph learning","venue":null,"work_id":"ba1fa65c-aeb4-4d0a-94e6-695b9798b385","year":2024},"citing_paper":{"arxiv_id":"2605.09572","last_updated":"2026-05-10T14:37:02Z","snapshot_observed_at":"2026-08-11T13:38:19.766079Z","submitted_at":"2026-05-10T14:37:02Z","title":"KAN Text to Vision? The Exploration of Kolmogorov-Arnold Networks for Multi-Scale Sequence-Based Pose Animation from Sign Language Notation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-12T03:47:58.527417Z"},"links":{"cited_paper":"/paper/2406.18380","citing_paper":"/paper/2605.09572"},"observation_digest":"sha256:96f510b0dea02874b838605a5a7fc9a1fa25f496c062271929671efd15860f83","observation_id":"cc1693d3-f7bc-42e5-ad12-d4d2f77ff8f1","resolution":{"observed_at":"2026-05-12T06:56:29.228882Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18380","last_updated":"2025-03-06T10:25:17Z","snapshot_observed_at":"2026-07-06T18:37:21.973331Z","submitted_at":"2024-06-26T14:21:21Z","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","version":4},"cited_work":{"arxiv_id":"2406.18380","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.18380","snapshot_observed_at":"2026-07-01T15:35:48.629523Z","title":"Kagnns: Kolmogorov-arnold networks meet graph learning","venue":null,"work_id":"ba1fa65c-aeb4-4d0a-94e6-695b9798b385","year":2024},"citing_paper":{"arxiv_id":"2606.28459","last_updated":"2026-06-26T13:03:52Z","snapshot_observed_at":"2026-08-09T22:11:12.327266Z","submitted_at":"2026-06-26T13:03:52Z","title":"scKDGM: KAN-guided Dynamic Graph Masked Learning for Single-Cell RNA-seq Clustering","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-06-30T01:19:30.291302Z"},"links":{"cited_paper":"/paper/2406.18380","citing_paper":"/paper/2606.28459"},"observation_digest":"sha256:e82c6021192aec4601303b35084289275b0fd214d9be15edf9938a6c84d09f77","observation_id":"8ea1bffe-abb6-44b0-992b-ba7aec6122b4","resolution":{"observed_at":"2026-07-01T15:35:48.631088Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.18380/citation-record","integrity":"/paper/2406.18380/integrity","json":"/paper/2406.18380/citation-record.json","paper":"/paper/2406.18380"},"outbound":[],"paper":{"arxiv_id":"2406.18380","last_updated":"2025-03-06T10:25:17Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T18:37:21.973331Z","submitted_at":"2024-06-26T14:21:21Z","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 14 inbound Pith citation observations for arXiv:2406.18380."}