{"as_of":"2026-08-12T11:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6760c13959c12336988158ec81a0bc350ccd86816b4371ad077e3f440b646bdf","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:29:50.796005Z","state":"measured"},{"denominator":60,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":60,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2505.15103/citation-record","integrity":"/paper/2505.15103/integrity","json":"/paper/2505.15103/citation-record.json","paper":"/paper/2505.15103"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:47.194115Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"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":1,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:47.194115Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:91f5b449de7316ade071ba85fb04500de2ad5351bba9a53b821ac97ae54e2645","observation_id":"41863125-7204-4a79-bcdd-80e7434ca50e","resolution":{"observed_at":"2026-08-07T15:29:47.194115Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:47.269148Z","title":"write newline","venue":null,"work_id":null,"year":null},"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":2,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:47.269148Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:ae5dfacb542f62c00b979882b36e7e5445e0ff88d2eb48ed4becabd34c185a14","observation_id":"5fdf2cf4-65d9-4227-bb51-2fb7f24d6822","resolution":{"observed_at":"2026-08-07T15:29:47.269148Z","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-07T15:29:55.572324Z","title":null,"venue":null,"work_id":"f1405659-16b5-4485-bf69-4f9a8a1e46e1","year":2024},"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":3,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:47.389557Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:c6e65526cf3ed2861a8d913dfb1f2cddb3aff41fe0de2e07a9044da214034322","observation_id":"f625d700-36b2-40d5-87be-50be1a7167c2","resolution":{"observed_at":"2026-08-07T15:29:55.622901Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:55.477442Z","title":null,"venue":null,"work_id":"40b88be4-b72b-4ee1-9116-385a424c1290","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":5,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:47.598817Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:abbef258b772715c2e57954d3e1ef8ca1b0aea288f4d51fb648475918ad0e02b","observation_id":"2fd62955-df60-4d2f-8c48-b881aeaa4970","resolution":{"observed_at":"2026-08-07T15:29:55.512031Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:47.690652Z","title":null,"venue":null,"work_id":null,"year":2020},"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":6,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:47.690652Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:b6a81d16975741e012df6478f547b126424ad8012c7bc1bbc0a2bf0939324796","observation_id":"d1a73163-4334-4da9-928a-9654d5363cc8","resolution":{"observed_at":"2026-08-07T15:29:47.690652Z","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-07T15:29:55.380125Z","title":null,"venue":null,"work_id":"f0f16f51-b5c1-403b-8245-77d0657294f1","year":2022},"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":7,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:47.757476Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:cf9b733553d1030179b4340c60f7b3dbfb44af76feb958257528293ab4459859","observation_id":"1ef5e274-eece-494b-9262-02c83a83838b","resolution":{"observed_at":"2026-08-07T15:29:55.418776Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.17251","last_updated":"2024-06-25T03:35:20Z","snapshot_observed_at":"2026-08-09T04:22:13.895400Z","submitted_at":"2024-06-25T03:35:20Z","title":"TopoGCL: Topological Graph Contrastive Learning","version":1},"cited_work":{"arxiv_id":"2406.17251","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.17251","snapshot_observed_at":"2026-08-07T15:29:51.814275Z","title":"TopoGCL: Topological Graph Contrastive Learning","venue":"cs.LG","work_id":"eafbf0b6-53f4-4365-afab-8cd9a21328dd","year":2024},"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":8,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:47.819879Z"},"links":{"cited_paper":"/paper/2406.17251","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:1668b9e62a1f4383929d93d495579ff15ff227377648187bc44321c5ad578f19","observation_id":"140411a8-0cfa-4476-9bd0-1cc66d06b955","resolution":{"observed_at":"2026-08-07T15:29:51.935506Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.08171","last_updated":"2022-06-02T09:27:19Z","snapshot_observed_at":"2026-07-06T11:19:31.726402Z","submitted_at":"2021-06-15T14:14:23Z","title":"Evaluating Modules in Graph Contrastive Learning","version":2},"cited_work":{"arxiv_id":"2106.08171","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.08171","snapshot_observed_at":"2026-08-07T15:29:51.609070Z","title":"Evaluating Modules in Graph Contrastive Learning","venue":"cs.LG","work_id":"49fdc69b-b06f-45b9-84cf-16230109321f","year":2021},"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":9,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:47.880144Z"},"links":{"cited_paper":"/paper/2106.08171","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:60be6e416100683a66c0bd722cf45f31c9ff85782f8c248f2c104aa4e51db238","observation_id":"b133a56a-86b4-4035-9caa-f489093b95fa","resolution":{"observed_at":"2026-08-07T15:29:51.694056Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T15:29:55.180944Z","title":null,"venue":null,"work_id":"ab5d8c53-2b79-41a9-9e71-bf4f7ee1037d","year":1989},"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":10,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:47.956792Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:6ed261999b0026f96d507865ca2d363730b4bb36d144221ac3ceb5430bdfd12e","observation_id":"683c70f7-5156-4e33-9544-1cf212e23ad1","resolution":{"observed_at":"2026-08-07T15:29:55.272998Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:48.020699Z","title":null,"venue":null,"work_id":null,"year":2000},"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":11,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:48.020699Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:d6f333012e3da76a40110b266845db6ebcd0920149dec1e65335ae5c542085e4","observation_id":"96633121-a426-4cff-a73a-a2be241695b1","resolution":{"observed_at":"2026-08-07T15:29:48.020699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.13456","snapshot_observed_at":"2026-08-07T15:29:48.083661Z","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":12,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:48.083661Z"},"links":{"cited_paper":"/paper/2501.13456","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:51f2895826369d987d0021766c17a23f60812d2fa6f3a534330696c3ad64607f","observation_id":"a534827a-4774-4975-98b7-807b95cdf1df","resolution":{"observed_at":"2026-08-07T15:29:48.083661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.02428","last_updated":"2019-04-25T10:06:09Z","snapshot_observed_at":"2026-08-02T18:54:43.326912Z","submitted_at":"2019-03-06T14:50:02Z","title":"Fast Graph Representation Learning with PyTorch Geometric","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.02428","snapshot_observed_at":"2026-08-07T15:29:48.165087Z","title":null,"venue":null,"work_id":null,"year":2019},"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":13,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:48.165087Z"},"links":{"cited_paper":"/paper/1903.02428","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:5bff075fb069f51630140010baae4af905a0a3ffb640ee19ef5468a7918d2552","observation_id":"50edf78f-1fdb-4d58-9ae8-797c28e69167","resolution":{"observed_at":"2026-08-07T15:29:48.165087Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.08821","last_updated":"2022-05-18T12:29:49Z","snapshot_observed_at":"2026-07-06T11:01:05.577957Z","submitted_at":"2021-04-18T11:27:08Z","title":"SimCSE: Simple Contrastive Learning of Sentence Embeddings","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.08821","snapshot_observed_at":"2026-08-07T15:29:48.232435Z","title":null,"venue":null,"work_id":null,"year":2021},"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":14,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:48.232435Z"},"links":{"cited_paper":"/paper/2104.08821","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:4f4bfe3c6c54b48ad0cdc99496d3a83492112f8c09da23e4bb13a72f2f505d32","observation_id":"814d5957-c82c-4059-9218-75414a93ebd7","resolution":{"observed_at":"2026-08-07T15:29:48.232435Z","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-07T15:29:55.018055Z","title":null,"venue":null,"work_id":"05a6b258-2c0c-471a-8d3d-7db75c7bfae5","year":1989},"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":15,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:48.316426Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:b83455735c4a646d12aa15043c205c8d1941268740b5948d2ae8ff041660427d","observation_id":"62d164b9-43d1-4b15-ad70-5bcfad7f68a7","resolution":{"observed_at":"2026-08-07T15:29:55.075348Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T15:29:54.877241Z","title":null,"venue":null,"work_id":"06f4d2f0-9627-4d1e-a3e8-667ac27ba390","year":2021},"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":16,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:48.391294Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:684776b953dee0a01ac2b3c7c04f48e00f12755db698f87b002c4c35fd543a90","observation_id":"c467e5d3-6b88-4ce0-874c-726c35fa1ba2","resolution":{"observed_at":"2026-08-07T15:29:54.943267Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.12265","last_updated":"2020-02-18T19:49:48Z","snapshot_observed_at":"2026-08-04T16:33:25.229105Z","submitted_at":"2019-05-29T08:11:52Z","title":"Strategies for Pre-training Graph Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.12265","snapshot_observed_at":"2026-08-07T15:29:48.438089Z","title":null,"venue":null,"work_id":null,"year":2019},"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":17,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:48.438089Z"},"links":{"cited_paper":"/paper/1905.12265","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:94ee992bd0b9598265a4952e1cab6ed3b16b25a8b055074272e058695ee19501","observation_id":"60666f3b-1e1d-40ec-baae-ad471f90ab0c","resolution":{"observed_at":"2026-08-07T15:29:48.438089Z","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-07T15:29:54.768818Z","title":null,"venue":null,"work_id":"884b130e-512c-4ea1-ac18-4647e36dd7a4","year":2024},"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":18,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:48.469387Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:bca18b549335cde56de4bbe3da215bcfe3093e6fac68b27f18b34dba52d938b2","observation_id":"01b4ec35-0316-4140-91f7-c2bd284b4aa1","resolution":{"observed_at":"2026-08-07T15:29:54.813121Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T15:29:54.684691Z","title":"B.; Pion, N.; Weinzaepfel, P.; and Larlus, D","venue":null,"work_id":"55ba6ae6-86d7-45fd-b10e-5f03d0b593e0","year":2020},"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":19,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:48.511570Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:e2eb2963ef201a2e608f7dd0108895652aabcaed07ae66064185663098e596a6","observation_id":"7c9bff36-dbe4-4c17-9548-94cbf1246599","resolution":{"observed_at":"2026-08-07T15:29:54.719764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06470","last_updated":"2024-06-10T17:09:38Z","snapshot_observed_at":"2026-08-11T12:45:47.687366Z","submitted_at":"2024-06-10T17:09:38Z","title":"GKAN: Graph Kolmogorov-Arnold Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06470","snapshot_observed_at":"2026-08-07T15:29:48.550714Z","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-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":20,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:48.550714Z"},"links":{"cited_paper":"/paper/2406.06470","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:aa4619bd6e4131209386a23e195a46da8a16c01f6d8b1ab39e7f613f473086bd","observation_id":"a57f1939-3b7e-4206-9c45-7087a9c224f5","resolution":{"observed_at":"2026-08-07T15:29:48.550714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-07T15:29:48.593594Z","title":null,"venue":null,"work_id":null,"year":2014},"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":21,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:48.593594Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:9dfd1599f463bfc7b468c07e698e78e8f51d358bb03e8d882ca9d75bb091a9c1","observation_id":"748711b5-e7fb-4c9a-b78a-124a756d714b","resolution":{"observed_at":"2026-08-07T15:29:48.593594Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:48.634874Z","title":null,"venue":null,"work_id":null,"year":1998},"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":22,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:48.634874Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:51f2db2cf7fa26b30de603c648f0b21cddd09e1eba02d6dc925e0fcb75719fc7","observation_id":"048c8e1e-c84f-45ce-bcb1-4035104157d3","resolution":{"observed_at":"2026-08-07T15:29:48.634874Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11323","last_updated":"2024-12-18T06:23:29Z","snapshot_observed_at":"2026-07-06T19:33:39.134036Z","submitted_at":"2024-10-15T06:44:57Z","title":"KA-GNN: Kolmogorov-Arnold Graph Neural Networks for Molecular Property Prediction","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11323","snapshot_observed_at":"2026-08-07T15:29:48.683285Z","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-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":23,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:48.683285Z"},"links":{"cited_paper":"/paper/2410.11323","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:7681d357b9dc95c4c032c3ec3df382962f0f2e663f7b2c8d9843eccfc4081f0c","observation_id":"987159c8-444c-4a98-9fc7-981f532ed4c8","resolution":{"observed_at":"2026-08-07T15:29:48.683285Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:48.726487Z","title":null,"venue":null,"work_id":null,"year":2018},"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":24,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:48.726487Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:606fdc8a65613e7349e2b503c2caae6777b8463c3caba759ae81ac12fb7e1a11","observation_id":"149ffd7c-b129-4b20-85d5-883f017598c0","resolution":{"observed_at":"2026-08-07T15:29:48.726487Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.01018","last_updated":"2024-11-09T14:22:03Z","snapshot_observed_at":"2026-08-06T12:10:38.358602Z","submitted_at":"2024-08-02T05:36:14Z","title":"GNN-SKAN: Harnessing the Power of SwallowKAN to Advance Molecular Representation Learning with GNNs","version":4},"cited_work":{"arxiv_id":"2408.01018","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.01018","snapshot_observed_at":"2026-08-07T15:29:51.301698Z","title":"GNN-SKAN: Harnessing the Power of SwallowKAN to Advance Molecular Representation Learning with GNNs","venue":"cs.LG","work_id":"dbfe9fa1-d3e5-4be3-a9bb-a0e55f573bcf","year":2024},"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":25,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:48.766311Z"},"links":{"cited_paper":"/paper/2408.01018","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:b2c1fb916ae4b414eb1bb19e44869ab7c0312c52c306f1482b3d8e5d928dc0c8","observation_id":"5725c388-62e9-4dfe-bc06-a27131052762","resolution":{"observed_at":"2026-08-07T15:29:51.377069Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T15:29:54.535824Z","title":null,"venue":null,"work_id":"d4547491-e13f-4bec-9c4e-1610ecbf882f","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":26,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:48.799107Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:3042595f5e3cc1bc3bb90a9f5c4246465e37e3b7eb2b49bc8d0ea720b430b309","observation_id":"684a5c8e-7e27-429e-a2e7-4c39462017d7","resolution":{"observed_at":"2026-08-07T15:29:54.609580Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T15:29:54.375352Z","title":null,"venue":null,"work_id":"583de3ce-4716-4fe6-b81e-27457c576a3b","year":2022},"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":27,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:48.865830Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:11888bf9221a4aa6317b27ceb208ce3850237ee3eb76dadda2b9fa7965c1deb0","observation_id":"114b0466-45c6-487c-91dc-f30f466479a2","resolution":{"observed_at":"2026-08-07T15:29:54.474766Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.07728","last_updated":"2022-05-29T13:01:37Z","snapshot_observed_at":"2026-08-10T04:48:22.181481Z","submitted_at":"2021-10-07T17:48:57Z","title":"Pre-training Molecular Graph Representation with 3D Geometry","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.07728","snapshot_observed_at":"2026-08-07T15:29:48.925552Z","title":null,"venue":null,"work_id":null,"year":2021},"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":28,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:48.925552Z"},"links":{"cited_paper":"/paper/2110.07728","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:2190aeec86299e68c48165998b019f85a4eb3b697a4440067285d0c2cbc9c227","observation_id":"3c6b4290-55d1-4dfb-94bf-64ed108fafbd","resolution":{"observed_at":"2026-08-07T15:29:48.925552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T15:29:48.987265Z","title":"Y.; and Tegmark, M","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-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":29,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:48.987265Z"},"links":{"cited_paper":"/paper/2404.19756","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:2781d3c2d7d39edd71c20ee98c9bcc049293e0eb664ec0ab8457fe7cd6720cbe","observation_id":"b69b813e-c0e9-404e-b3ef-7562abb56594","resolution":{"observed_at":"2026-08-07T15:29:48.987265Z","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-07T15:29:54.253229Z","title":null,"venue":null,"work_id":"7cb5700b-634b-4891-9863-da94fe3adfaf","year":2023},"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":30,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.070143Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:722cb563c21255e6c1ccde9fa2775cc1a923b9be0f44cdad09b37dc14f2d3b67","observation_id":"459c4d5d-e2b3-4461-a8a5-a6005958e73b","resolution":{"observed_at":"2026-08-07T15:29:54.303684Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.03426","last_updated":"2020-09-18T01:56:41Z","snapshot_observed_at":"2026-08-02T15:32:07.466568Z","submitted_at":"2018-02-09T19:39:33Z","title":"UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.03426","snapshot_observed_at":"2026-08-07T15:29:49.142670Z","title":null,"venue":null,"work_id":null,"year":2018},"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":31,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.142670Z"},"links":{"cited_paper":"/paper/1802.03426","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:4dee6b5c00eba0a3ff787cbea49ccc033ac561985605b52894f8debb7ca9dace","observation_id":"f4f048e3-8d60-4d2c-b760-222637a7712b","resolution":{"observed_at":"2026-08-07T15:29:49.142670Z","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-07T15:29:54.059108Z","title":null,"venue":null,"work_id":"f247883a-3072-424d-bfae-00cd72720ea6","year":2017},"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":32,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.215981Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:0fb78cfdf2339a9fc1cd6fe512eb3eb90c0c15938deb124745a1f50b32e58189","observation_id":"1f8ca357-bb22-4719-89e4-0c579a50b081","resolution":{"observed_at":"2026-08-07T15:29:54.146729Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.08663","last_updated":"2020-07-16T21:46:33Z","snapshot_observed_at":"2026-08-06T13:06:20.395369Z","submitted_at":"2020-07-16T21:46:33Z","title":"TUDataset: A collection of benchmark datasets for learning with graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.08663","snapshot_observed_at":"2026-08-07T15:29:49.293019Z","title":"M.; Bause, F.; Kersting, K.; Mutzel, P.; and Neumann, M","venue":null,"work_id":null,"year":2020},"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":33,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.293019Z"},"links":{"cited_paper":"/paper/2007.08663","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:237b33f7ea9213f56d11859a4c834e3b6cc7f79b621bc1b2821f8e72d253567b","observation_id":"1575b8df-9de3-4500-aba3-4780dbf1bedf","resolution":{"observed_at":"2026-08-07T15:29:49.293019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.03748","last_updated":"2019-01-22T18:47:12Z","snapshot_observed_at":"2026-07-06T06:49:24.960992Z","submitted_at":"2018-07-10T16:52:11Z","title":"Representation Learning with Contrastive Predictive Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.03748","snapshot_observed_at":"2026-08-07T15:29:49.400819Z","title":null,"venue":null,"work_id":null,"year":2018},"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":34,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.400819Z"},"links":{"cited_paper":"/paper/1807.03748","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:2864bdfe968b111e0da68b9f30d4264dccbfca91f2bb4bd61ae2396c7e3874bb","observation_id":"6a106061-f843-407b-89d9-17c7aa8cc1ac","resolution":{"observed_at":"2026-08-07T15:29:49.400819Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.01703","last_updated":"2019-12-03T22:06:05Z","snapshot_observed_at":"2026-07-06T08:41:49.632205Z","submitted_at":"2019-12-03T22:06:05Z","title":"PyTorch: An Imperative Style, High-Performance Deep Learning Library","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.01703","snapshot_observed_at":"2026-08-07T15:29:49.451015Z","title":null,"venue":null,"work_id":null,"year":2019},"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":35,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.451015Z"},"links":{"cited_paper":"/paper/1912.01703","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:f966e50afdf6f2b6ac3c9dd5134d2be2bd3d875e2f5aae71263e02ec7951a7b4","observation_id":"5b2c2f19-8a3c-4083-94e8-da5db29c5c1a","resolution":{"observed_at":"2026-08-07T15:29:49.451015Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:49.502385Z","title":"W.; Hallacy, C.; Ramesh, A.; Goh, G.; Agarwal, S.; Sastry, G.; Askell, A.; Mishkin, P.; Clark, J.; et al","venue":null,"work_id":null,"year":2021},"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":36,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.502385Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:b81261d18d3919ebf9889319804496859a04336c3803521c506ca6a961f8db52","observation_id":"2d21d328-8f54-4320-a475-d68ae7e97866","resolution":{"observed_at":"2026-08-07T15:29:49.502385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.10903","last_updated":"2020-03-12T08:04:36Z","snapshot_observed_at":"2026-08-10T09:58:04.194039Z","submitted_at":"2019-07-25T08:57:45Z","title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.10903","snapshot_observed_at":"2026-08-07T15:29:49.547039Z","title":null,"venue":null,"work_id":null,"year":2019},"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":37,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.547039Z"},"links":{"cited_paper":"/paper/1907.10903","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:c4d54b5b395d9f32331d7a2cfdb8b987138850120811cc5ad04ff69327229bbe","observation_id":"f86149dd-e3ce-40cc-99f3-1287e168e7d6","resolution":{"observed_at":"2026-08-07T15:29:49.547039Z","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-07T15:29:53.922345Z","title":null,"venue":null,"work_id":"2d5ce4ec-a0eb-47a5-8ebe-01f634d1271e","year":2015},"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":38,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.600282Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:ce97d176a29b473f51f8d0c3028fbd86893dc8ca419721665e413cadbc824e51","observation_id":"1b579224-87ea-4245-a554-ea41e3f4004e","resolution":{"observed_at":"2026-08-07T15:29:53.991382Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-07T15:39:37.124800Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-07T15:29:49.631130Z","title":null,"venue":null,"work_id":null,"year":2019},"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":39,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.631130Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:21f037738490d5e8e4fac5a66cc172363f6b26d820a6294486b6e298e0bc654e","observation_id":"b85d378c-e8e5-4556-a351-5a73115a847b","resolution":{"observed_at":"2026-08-07T15:29:49.631130Z","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-07T15:29:53.806236Z","title":null,"venue":null,"work_id":"5f82f6f3-1c80-430f-865e-eaf72e761e13","year":2021},"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":40,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.670476Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:7a75ac1848b25d21402d723f9e13117ddb78bf7197e1ccfee8e3bcfb961969d3","observation_id":"3c175784-9d6a-43a6-9a77-a54080bddd11","resolution":{"observed_at":"2026-08-07T15:29:53.835274Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.01350","last_updated":"2024-05-02T14:59:58Z","snapshot_observed_at":"2026-08-08T05:00:26.916957Z","submitted_at":"2024-05-02T14:59:58Z","title":"Community-Invariant Graph Contrastive Learning","version":1},"cited_work":{"arxiv_id":"2405.01350","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.01350","snapshot_observed_at":"2026-08-07T15:29:50.963403Z","title":"Community-Invariant Graph Contrastive Learning","venue":"cs.LG","work_id":"d767f622-b015-41a3-b371-7575b9f2e7ff","year":2024},"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":41,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.712426Z"},"links":{"cited_paper":"/paper/2405.01350","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:75224e8971f339cac22939db126ff6adedd901da11b72f61988536d0ea42ada4","observation_id":"b66b2208-d285-453a-b1d2-a98125bfd9e6","resolution":{"observed_at":"2026-08-07T15:29:51.069628Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:49.746851Z","title":null,"venue":null,"work_id":null,"year":1966},"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":42,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.746851Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:0967d1728966d2e3c9571dfeb6118456135ae2a9d259e0c6dc72ebf049c79e4b","observation_id":"c82aedfb-2113-4264-87f9-11be08e63a3e","resolution":{"observed_at":"2026-08-07T15:29:49.746851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.10341","last_updated":"2018-12-21T15:44:59Z","snapshot_observed_at":"2026-07-06T07:04:37.077852Z","submitted_at":"2018-09-27T04:53:24Z","title":"Deep Graph Infomax","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.10341","snapshot_observed_at":"2026-08-07T15:29:49.789011Z","title":"L.; Li \\`o , P.; Bengio, Y.; and Hjelm, R","venue":null,"work_id":null,"year":2018},"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":43,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.789011Z"},"links":{"cited_paper":"/paper/1809.10341","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:1ecb77ad429326bdbc3f4519cd00dae677d72e41dceee37f41f18f40896f0889","observation_id":"290ad6ac-f96d-4c15-84a9-896c045ba30d","resolution":{"observed_at":"2026-08-07T15:29:49.789011Z","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-07T15:29:53.663865Z","title":null,"venue":null,"work_id":"d521408e-912a-46c3-b0dc-bbe427d3015a","year":2024},"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":44,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.820021Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:39f070c61074d4c6de64bdb51c8f79ce3a1ef5239c89fe7dc8eb1084e143790d","observation_id":"a2a787bf-27f5-409d-a515-a82d788160af","resolution":{"observed_at":"2026-08-07T15:29:53.747528Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T15:29:53.399733Z","title":null,"venue":null,"work_id":"39b7e8fd-85ca-4fa2-95a5-d8141076e4eb","year":2021},"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":45,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.846575Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:cb5941fafae6f15011d063d86f9ae66c44fbded0b4f987aa8f573654efccbda1","observation_id":"c05d6fe5-73a9-4989-89c4-48fdc5b033c5","resolution":{"observed_at":"2026-08-07T15:29:53.525355Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T15:29:53.192340Z","title":null,"venue":null,"work_id":"d69e42e8-c5be-4242-8df1-1ec4387f55eb","year":2023},"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":46,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.885595Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:27d605c19f0d8ddfa100f6997a66ba2ecbec76feadf1cc2ba311550604d2943d","observation_id":"a0d952ce-033a-4719-a0e3-f61dd6d5e7ea","resolution":{"observed_at":"2026-08-07T15:29:53.272200Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T15:29:53.021378Z","title":null,"venue":null,"work_id":"0d628864-8399-4860-8da1-7033b77f5496","year":2024},"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":47,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.934020Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:aaf80c7033a0fd1353101d4dbea8af4f40f8cb119f4265bdab99c1320a1cf0b7","observation_id":"21cd8d5f-9a48-4beb-bb1d-461dd88b866b","resolution":{"observed_at":"2026-08-07T15:29:53.099508Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T15:29:52.909066Z","title":"N.; and Li, P","venue":null,"work_id":"116b557b-ff7c-45a2-8190-aed4ecfc7a08","year":2024},"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":48,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.965743Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:8be4dadfc40576ed5d84ca20e22d8ac2f1a6129837eca9b33c7a4cc81e0dfa11","observation_id":"f82c4363-2a66-4c58-8844-0b4d82eb264e","resolution":{"observed_at":"2026-08-07T15:29:52.965335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.01541","last_updated":"2024-09-04T19:44:26Z","snapshot_observed_at":"2026-08-10T14:22:11.602528Z","submitted_at":"2023-02-03T04:34:00Z","title":"Contrastive Learning with Consistent Representations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.01541","snapshot_observed_at":"2026-08-07T15:29:49.999366Z","title":null,"venue":null,"work_id":null,"year":2023},"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":49,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:49.999366Z"},"links":{"cited_paper":"/paper/2302.01541","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:6046d95ddcf956940393fc2d31511386fe68d183a08b86810c2b5d36eea21a40","observation_id":"24fe6a0b-f7a7-4be4-b1d7-0871e5d22d02","resolution":{"observed_at":"2026-08-07T15:29:49.999366Z","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-07T15:29:52.756775Z","title":null,"venue":null,"work_id":"3c1cdeee-25a3-435c-b8f4-1cd77da8c80d","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":50,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:50.069589Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:c56d831a4b99edfa335060f297fc1ac3972bca096a9f90a9c18a1fbd1eb2fecb","observation_id":"9032e5fa-5a0e-426d-a2c7-ff907c4943e2","resolution":{"observed_at":"2026-08-07T15:29:52.813274Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:50.153867Z","title":"N.; Gomes, J.; Geniesse, C.; Pappu, A","venue":null,"work_id":null,"year":2018},"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":51,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:50.153867Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:bc8309b767c8ace3830edf015d736768c06a48001d2357827257c6b873046c3c","observation_id":"bc7b6c0d-c68f-4eb2-a9be-5df3956f0778","resolution":{"observed_at":"2026-08-07T15:29:50.153867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.02027","last_updated":"2022-06-14T02:24:02Z","snapshot_observed_at":"2026-08-08T19:59:34.240809Z","submitted_at":"2021-10-05T13:15:59Z","title":"ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.02027","snapshot_observed_at":"2026-08-07T15:29:50.205352Z","title":null,"venue":null,"work_id":null,"year":2021},"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":52,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:50.205352Z"},"links":{"cited_paper":"/paper/2110.02027","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:2bc43b8f9d6c5e57fed866503841cdfb967ce80d6274fbf96b06f915f0fd67b7","observation_id":"d2b2d989-01dd-4aed-a77d-91c843222df4","resolution":{"observed_at":"2026-08-07T15:29:50.205352Z","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-11T16:56:15.608816Z","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-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":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:251f641eaac8a50d7500efca12b1bc50c0179a395b96d6cebc33222b55b589b6","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:50.308644Z","title":null,"venue":null,"work_id":null,"year":2021},"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":54,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:50.308644Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:e1dab9be73d3cc580d6b8684c05460e1d6b066d1ff0c823a572c38d892aa4550","observation_id":"2c2b4a44-434e-475c-bc86-d6bc052f3b89","resolution":{"observed_at":"2026-08-07T15:29:50.308644Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:29:50.457772Z","title":null,"venue":null,"work_id":null,"year":2020},"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":55,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:50.457772Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:2b3619f85eeb00740b67a68b791e56e1c39bc58d6eadd19b5058cf40865b4a1c","observation_id":"07a8423e-25e2-4203-905b-7152fc9421b1","resolution":{"observed_at":"2026-08-07T15:29:50.457772Z","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-07T15:29:52.566360Z","title":null,"venue":null,"work_id":"553e608f-2b6d-450c-8251-559ceee52af2","year":2024},"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":56,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:50.518564Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:78d76b8ce983b1474ecd05caf90485ab3121ea72a9a7e28585d1a147113d02fe","observation_id":"308b454d-577f-46f0-83f4-d9bd5137d841","resolution":{"observed_at":"2026-08-07T15:29:52.629817Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.13597","last_updated":"2024-06-19T14:41:09Z","snapshot_observed_at":"2026-08-11T16:57:49.255964Z","submitted_at":"2024-06-19T14:41:09Z","title":"GraphKAN: Enhancing Feature Extraction with Graph Kolmogorov Arnold Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.13597","snapshot_observed_at":"2026-08-07T15:29:50.572472Z","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-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":57,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:50.572472Z"},"links":{"cited_paper":"/paper/2406.13597","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:9c982a6b1783c06a12e8de7cd50a34a794dd5e8b4b9a05c83af94bfae847918d","observation_id":"1c3f1eee-2a07-4890-91f8-5741c637ef98","resolution":{"observed_at":"2026-08-07T15:29:50.572472Z","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-07T15:29:52.371350Z","title":null,"venue":null,"work_id":"f0d549cb-cddb-4196-8e69-73c3ddd09391","year":2024},"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":58,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:50.662739Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:7b0e9b10cde638fc02e4be1c6afde5bb208adc12aba9f8d75b316a8e443e22ba","observation_id":"7e0257a5-d02e-4d1c-a309-22a551341447","resolution":{"observed_at":"2026-08-07T15:29:52.501799Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.04131","last_updated":"2020-07-13T16:32:20Z","snapshot_observed_at":"2026-08-09T07:13:23.894027Z","submitted_at":"2020-06-07T11:50:45Z","title":"Deep Graph Contrastive Representation Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.04131","snapshot_observed_at":"2026-08-07T15:29:50.727357Z","title":null,"venue":null,"work_id":null,"year":2020},"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":59,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:50.727357Z"},"links":{"cited_paper":"/paper/2006.04131","citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:1bbd80e122d7ae1ef3186f9c18707da047d61280580bd0808c02a06430fe2c4a","observation_id":"cfe27ec2-5287-4c45-a590-1e7ccfff573e","resolution":{"observed_at":"2026-08-07T15:29:50.727357Z","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-07T15:29:52.101498Z","title":null,"venue":null,"work_id":"02b15528-1af1-4043-8e8f-a616d941af91","year":2021},"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":60,"source":"arxiv_source","source_observed_at":"2026-08-07T15:29:50.796005Z"},"links":{"citing_paper":"/paper/2505.15103"},"observation_digest":"sha256:1ea16d6e61f0289aad840434cb6229646f56b44be88a05588b89eb9f56933240","observation_id":"076cb8cd-7094-4ae6-9d92-1f9203a6fef3","resolution":{"observed_at":"2026-08-07T15:29:52.204964Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.15103","last_updated":"2025-08-08T06:14:32Z","latest_version":2,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":54,"verified_exact":4,"verified_fuzzy":2},"total_outbound_references":60},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 0 inbound Pith citation observations for arXiv:2505.15103."}