{"as_of":"2026-08-23T10:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5cdc5eccbda82dc286cb53a0e06ea3ec5769378262e345392f055c8d283c5065","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":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T15:55:16.332302Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-10T05:30:23.456663Z","state":"measured"}],"external_citation_measurements":[{"count":32,"observed_at":"2026-08-10T05:30:23.456663Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.04181","last_updated":"2024-03-28T19:35:01Z","snapshot_observed_at":"2026-08-16T15:56:46.382341Z","submitted_at":"2023-02-08T16:40:11Z","title":"Attending to Graph Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.04181","snapshot_observed_at":"2026-08-12T18:53:48.092315Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.11197","last_updated":"2025-05-24T18:43:17Z","snapshot_observed_at":"2026-08-14T11:30:10.935719Z","submitted_at":"2024-11-17T23:15:36Z","title":"Stealing Training Graphs from Graph Neural Networks","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T18:53:48.092315Z"},"links":{"cited_paper":"/paper/2302.04181","citing_paper":"/paper/2411.11197"},"observation_digest":"sha256:b534d87ff3e4186a0b0c8a5825f025fa12d90c27ce5a66119f6ef127d0e3c942","observation_id":"bb70704b-876e-4642-9b0b-d62b9e477f51","resolution":{"observed_at":"2026-08-12T18:53:48.092315Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04181","last_updated":"2024-03-28T19:35:01Z","snapshot_observed_at":"2026-08-16T15:56:46.382341Z","submitted_at":"2023-02-08T16:40:11Z","title":"Attending to Graph Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.04181","snapshot_observed_at":"2026-08-12T17:05:46.801789Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.13028","last_updated":"2024-11-20T04:20:17Z","snapshot_observed_at":"2026-08-17T17:41:41.193965Z","submitted_at":"2024-11-20T04:20:17Z","title":"A Theory for Compressibility of Graph Transformers for Transductive Learning","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T17:05:46.801789Z"},"links":{"cited_paper":"/paper/2302.04181","citing_paper":"/paper/2411.13028"},"observation_digest":"sha256:b866d9f1ba4a1a7df0327eb0194323b4fb0f898be481bdd76ce90fead9bc9079","observation_id":"7aaaadd8-bd1c-4dde-916c-1a306ae61845","resolution":{"observed_at":"2026-08-12T17:05:46.801789Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04181","last_updated":"2024-03-28T19:35:01Z","snapshot_observed_at":"2026-08-16T15:56:46.382341Z","submitted_at":"2023-02-08T16:40:11Z","title":"Attending to Graph Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.04181","snapshot_observed_at":"2026-08-12T13:22:32.330157Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.16278","last_updated":"2024-11-25T10:59:25Z","snapshot_observed_at":"2026-08-21T14:00:48.998995Z","submitted_at":"2024-11-25T10:59:25Z","title":"Even Sparser Graph Transformers","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T13:22:32.330157Z"},"links":{"cited_paper":"/paper/2302.04181","citing_paper":"/paper/2411.16278"},"observation_digest":"sha256:3c18c88041942ae4651228d66e76736f3874a93133736cc6786e127128bc95f4","observation_id":"9b8ab57a-5ffe-4a68-9e8b-8422a32a7626","resolution":{"observed_at":"2026-08-12T13:22:32.330157Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04181","last_updated":"2024-03-28T19:35:01Z","snapshot_observed_at":"2026-08-16T15:56:46.382341Z","submitted_at":"2023-02-08T16:40:11Z","title":"Attending to Graph Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.04181","snapshot_observed_at":"2026-08-12T04:21:48.005528Z","title":"Attending to graph transformers","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.01519","last_updated":"2025-08-25T15:18:29Z","snapshot_observed_at":"2026-08-17T09:37:33.376911Z","submitted_at":"2024-12-02T14:10:23Z","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T04:21:48.005528Z"},"links":{"cited_paper":"/paper/2302.04181","citing_paper":"/paper/2412.01519"},"observation_digest":"sha256:f9a08e50b6e212b4d7a9e5ea1da3f569b3eaa29ef20d177064440220f11f400b","observation_id":"eb65df2f-675b-47d7-9d44-c8ebdec77c24","resolution":{"observed_at":"2026-08-12T04:21:48.005528Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04181","last_updated":"2024-03-28T19:35:01Z","snapshot_observed_at":"2026-08-16T15:56:46.382341Z","submitted_at":"2023-02-08T16:40:11Z","title":"Attending to Graph Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.04181","snapshot_observed_at":"2026-08-11T04:36:22.658560Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.18731","last_updated":"2024-12-25T01:22:35Z","snapshot_observed_at":"2026-08-20T12:51:48.765671Z","submitted_at":"2024-12-25T01:22:35Z","title":"Position-aware Graph Transformer for Recommendation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:22.658560Z"},"links":{"cited_paper":"/paper/2302.04181","citing_paper":"/paper/2412.18731"},"observation_digest":"sha256:649716e2d8f4538cff3ac4eea800684358c2ef8cc6e4798cba0bc7d64d358b7a","observation_id":"57868fdb-6fe7-4fcd-8c75-bfab7485cb60","resolution":{"observed_at":"2026-08-11T04:36:22.658560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04181","last_updated":"2024-03-28T19:35:01Z","snapshot_observed_at":"2026-08-16T15:56:46.382341Z","submitted_at":"2023-02-08T16:40:11Z","title":"Attending to Graph Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.04181","snapshot_observed_at":"2026-08-10T22:07:57.720341Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.02760","last_updated":"2025-01-06T04:56:58Z","snapshot_observed_at":"2026-08-17T15:40:08.608111Z","submitted_at":"2025-01-06T04:56:58Z","title":"CHAT: Beyond Contrastive Graph Transformer for Link Prediction in Heterogeneous Networks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T22:07:57.720341Z"},"links":{"cited_paper":"/paper/2302.04181","citing_paper":"/paper/2501.02760"},"observation_digest":"sha256:c8367c7b1a5e424f658cda5631241a6032ee6e7422625a66f9946957a66415fb","observation_id":"a62b7baf-4889-4e2a-a18c-ec3141e572c1","resolution":{"observed_at":"2026-08-10T22:07:57.720341Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04181","last_updated":"2024-03-28T19:35:01Z","snapshot_observed_at":"2026-08-16T15:56:46.382341Z","submitted_at":"2023-02-08T16:40:11Z","title":"Attending to Graph Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.04181","snapshot_observed_at":"2026-08-10T19:42:13.663750Z","title":"Attending to graph transformers,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.09878","last_updated":"2025-01-16T23:28:30Z","snapshot_observed_at":"2026-08-18T09:53:11.696313Z","submitted_at":"2025-01-16T23:28:30Z","title":"ASTRA: A Scene-aware TRAnsformer-based model for trajectory prediction","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T19:42:13.663750Z"},"links":{"cited_paper":"/paper/2302.04181","citing_paper":"/paper/2501.09878"},"observation_digest":"sha256:b47f88dd556e572b8c34985b4bf32a293ff32738759ab276d885641c54e4858d","observation_id":"2103e3a1-3e40-4714-96dd-a367dd21d151","resolution":{"observed_at":"2026-08-10T19:42:13.663750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04181","last_updated":"2024-03-28T19:35:01Z","snapshot_observed_at":"2026-08-16T15:56:46.382341Z","submitted_at":"2023-02-08T16:40:11Z","title":"Attending to Graph Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.04181","snapshot_observed_at":"2026-08-10T13:47:19.279915Z","title":"Attending to graph trans- formers","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-17T23:17:33.384285Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.279915Z"},"links":{"cited_paper":"/paper/2302.04181","citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:3bddd3118d4c1d9ea1abf86fd99658b54c005c3e5abbb76de8d2de811105952e","observation_id":"1a7bc871-53d8-4933-a3fc-b9ecbba111d2","resolution":{"observed_at":"2026-08-10T13:47:19.279915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04181","last_updated":"2024-03-28T19:35:01Z","snapshot_observed_at":"2026-08-16T15:56:46.382341Z","submitted_at":"2023-02-08T16:40:11Z","title":"Attending to Graph Transformers","version":3},"cited_work":{"arxiv_id":"2302.04181","doi":"10.48550/arxiv.2302.04181","metadata_source":"pith","pith_arxiv_id":"2302.04181","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Attending to Graph Transformers","venue":"cs.LG","work_id":"38ef9af5-685f-46a5-99ad-a81fed510eb6","year":2023},"citing_paper":{"arxiv_id":"2506.08309","last_updated":"2025-06-11T03:31:52Z","snapshot_observed_at":"2026-08-19T21:17:32.635096Z","submitted_at":"2025-06-10T00:35:53Z","title":"Learnable Spatial-Temporal Positional Encoding for Link Prediction","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T05:23:50.375373Z"},"links":{"cited_paper":"/paper/2302.04181","citing_paper":"/paper/2506.08309"},"observation_digest":"sha256:0d96790056a8aef20cfca2c911007941cad9a660af42501b290966c2391e7ef9","observation_id":"15c21110-0764-45e2-af59-83cb10632b25","resolution":{"observed_at":"2026-08-07T05:23:53.565570Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04181","last_updated":"2024-03-28T19:35:01Z","snapshot_observed_at":"2026-08-16T15:56:46.382341Z","submitted_at":"2023-02-08T16:40:11Z","title":"Attending to Graph Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.04181","snapshot_observed_at":"2026-08-15T15:55:16.332302Z","title":"Attending to graph transformers,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.14431","last_updated":"2026-07-31T18:12:08Z","snapshot_observed_at":"2026-08-18T18:09:44.069780Z","submitted_at":"2025-09-17T21:11:05Z","title":"Local-Canonicalization Equivariant Graph Neural Networks for Sample-Efficient and Generalizable Swarm Robot Control","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T15:55:16.332302Z"},"links":{"cited_paper":"/paper/2302.04181","citing_paper":"/paper/2509.14431"},"observation_digest":"sha256:ef9323cbc18be9e777fa0f50b3436f8a94427288e422f7c0af8b48e571d3bc01","observation_id":"474e495e-ad7c-446d-9834-dbdd28eb65d7","resolution":{"observed_at":"2026-08-15T15:55:16.332302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04181","last_updated":"2024-03-28T19:35:01Z","snapshot_observed_at":"2026-08-16T15:56:46.382341Z","submitted_at":"2023-02-08T16:40:11Z","title":"Attending to Graph Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.04181","snapshot_observed_at":"2026-08-03T05:44:25.267065Z","title":"M¨uller, L., Galkin, M., Morris, C., and Ramp ´aˇsek, L","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.01553","last_updated":"2026-07-26T09:03:31Z","snapshot_observed_at":"2026-08-13T21:06:21.235865Z","submitted_at":"2026-02-02T02:45:52Z","title":"Plain Transformers are Surprisingly Powerful Link Predictors","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T05:44:25.267065Z"},"links":{"cited_paper":"/paper/2302.04181","citing_paper":"/paper/2602.01553"},"observation_digest":"sha256:c090ad46c7f4e64b4e3c3fb20b7406f9f4cb8270706d10ca60242d28f88c86da","observation_id":"6df72225-2a00-4bd5-bdde-cf5800a0130d","resolution":{"observed_at":"2026-08-03T05:44:25.267065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04181","last_updated":"2024-03-28T19:35:01Z","snapshot_observed_at":"2026-08-16T15:56:46.382341Z","submitted_at":"2023-02-08T16:40:11Z","title":"Attending to Graph Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.04181","snapshot_observed_at":"2026-08-02T03:50:44.278014Z","title":"Attending to graph transformers,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.13763","last_updated":"2026-07-17T14:27:46Z","snapshot_observed_at":"2026-08-20T10:43:29.435015Z","submitted_at":"2026-07-15T12:22:36Z","title":"MxGPS: Multiplex Graph Transformers for a Power Grid Foundation Model","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T03:50:44.278014Z"},"links":{"cited_paper":"/paper/2302.04181","citing_paper":"/paper/2607.13763"},"observation_digest":"sha256:182c064c079f47dc4618dda41db0554cff9c892844a59efdfee3b4d24001f2d4","observation_id":"a0c5e4ba-4237-43fc-a3e5-f91f4cc39e2a","resolution":{"observed_at":"2026-08-02T03:50:44.278014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2302.04181/citation-record","integrity":"/paper/2302.04181/integrity","json":"/paper/2302.04181/citation-record.json","paper":"/paper/2302.04181"},"outbound":[],"paper":{"arxiv_id":"2302.04181","last_updated":"2024-03-28T19:35:01Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T15:56:46.382341Z","submitted_at":"2023-02-08T16:40:11Z","title":"Attending to Graph Transformers"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 12 inbound Pith citation observations for arXiv:2302.04181."}