{"as_of":"2026-08-08T22:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c276b1a166b7d1cd7ff42ef5233240a3c44da1523e3a3ae1e82e24b0284bd218","coverage":[{"denominator":55,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":55,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T21:50:23.535985Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:15:32.794147Z","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-06T19:15:36.834141Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"cited_work":{"arxiv_id":"2502.09365","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.09365","snapshot_observed_at":"2026-08-06T19:15:36.834141Z","title":"Simple Path Structural Encoding for Graph Transformers","venue":"cs.LG","work_id":"58cc4e3f-066b-49e1-ade7-dbe28d4d6971","year":2025},"citing_paper":{"arxiv_id":"2507.07138","last_updated":"2025-07-09T01:37:19Z","snapshot_observed_at":"2026-08-07T17:33:20.928686Z","submitted_at":"2025-07-09T01:37:19Z","title":"GNNs Meet Sequence Models Along the Shortest-Path: an Expressive Method for Link Prediction","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T19:15:32.794147Z"},"links":{"cited_paper":"/paper/2502.09365","citing_paper":"/paper/2507.07138"},"observation_digest":"sha256:60ffbf5975be17e02ae29841ce62be3e14ee2bc2af2639a74e494fb520324bcc","observation_id":"31ebb34f-efc8-46dd-80a4-5e587bdadeca","resolution":{"observed_at":"2026-08-06T19:15:36.960659Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.09365/citation-record","integrity":"/paper/2502.09365/integrity","json":"/paper/2502.09365/citation-record.json","paper":"/paper/2502.09365"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T21:50:23.371573Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.371573Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:73b17833bf2058d1d37f98078e9839087d2d39258c62f208935250cefc3f8cbd","observation_id":"bfbc62f1-3bd0-40d1-846b-b82ffe64e32c","resolution":{"observed_at":"2026-08-07T21:50:23.371573Z","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-07T21:50:24.254605Z","title":"Aromatic cycles are widespread in cold clouds","venue":null,"work_id":"fc71d1ba-5d4c-4702-b482-c64a46722d38","year":2023},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.376013Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:8294f73aa4097b52efe7678bebb65664d9f22cafc06f1bed78dabfea6052a5f7","observation_id":"42597033-858b-4183-8952-5ebabc7c0297","resolution":{"observed_at":"2026-08-07T21:50:24.257976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.245595Z","title":"Finding and counting given length cycles","venue":null,"work_id":"22d95827-5938-415e-adf7-b570bfb6daf1","year":1997},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.379322Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:85d0cf7060a5e610580614ccb8799257113e3ef4a4024489997de31bddf6db68","observation_id":"1a1899b4-46fc-4758-ab01-e5e1c3cb1f25","resolution":{"observed_at":"2026-08-07T21:50:24.248833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:23.382818Z","title":"and Yahav, E","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.382818Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:019a99f6b3c152db72d0bcda2be0c77a362dc24d815c34a879ea481eb850a6da","observation_id":"87ee15b1-eddc-4fd9-82ce-7f5a1618a31c","resolution":{"observed_at":"2026-08-07T21:50:23.382818Z","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-07T21:50:24.231575Z","title":"Specformer: Spectral graph neural networks meet transformers","venue":null,"work_id":"80d1f1b5-3dce-4c6e-b1b8-00741750c83a","year":2023},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.386091Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:5ccd68415a5537b24409161c94b6e0c77f7d5f83080684c9c1d50c983ed70cd6","observation_id":"71405808-ad88-4b40-8e1d-90bcd873ddbe","resolution":{"observed_at":"2026-08-07T21:50:24.234667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.223033Z","title":"D., Chamberlain, B","venue":null,"work_id":"b61c26a2-3cdf-476e-8ab3-998b03936c08","year":2022},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.389147Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:faa72b3f31f7205040d31b23bf42287c5db62aa1570700f05a8ed04260dcf807","observation_id":"ea5f58fb-322d-4513-b077-0bac15cf2efc","resolution":{"observed_at":"2026-08-07T21:50:24.226055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.07553","last_updated":"2018-04-24T08:19:32Z","snapshot_observed_at":"2026-07-06T06:10:28.033241Z","submitted_at":"2017-11-20T21:28:40Z","title":"Residual Gated Graph ConvNets","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.07553","snapshot_observed_at":"2026-08-07T21:50:23.392461Z","title":"and Laurent, T","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.392461Z"},"links":{"cited_paper":"/paper/1711.07553","citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:ff34b2f6725fc14f5ce7d25f2e8c0b789da02b773d6a78577f4c46a848f253b1","observation_id":"6ca46ad6-5d4f-4ccb-9eea-d9b96171cc29","resolution":{"observed_at":"2026-08-07T21:50:23.392461Z","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-07T21:50:24.213461Z","title":"Graph positional and structural encoder","venue":null,"work_id":"d084a01c-0e4d-40cf-ad55-d86fb9c25680","year":2024},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.396063Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:9ae5b2665de055e98fe247da72569da8ae780ee3c11e8824c6afe35f831fc2e9","observation_id":"31facd1a-04a8-4edc-954d-fb702810cdfd","resolution":{"observed_at":"2026-08-07T21:50:24.216942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.204010Z","title":"Structure-aware transformer for graph representation learning","venue":null,"work_id":"60a03b20-329a-4110-8d50-a8c898f98628","year":2022},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.399035Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:011c9e0fd66187d6848567389c674fd015f6113471ce723cece2299d806b5423","observation_id":"d41db94e-22f9-4347-b2b0-296e4149b1cf","resolution":{"observed_at":"2026-08-07T21:50:24.207379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.194903Z","title":"Graph propagation transformer for graph representation learning","venue":null,"work_id":"e97da39e-ff6b-4ff5-ada7-b1e95209eaf6","year":2023},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.402735Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:13dc4b15d37e6b2441908b8f6de377b29a133cd3ec4321315dd38da9f77c2062","observation_id":"14e928d2-28c5-47d1-b269-dc997c706e0b","resolution":{"observed_at":"2026-08-07T21:50:24.198313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:23.405705Z","title":"Y., Park, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.405705Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:16b7a1fe04697395b6bd19242fcc3781475460dfbe94a56dd274c42c8d0a53ef","observation_id":"9195d8c1-4d0f-45c8-98b6-dd297b3bc490","resolution":{"observed_at":"2026-08-07T21:50:23.405705Z","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-07T21:50:24.186196Z","title":"and Bhavani, S","venue":null,"work_id":"cf2cf90e-52ab-44d2-a925-a94f277953f2","year":2020},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.409590Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:27beea4e50242b48b0822315d0d9f2e4d369d0a3f6e72c5d5a2d2fb51759b382","observation_id":"ec316ce1-25b1-41c9-9f4c-aa8629e556c8","resolution":{"observed_at":"2026-08-07T21:50:24.189313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.176972Z","title":"Pace: A parallelizable computation encoder for directed acyclic graphs","venue":null,"work_id":"358abd99-e234-488b-bbd1-00d6ae71040a","year":2022},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.412555Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:1ef1c6ed4f5164c73e60b6480beec05cda9bbded1e060ff488aebd4215bb791b","observation_id":"5828f087-2103-4548-b234-bf975da9dddd","resolution":{"observed_at":"2026-08-07T21:50:24.180294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.167189Z","title":"An image is worth 16x16 words: Transformers for image recognition at scale","venue":null,"work_id":"34bbe1fb-9d01-4ed5-8173-5eccaa26940e","year":2021},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.415505Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:025559b69a8081ceec7e8a2b767a17238dddac98e91b2073cea074d5c5b98845","observation_id":"92d0a2b2-ad99-42d2-abb4-8b2ee536dd86","resolution":{"observed_at":"2026-08-07T21:50:24.170531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03208","last_updated":"2025-06-05T08:13:02Z","snapshot_observed_at":"2026-08-07T19:27:51.957456Z","submitted_at":"2024-10-04T07:49:57Z","title":"SPHINX: Structural Prediction using Hypergraph Inference Network","version":2},"cited_work":{"arxiv_id":"2410.03208","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.03208","snapshot_observed_at":"2026-08-07T21:50:23.577970Z","title":"SPHINX: Structural Prediction using Hypergraph Inference Network","venue":"cs.LG","work_id":"099b64dd-7133-4044-8f92-38a9c2c71fc0","year":2024},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.418360Z"},"links":{"cited_paper":"/paper/2410.03208","citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:f5ab9ba8aa7cd8369960bebd59c89b22f09119dc1c51122c49b33c0c41c08e5f","observation_id":"baedd9ef-ba7b-4d1d-994c-dca4a22d5f99","resolution":{"observed_at":"2026-08-07T21:50:23.583368Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.09699","last_updated":"2021-01-24T09:38:54Z","snapshot_observed_at":"2026-08-05T19:35:00.334774Z","submitted_at":"2020-12-17T16:11:47Z","title":"A Generalization of Transformer Networks to Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.09699","snapshot_observed_at":"2026-08-07T21:50:23.421697Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.421697Z"},"links":{"cited_paper":"/paper/2012.09699","citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:d20b3bb4913713c7058bdeaf6ab3a6b1969486ab626d1963cca44dbb0e2a5749","observation_id":"689e5f0b-58a9-4db9-a275-e95707d102be","resolution":{"observed_at":"2026-08-07T21:50:23.421697Z","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-07T21:50:23.424923Z","title":"P., Ramp \\'a s ek, L., Galkin, M., Parviz, A., Wolf, G., Luu, A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.424923Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:f0d281afef03b69d60d3d3219614ca743a3a062cefd4559af71c6dcb0996a84f","observation_id":"9e969a39-431c-4dc3-ac16-077891108f6b","resolution":{"observed_at":"2026-08-07T21:50:23.424923Z","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-07T21:50:23.427935Z","title":"P., Joshi, C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.427935Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:2774e896c5f0d883768f9710fd262604f35bf7d5608883f659dfa8fc6fd96959","observation_id":"72683ad0-3fcd-45de-acb5-762649346a33","resolution":{"observed_at":"2026-08-07T21:50:23.427935Z","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-07T21:50:24.148308Z","title":"Meta-path learning for multi-relational graph neural networks","venue":null,"work_id":"4d622ef4-f170-40d1-8aec-b2dae9e6ac03","year":2024},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.430942Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:938466fc80a8d16158051456a90ad8f8ad269ca32d49055f0dd536bdcf4afb84","observation_id":"6db8abb4-4c5e-4d35-b4af-b664ce797fce","resolution":{"observed_at":"2026-08-07T21:50:24.151553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.139968Z","title":"and Grohe, M","venue":null,"work_id":"3bbafc3a-6060-4f86-83ff-c65a92c2e01f","year":2004},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.433917Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:f85d3bcbee42dd977c8d03f4e8aa28dd61c41e087e8f8f9b299877202340a990","observation_id":"c4355cc2-d3ca-4c56-912a-09d740eeec9b","resolution":{"observed_at":"2026-08-07T21:50:24.143018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.131247Z","title":null,"venue":null,"work_id":"91ae74ae-1fba-43ac-9285-0b4a936c133e","year":2019},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.436830Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:94a6e32ab306b9f8697194c8b9c4800f6529b3de7ed150ff4c0d5d34f130f3e4","observation_id":"87e262fa-db82-45b1-b85c-4aa6a74d725d","resolution":{"observed_at":"2026-08-07T21:50:24.134411Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.122501Z","title":"The expressive power of path-based graph neural networks","venue":null,"work_id":"eb429414-3a0e-4cf7-bffa-a04ae6be5c75","year":2024},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.439717Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:39afd084404b6b41b732d4c053acc78b67369c0ebc34ec6962b484ac74140a61","observation_id":"76952373-bb57-45c5-9d24-f58a91c51ad6","resolution":{"observed_at":"2026-08-07T21:50:24.125727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.113910Z","title":"M., and Di Giovanni, F","venue":null,"work_id":"2aa7bb3d-6ef6-4248-96ea-ae3ca2b83957","year":2023},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.442585Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:d2336f85d31e5bf585e298200b485dab7f047e950d2f64a7019050d08e03dc65","observation_id":"eb912111-a62b-4141-a354-87e401de61ca","resolution":{"observed_at":"2026-08-07T21:50:24.116925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.105021Z","title":"A generalization of vit/mlp-mixer to graphs","venue":null,"work_id":"501444e7-540d-414f-ae42-30fef4fb9d61","year":2023},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.445388Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:9a122f6ec86d3e408baaf935a14c495c7583e3902ad7342ea45a802e0e2e9e0c","observation_id":"afd90d6b-3b36-433d-9db8-8f7c24b51b94","resolution":{"observed_at":"2026-08-07T21:50:24.108079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.095779Z","title":"The art of electronics, volume 2","venue":null,"work_id":"b6dbeb84-0896-463c-9fb9-7c02bd8b6048","year":1989},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.448487Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:ca28ef6cb1cc9aace8bff564ab30859b81d19d48fd2fbe06bb8ee6410d87e0c9","observation_id":"f0bd10c2-859c-4845-82e2-50bbcb6cafc1","resolution":{"observed_at":"2026-08-07T21:50:24.099106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.086307Z","title":"Ogb-lsc: A large-scale challenge for machine learning on graphs","venue":null,"work_id":"b8025fe3-b22b-4681-9454-ccd008849f6a","year":2021},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.451437Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:c1bbe2d662dc65b33cf229cb44c6e78c4c312c491bc9a0abaa135531d095170b","observation_id":"003f2cb2-6f14-4599-af94-cac0b196297d","resolution":{"observed_at":"2026-08-07T21:50:24.089640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.077172Z","title":"S., Zaki, M","venue":null,"work_id":"286e5809-a242-405d-9ce7-e81f537f9029","year":2022},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.454242Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:7deb2849d0cc6b07ccc619078f7adb21a4ca08196171d9b2987c4509b9865003","observation_id":"723a2ec7-b966-4335-91bd-c1ea8bd8ea4a","resolution":{"observed_at":"2026-08-07T21:50:24.080383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.067557Z","title":"Flowerformer: Empowering neural architecture encoding using a flow-aware graph transformer","venue":null,"work_id":"d6b9cbdb-3c63-4ba0-ad60-f8ca28da228c","year":2024},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.457306Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:dd38866da6491c85bb0b447f667820f5f342eabb38d063a10d4e83b4fa1e023f","observation_id":"f8664326-ecd9-4a51-bdea-bc60884d257a","resolution":{"observed_at":"2026-08-07T21:50:24.070832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.058417Z","title":null,"venue":null,"work_id":"23123622-f4f5-4196-a78b-04caf4659062","year":1975},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.460217Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:806cebbb7cb2a62f70364ccd46de3602dc26a56d74f09e742fac5348d6096e3b","observation_id":"3ff0a92a-b98d-479a-9c72-03ff10dc127f","resolution":{"observed_at":"2026-08-07T21:50:24.061685Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.049515Z","title":null,"venue":null,"work_id":"686c08bf-e4eb-4057-99d8-32a0ff170706","year":2017},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.463132Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:57598f2368b885ec12ff576c0c7c442de1ead77a88f6910f18e848fbd2abeba8","observation_id":"2f06f612-b980-4aa3-9061-7bda40ec9dff","resolution":{"observed_at":"2026-08-07T21:50:24.052657Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:23.465953Z","title":"Rethinking graph transformers with spectral attention","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.465953Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:a96e1f34bdc223230fd50584f1fd9b6428ae5ca8bdcc7e5526abdda67e8af9a6","observation_id":"9f9ad3bf-8cf7-4d84-8822-8948e36d8237","resolution":{"observed_at":"2026-08-07T21:50:23.465953Z","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-07T21:50:24.035505Z","title":"A simple and expressive graph neural network based method for structural link representation","venue":null,"work_id":"e215ac23-a430-4e7a-9cee-0537aaa18096","year":2024},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.468895Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:88d32fceba717710d61b662df22f7a01d50cefa1c2ad388beab4609a35a2f710","observation_id":"99282e1a-d94a-44d7-a91d-4b92066b2b21","resolution":{"observed_at":"2026-08-07T21:50:24.038710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.027119Z","title":"Enhancing graph transformers with hierarchical distance structural encoding","venue":null,"work_id":"18fd58bb-7c01-40a4-9e74-b65cb58b0af3","year":2024},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.471766Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:be63259e83f2bc80b0f969f7a1986a625e352c6536634b3bc5a6026b81bc6c1b","observation_id":"6eebd622-8203-4ffe-aefb-bc1c5321a3fc","resolution":{"observed_at":"2026-08-07T21:50:24.030159Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.018322Z","title":"Transformers over directed acyclic graphs","venue":null,"work_id":"93acf5ba-63c9-4993-ab9f-18be3408825c","year":2024},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.474486Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:a3c8c3d228189ea8c30775f989a860a3cf472af218d6b21d86cc91eef0bc1f0e","observation_id":"a3bf2ff8-3efe-4a6a-aa65-a85543361d00","resolution":{"observed_at":"2026-08-07T21:50:24.021543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.009653Z","title":"K., Coates, M., Torr, P., and Lim, S.-N","venue":null,"work_id":"5c12bee3-5716-4431-bb05-da432f30fba4","year":2023},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.477420Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:9442d1ccba6153b7d14cd9e654f99fe3f43f7128bf01413cec1377a33825a5cb","observation_id":"66ac4be4-4d21-4fd4-b517-b2fa363ab111","resolution":{"observed_at":"2026-08-07T21:50:24.012691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:24.000869Z","title":null,"venue":null,"work_id":"da850a44-4afd-4194-a185-991f455db605","year":2014},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.480415Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:e05c7cd313d6d4ad0f7d9fea457305ff6b9096456438e837968e4c79adc41dfc","observation_id":"74797979-af65-4aed-bc94-005b17f04c4a","resolution":{"observed_at":"2026-08-07T21:50:24.003945Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:23.991787Z","title":"Self-attention in colors: Another take on encoding graph structure in transformers","venue":null,"work_id":"e99adcce-60e0-4a65-80db-856b7816dac4","year":2023},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.483335Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:cc3d5ebfd319600eba0a5c8bc2a732726a29eea1ed5a7fc57c81ff6ea010fe8e","observation_id":"6e0a357d-2ce8-4764-89c7-7b11eee791d4","resolution":{"observed_at":"2026-08-07T21:50:23.995112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.05667","last_updated":"2021-06-10T11:36:22Z","snapshot_observed_at":"2026-07-06T11:17:55.927608Z","submitted_at":"2021-06-10T11:36:22Z","title":"GraphiT: Encoding Graph Structure in Transformers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.05667","snapshot_observed_at":"2026-08-07T21:50:23.486140Z","title":"Graphit: Encoding graph structure in transformers","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.486140Z"},"links":{"cited_paper":"/paper/2106.05667","citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:15c5a52fbef1a7187502f1cacc1b1ef28c36ef1448e0fb0595f3567f0be36782","observation_id":"b583f1b8-462b-4684-b7a2-bfb577609fff","resolution":{"observed_at":"2026-08-07T21:50:23.486140Z","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-07T21:50:23.982884Z","title":"F., and Vazirgiannis, M","venue":null,"work_id":"aec91a23-a6c1-455f-ac37-9ca156459896","year":2023},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.489353Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:d408b023267ed3ce4cf3c2c7b5e31bab1d74e0a8e20e7fd4e6f0b4c5898500cd","observation_id":"0c0b9b51-f47f-463b-b6cd-19732b1df9a5","resolution":{"observed_at":"2026-08-07T21:50:23.986059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:23.973826Z","title":"and Rousseau, R","venue":null,"work_id":"4520da5c-5823-4770-a82e-1fe18637d2b9","year":2002},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.492269Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:4438c9b30dca246740f3fbc26eff5fe0fa5593f7cc7b86fee326c30dd1cde52b","observation_id":"9917240d-05fb-4ff1-b53d-f4208048f2c0","resolution":{"observed_at":"2026-08-07T21:50:23.976897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:23.964831Z","title":"and Voropaev, A","venue":null,"work_id":"84b386d5-75b8-486e-a1ad-6d799f279f2a","year":2009},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.495084Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:1413d97862cf4be024084a75641dbcb330031c7da8497278269b3bb8775d65f5","observation_id":"5408f3f5-b404-478c-a14c-9a42cfe8f110","resolution":{"observed_at":"2026-08-07T21:50:23.967981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:23.955910Z","title":"A., Nothias, L.-F., Vining, O., Meehan, M., Esquenazi, E., and Dorrestein, P","venue":null,"work_id":"b7b21b84-98cc-46fe-8ab7-380fcfc42cde","year":2017},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.498153Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:f565c5b8bbd03fa65e540322180e8ab67bfcaad37c5aba49bd23a53c43912599","observation_id":"ab0d5b1f-dbcc-47ea-bd05-ed56276d555b","resolution":{"observed_at":"2026-08-07T21:50:23.959146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:23.946774Z","title":"Defining and identifying communities in networks","venue":null,"work_id":"524a8b3a-9df4-420f-ba20-253adb0574e0","year":2004},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.501042Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:a94446fa127ebb126a38fafbe5ed7273e7b28bd63141ed0f4a374ca5bfe55c07","observation_id":"b90dd856-685c-4a12-838f-6f15565c1047","resolution":{"observed_at":"2026-08-07T21:50:23.950176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:23.937910Z","title":"Citation networks","venue":null,"work_id":"d5901912-ee89-463d-8255-cfd1aeec105b","year":2011},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.504003Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:195633802e209ce4a7e8b6133450ef37a9e361d209330931a53b9022d8c07f41","observation_id":"73e26b04-701a-4fb5-a9a1-e0ceb8196936","resolution":{"observed_at":"2026-08-07T21:50:23.941056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:23.506979Z","title":"P., Luu, A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.506979Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:a7eb204e35a587773806dbcb6dcf6e0376bdd6dbdc3b72403b1fc2f82596294c","observation_id":"ebf5989e-2e46-418d-bd0a-5c99717e883d","resolution":{"observed_at":"2026-08-07T21:50:23.506979Z","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-07T21:50:23.509942Z","title":"J., and Sinop, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.509942Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:fed9a63101d63b5dd65d9cc7f41923b29e0bc948783051cfe7029739d7ed6eef","observation_id":"a4443cba-67b4-4bae-9071-f4531707c1a3","resolution":{"observed_at":"2026-08-07T21:50:23.509942Z","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-07T21:50:23.919145Z","title":"D., Chamberlain, B","venue":null,"work_id":"9fcd4dd5-d059-4e0c-8637-1089adc7610a","year":2022},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.512816Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:2b1790a6e578481a01e271a0e8aaf3552bb1239804af13ab866d6b99078740c9","observation_id":"6d20228d-d74d-423f-b213-2b40ca244709","resolution":{"observed_at":"2026-08-07T21:50:23.922252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:23.910235Z","title":"and Williams, R","venue":null,"work_id":"8dbeee04-ad34-4a08-a04c-ca8472deef06","year":2009},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.515648Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:d26e685dc0957e976b9e1ebec13bfd65c5ea5cb951b885fc97fc46a6e227fe23","observation_id":"54d2db2e-5a5e-4b67-b65e-361516f7f3a6","resolution":{"observed_at":"2026-08-07T21:50:23.913323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:23.518496Z","title":"Attention is all you need","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.518496Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:d4a153b435411beac42a55a738016df1384784f7561b9aeda2deb54d535ea548","observation_id":"7ed9e380-32b8-429d-adcd-abe4cd6ea48b","resolution":{"observed_at":"2026-08-07T21:50:23.518496Z","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-07T21:50:23.895789Z","title":"Graph attention networks","venue":null,"work_id":"bc955088-4785-4ec9-b8bc-f4f031e68557","year":2018},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.521457Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:5c8508176dd36edba267d4dd178925155a721006c9243e541b39e17bcf2c79b6","observation_id":"f97247bd-8748-40b0-94e0-a6d8954092e3","resolution":{"observed_at":"2026-08-07T21:50:23.898877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:23.886631Z","title":"E., and Stoica, I","venue":null,"work_id":"a3f23bf6-f067-4e4f-8506-6a9470100032","year":2021},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.524265Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:3f136856ab8c235570d8f397cf1f38e6e003718f9d640ad0e78a78d71cd85a5a","observation_id":"18b073b3-7b29-4be2-a9a3-ecd1e1056922","resolution":{"observed_at":"2026-08-07T21:50:23.890021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:23.527350Z","title":"How powerful are graph neural networks? In International Conference on Learning Representations, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.527350Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:2b0aade5547b4f7534b64c8037d064e36163481e9ae273f18b32cc7345fd4bef","observation_id":"3a5c20af-5c57-4407-b518-18a524bc70d4","resolution":{"observed_at":"2026-08-07T21:50:23.527350Z","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-07T21:50:23.530209Z","title":"Do transformers really perform badly for graph representation? Advances in neural information processing systems, 34: 0 28877--28888, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.530209Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:95c765c783dc9d10fa2ffc8b4f16b6b3f019d147fc3e34e20a40f88cea7381b1","observation_id":"ef719359-1581-42ee-bd06-716166caca35","resolution":{"observed_at":"2026-08-07T21:50:23.530209Z","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-07T21:50:23.867442Z","title":null,"venue":null,"work_id":"a1db3a8b-dac5-4429-bae0-b1ec8cadc7cf","year":2019},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.533197Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:31ee33db0b41139932dd2558e69afd3b89a85d60851468dfa23b20c6f874a74d","observation_id":"a88806a2-185a-4598-a8fb-9a4c3c05890d","resolution":{"observed_at":"2026-08-07T21:50:23.870651Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T21:50:23.858096Z","title":"From stars to subgraphs: Uplifting any gnn with local structure awareness","venue":null,"work_id":"a546fbc1-3c95-4775-84b0-15eac449f47f","year":2022},"citing_paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T21:50:23.535985Z"},"links":{"citing_paper":"/paper/2502.09365"},"observation_digest":"sha256:1b563d7bc3a713de50d06660373e5feee69b1925ca98ae453396bd87b4e8eb43","observation_id":"2acac570-00e7-403d-b2ee-b3cbe012577b","resolution":{"observed_at":"2026-08-07T21:50:23.861436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.09365","last_updated":"2025-05-30T21:53:37Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T04:57:04.572859Z","submitted_at":"2025-02-13T14:33:02Z","title":"Simple Path Structural Encoding for Graph Transformers"},"reference_resolution":{"displayed":55,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":1,"verified_fuzzy":35},"total_outbound_references":55},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 55 of 55 outbound references and 1 inbound Pith citation observation for arXiv:2502.09365."}