{"as_of":"2026-08-09T15:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ba98822e7725ffd86855325e4507e63ce5cf63472d9d7aacb61a4f4457e37090","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:29:48.083661Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T05:37:59.163116Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.13456","last_updated":"2025-03-11T08:59:12Z","snapshot_observed_at":"2026-07-06T20:24:50.262766Z","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-09T04:22:03.591072Z","submitted_at":"2025-05-21T04:54:18Z","title":"Khan-GCL: Kolmogorov-Arnold Network Based Graph Contrastive Learning with Hard Negatives","version":2},"reference_index":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:9bc73f42102acf008038885ceeee857b42ec43f09d047a54b78a6432e1510a0a","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":"2501.13456","last_updated":"2025-03-11T08:59:12Z","snapshot_observed_at":"2026-07-06T20:24:50.262766Z","submitted_at":"2025-01-23T08:14:55Z","title":"KAA: Kolmogorov-Arnold Attention for Enhancing Attentive Graph Neural Networks","version":4},"cited_work":{"arxiv_id":"2501.13456","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.13456","snapshot_observed_at":"2026-08-07T05:37:59.163116Z","title":"KAA: Kolmogorov-Arnold Attention for Enhancing Attentive Graph Neural Networks","venue":"cs.LG","work_id":"458aba7f-71a3-4162-8355-f50217716542","year":2025},"citing_paper":{"arxiv_id":"2506.07549","last_updated":"2025-06-09T08:38:26Z","snapshot_observed_at":"2026-08-08T00:03:39.202812Z","submitted_at":"2025-06-09T08:38:26Z","title":"Improving Memory Efficiency for Training KANs via Meta Learning","version":1},"reference_index":1990,"source":"pdf_text","source_observed_at":"2026-08-07T05:37:57.706103Z"},"links":{"cited_paper":"/paper/2501.13456","citing_paper":"/paper/2506.07549"},"observation_digest":"sha256:f293016c78034e29ca12fffe15020be69ac7ee0fbda31d5f89f55eec15086ed2","observation_id":"a7e1789b-141f-41f3-9c47-06c58f652cef","resolution":{"observed_at":"2026-08-07T05:37:59.250896Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.13456/citation-record","integrity":"/paper/2501.13456/integrity","json":"/paper/2501.13456/citation-record.json","paper":"/paper/2501.13456"},"outbound":[],"paper":{"arxiv_id":"2501.13456","last_updated":"2025-03-11T08:59:12Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T20:24:50.262766Z","submitted_at":"2025-01-23T08:14:55Z","title":"KAA: Kolmogorov-Arnold Attention for Enhancing Attentive Graph Neural Networks"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2501.13456."}