{"as_of":"2026-08-08T18:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a9ccbc970638dc530d0e062a75bedd7e4b38677235706b1faed6b8a754d2440a","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T10:31:15.048034Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"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-04T06:16:57.332244Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.08101","snapshot_observed_at":"2026-08-04T06:16:57.332244Z","title":"P., Miao, S., Li, P., and Ying, R","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.21369","last_updated":"2026-08-01T12:38:31Z","snapshot_observed_at":"2026-08-06T23:10:55.699930Z","submitted_at":"2026-01-29T07:50:00Z","title":"Rethinking Federated Graph Foundation Models: A Graph-Language Alignment-based Approach","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-04T06:16:57.332244Z"},"links":{"cited_paper":"/paper/2502.08101","citing_paper":"/paper/2601.21369"},"observation_digest":"sha256:0a3d9fde6b99534bfe35efd4c2af0d116762d35cf2aa16b8758424a5a57e106e","observation_id":"379bbd5e-9288-44a0-9b55-775ada80e23d","resolution":{"observed_at":"2026-08-04T06:16:57.332244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.08101/citation-record","integrity":"/paper/2502.08101/integrity","json":"/paper/2502.08101/citation-record.json","paper":"/paper/2502.08101"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:31:14.843160Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.843160Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:e29f10f82c3a87286879edca6e058bbcaff75eb1965623975b899f2c87df140e","observation_id":"4104a7d4-c933-4f12-a045-607f5d0dd100","resolution":{"observed_at":"2026-08-08T10:31:14.843160Z","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-08T10:31:15.709861Z","title":"V., and Galstyan, A","venue":null,"work_id":"d775d35d-4fa0-41b3-8c16-fb2ca9f79f7f","year":2019},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.850916Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:b607ab0aaf59c93afe96823e4feb02ab149790fdcbe155813d06976e87b0bbfb","observation_id":"bb966f44-2865-4c60-81c6-093f6086a7d5","resolution":{"observed_at":"2026-08-08T10:31:15.714229Z","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-08T10:31:15.696200Z","title":"Beyond low-frequency information in graph convolutional networks","venue":null,"work_id":"ffe12385-c8c5-4193-9e4d-f02a32736c06","year":2021},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.856221Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:e48e55732c80419ffe7256efac5ac93879e6122bf557f82ccd08257574bb2821","observation_id":"35c34978-f833-4d9f-a173-5ed18ed090ba","resolution":{"observed_at":"2026-08-08T10:31:15.700487Z","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-08T10:31:15.682404Z","title":"Specformer: Spectral graph neural networks meet transformers","venue":null,"work_id":"a9e4b770-d65d-4b4b-963a-d5352933f809","year":2023},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.861109Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:a2bc1e6bdffcf5af94e4cd125d3dd3abe85f75ed097159485550f80b9c3a0011","observation_id":"ad40fa47-8336-4867-8798-f4d6f796b38f","resolution":{"observed_at":"2026-08-08T10:31:15.686834Z","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-08T10:31:15.667885Z","title":"How attentive are graph attention networks? In Proceedings of the International Conference on Learning Representations, 2022","venue":null,"work_id":"df49efde-5461-4db2-9842-e2af59cba0ff","year":2022},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.867024Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:c4887d3e53f6f7ad8e6b147d5e344cde70cd0fac5e956208b217963c381337c6","observation_id":"360ce613-83b8-4d4c-8821-ddeb6a8e7bbe","resolution":{"observed_at":"2026-08-08T10:31:15.672523Z","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-08T10:31:15.653543Z","title":"Measuring and relieving the over-smoothing problem for graph neural networks from the topological view","venue":null,"work_id":"1606241d-b2c4-4c00-9734-4cf34ebb9233","year":2020},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.875007Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:abdb14b153ce070bb830c17472b9ac78bb997d1688fa6f28554535dd90a6e063","observation_id":"47e15606-ff23-4303-bba2-94892e00dffb","resolution":{"observed_at":"2026-08-08T10:31:15.658063Z","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-08T10:31:15.637821Z","title":"Nagphormer: A tokenized graph transformer for node classification in large graphs","venue":null,"work_id":"af28c3b3-4a93-4fa0-8f8b-a3ab169eebf6","year":2023},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.880795Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:60a44fa8c6b0344894975c0ddec7b9eab23a18bcfa21ff3cbf597957bc0ce1b3","observation_id":"4ce29db0-b097-4a3c-9718-9b35a47c98ea","resolution":{"observed_at":"2026-08-08T10:31:15.642114Z","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":"2310.11025","last_updated":"2023-10-17T06:42:11Z","snapshot_observed_at":"2026-07-06T16:34:19.351760Z","submitted_at":"2023-10-17T06:42:11Z","title":"SignGT: Signed Attention-based Graph Transformer for Graph Representation Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11025","snapshot_observed_at":"2026-08-08T10:31:14.885876Z","title":"E., and He, K","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.885876Z"},"links":{"cited_paper":"/paper/2310.11025","citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:5d1e58e2b4509dfa6eb2afae588c48eb44cc2c15f7354e6266838c1ed663c699","observation_id":"1744a781-a106-4505-875d-cb349873bdc1","resolution":{"observed_at":"2026-08-08T10:31:14.885876Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.19249","last_updated":"2024-06-27T15:16:00Z","snapshot_observed_at":"2026-07-06T18:38:00.379225Z","submitted_at":"2024-06-27T15:16:00Z","title":"NTFormer: A Composite Node Tokenized Graph Transformer for Node Classification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.19249","snapshot_observed_at":"2026-08-08T10:31:14.890499Z","title":"Ntformer: A composite node tokenized graph transformer for node classification","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.890499Z"},"links":{"cited_paper":"/paper/2406.19249","citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:21e316ffbce296fa6692fa2f291e8862f10f9f29ddad7d361fa8c5c878576e41","observation_id":"358ba552-f495-4bc8-a087-f8b8a74b57d8","resolution":{"observed_at":"2026-08-08T10:31:14.890499Z","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-08T10:31:15.623647Z","title":"Neighborhood convolutional graph neural network","venue":null,"work_id":"62b0d778-1706-4c56-99b9-eb56dea5d6cf","year":2024},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.895066Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:726921c9dc98b5fbfd2c20398d36181e5a368758b4b0050066d6ce6bf27046c3","observation_id":"b02b59f0-7b3a-4045-bf42-4d6de64d370c","resolution":{"observed_at":"2026-08-08T10:31:15.628101Z","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-08T10:31:15.608822Z","title":"Pamt: A novel propagation-based approach via adaptive similarity mask for node classification","venue":null,"work_id":"4d9ae184-d771-4a69-89f9-ddd7b91937d8","year":2024},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.899231Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:b2f7da8943c7509b9b5836bc07365a20622c3b42724b6570247ace46b269a025","observation_id":"cf3bef8c-54ab-4750-b936-2c880df3fa80","resolution":{"observed_at":"2026-08-08T10:31:15.613556Z","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-08T10:31:15.594252Z","title":"Nagphormer+: A tokenized graph transformer with neighborhood augmentation for node classification in large graphs","venue":null,"work_id":"39adb862-262b-48b5-ae59-aaf8938ee9f6","year":2024},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.904065Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:62e68e25eb920f3e7dfae281ac45bf0d40b4d02bb2e10f90dfc356b0830e1d0a","observation_id":"9b4b4d68-79ad-4cd9-a1b1-2cf50e262ab7","resolution":{"observed_at":"2026-08-08T10:31:15.598601Z","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-08T10:31:15.580668Z","title":"Simple and deep graph convolutional networks","venue":null,"work_id":"efd6dc36-b3fe-437f-bd5e-8c593a3a669c","year":2020},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.908829Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:3d42a082a8974a4e371cf3472d94ac7c134c7ed4b6766454966f1ac3e936bd52","observation_id":"921f4048-6855-4e87-b3b9-926d3c607c0d","resolution":{"observed_at":"2026-08-08T10:31:15.585005Z","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-08T10:31:15.566294Z","title":"Adaptive Universal Generalized PageRank Graph Neural Network","venue":null,"work_id":"8bc6aa14-be71-4e41-98b1-03bbde96cf64","year":2021},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.913078Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:619f935a24e972e7d80d2a6bfe29425574b8128b9de9e79cd09d52220df7bdda","observation_id":"87e15dbb-c08e-474c-8871-cbf6faa4b2cb","resolution":{"observed_at":"2026-08-08T10:31:15.570832Z","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-08T10:31:15.552321Z","title":"Polynormer: Polynomial-expressive graph transformer in linear time","venue":null,"work_id":"92a39b17-9d2b-4362-be73-3f7fa1cc1b89","year":2024},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.917369Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:15032863e3c155e3ba6a8d55dbef5ae60535464dcd5c7bfe80228f9792e9f705","observation_id":"f6ecf7c6-612b-4eed-a7eb-363fbd6aba2c","resolution":{"observed_at":"2026-08-08T10:31:15.556696Z","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-08T10:31:15.537450Z","title":"Vcr-graphormer: A mini-batch graph transformer via virtual connections","venue":null,"work_id":"17f989e9-b698-424d-a88b-3a46751ceda5","year":2024},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.921944Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:a88c2890423660140ce64c568510f69b5bcf17721e0dab5e069a28d7c9538a18","observation_id":"bc36cabd-91ed-40f9-ab87-68f90b468303","resolution":{"observed_at":"2026-08-08T10:31:15.541934Z","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-08T10:31:15.522931Z","title":"Block modeling-guided graph convolutional neural networks","venue":null,"work_id":"6915c30f-fd18-4f7a-83c6-5126a3efc1a1","year":2022},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.926498Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:13e975aae16af1ea4e4d13febff577c0f3b0ce0cb05722de038359137bdcf0a1","observation_id":"704804b6-4454-4183-aca8-3de6e7b87a82","resolution":{"observed_at":"2026-08-08T10:31:15.527551Z","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-08T10:31:15.508166Z","title":"Structural robust label propagation on homogeneous graphs","venue":null,"work_id":"15d90a7d-a3a2-47ff-827e-3441b3e7c00c","year":2022},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.930581Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:ac7097389c7768abb11cb774e03baff8045d7af8e610ac6a5ce420f372b8de61","observation_id":"efcc9f22-2ff7-41ee-90bd-fe1bc9633053","resolution":{"observed_at":"2026-08-08T10:31:15.512579Z","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-08T10:31:15.494156Z","title":null,"venue":null,"work_id":"f3f64256-8338-4ccd-8919-4b86d73bad12","year":2017},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.934475Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:7b5452838984983a625ed2065d171c77b2d128385a2bc96dec91dc682b4a7b6d","observation_id":"c2115796-9b3e-485f-aa88-8ddbb8bca518","resolution":{"observed_at":"2026-08-08T10:31:15.498621Z","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-08T10:31:15.478324Z","title":"Predict then propagate: Graph neural networks meet personalized pagerank","venue":null,"work_id":"998a88a1-95f7-4def-b11b-a5bc7e42009c","year":2019},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.939056Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:64c645de879a7840abfa37952e52b5ed0103cda71b7e5c6607cffe735359b74d","observation_id":"033a288b-b25b-424e-a539-6fa314539ff7","resolution":{"observed_at":"2026-08-08T10:31:15.483053Z","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-08T10:31:15.463863Z","title":"Finding global homophily in graph neural networks when meeting heterophily","venue":null,"work_id":"730fd48d-f192-4b9c-af1c-8fe1be54f156","year":2022},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.943141Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:f73cd84f841b88a1147b492be539ab0543c13bfcd25d048b0f7cf160a22003b6","observation_id":"1fbd2e9a-022e-4832-9939-dd9e78224ccd","resolution":{"observed_at":"2026-08-08T10:31:15.468484Z","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-08T10:31:15.448724Z","title":"Revisiting heterophily for graph neural networks","venue":null,"work_id":"45ef90aa-5c0a-43b5-967a-7a6b38505d44","year":2022},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.947262Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:72db86c7f33325ac3eb35ccb3de3bd3482873db8bc26bcd97038bce25f1c446b","observation_id":"051b4028-042d-4c58-baa8-85cde0c30906","resolution":{"observed_at":"2026-08-08T10:31:15.453508Z","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-08T10:31:15.433356Z","title":"Polyformer: Scalable node-wise filters via polynomial graph transformer","venue":null,"work_id":"3bb5b041-b0d8-4e8c-b55c-fbc297d325ab","year":2024},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.951869Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:60b248e784610154d3a392995f3992bee58c475d1720e06e9f0f2508c232282a","observation_id":"491604d6-fa94-497e-af92-4a4fa4b2a898","resolution":{"observed_at":"2026-08-08T10:31:15.437884Z","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-08T10:31:15.419451Z","title":"Rethinking structural encodings: Adaptive graph transformer for node classification task","venue":null,"work_id":"ecd1870c-20d3-4e77-b3a7-7267b2b1ec33","year":2023},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.956579Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:a8a2d96579d956047c174a281f879c40356a97eba01b78fd4245589fb6b3eea9","observation_id":"a96293fe-3ce7-41cb-8fa5-015143e0a8d8","resolution":{"observed_at":"2026-08-08T10:31:15.423717Z","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-08T10:31:15.405094Z","title":"Co-embedding attributed networks","venue":null,"work_id":"84415bdf-b7a7-4ee6-8f52-061fd38822f6","year":2019},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.960850Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:330bed7b55071ea59894d4b64195eea65690ffdc47ee893cf329cc2219df0d84","observation_id":"8c0af025-ac45-4b2c-8ff9-3c4f355aee21","resolution":{"observed_at":"2026-08-08T10:31:15.409613Z","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-08T10:31:15.391390Z","title":"C., Lei, Y., and Yang, B","venue":null,"work_id":"c43bf50c-52a2-4afe-a971-5034c9c0f592","year":2020},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.965195Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:11a0b37219b359ba686ce1fdfdad5c72281c38edd727c1cc560204bb32ffae56","observation_id":"485018d8-b750-4a27-893b-21f56a555187","resolution":{"observed_at":"2026-08-08T10:31:15.395562Z","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-08T10:31:15.377191Z","title":null,"venue":null,"work_id":"7224887a-39c2-4cc0-a095-9e8e5ba0f8f0","year":2023},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.969677Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:9d664d52b2ad27315997bae12b72705fcec580ceb326384d0393c7a973263b85","observation_id":"74e84631-ce2b-4165-a9c2-641986e8262a","resolution":{"observed_at":"2026-08-08T10:31:15.381901Z","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-08T10:31:15.362591Z","title":"P., Luu, A","venue":null,"work_id":"e13a91cd-ef78-48cb-96a1-a66d395b099e","year":2022},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.974907Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:58fe650378d40e9c83152f48d00476a6c0e52fcedf4c2b4edf7edd721f1b5db3","observation_id":"8a6eb613-9f20-40e6-931f-aaca57009b3d","resolution":{"observed_at":"2026-08-08T10:31:15.367003Z","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-08T10:31:15.348345Z","title":"N., Kaiser, ., and Polosukhin, I","venue":null,"work_id":"3a280c72-afb1-4625-8392-89ba766cefd2","year":2017},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.980714Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:baac8a571f48253f4ee7c5d56ca781edd159092ab43ca4dbebb1e076b3eec573","observation_id":"e14fd3dd-8dfe-4b65-9268-2375fd0d1537","resolution":{"observed_at":"2026-08-08T10:31:15.352868Z","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-08T10:31:15.333670Z","title":"Graph Attention Networks","venue":null,"work_id":"4853e18c-e8f5-4725-b916-19adbddff849","year":2018},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.985440Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:f2a97ec105fa9f61e83c13c6dc8cece8eea4ba9d8e03425613a772069cd69f99","observation_id":"c5f02639-e324-4ab4-9c75-a95f305675ff","resolution":{"observed_at":"2026-08-08T10:31:15.338217Z","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-08T10:31:15.319080Z","title":null,"venue":null,"work_id":"62c69b31-e403-41a2-94d2-71c3dddb772d","year":2019},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.989736Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:eabc9273e1e8bf50a6676ce0725bad5518c6306abe149f159c37094c70e3e91e","observation_id":"97f94078-6c88-4a75-bdee-eef085affdf4","resolution":{"observed_at":"2026-08-08T10:31:15.323379Z","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-08T10:31:15.304404Z","title":"AM-GCN: adaptive multi-channel graph convolutional networks","venue":null,"work_id":"ff6142f7-8086-4ba9-b5ed-b83770d93fde","year":2020},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.994113Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:1c65889135496cb4953ae711f70a8b32d5601f375c8d88d86b1313a9870b4b25","observation_id":"f416410b-04a5-45a4-919e-b9b558cdf411","resolution":{"observed_at":"2026-08-08T10:31:15.309116Z","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-08T10:31:15.288914Z","title":"Simplifying Graph Convolutional Networks","venue":null,"work_id":"979caba2-7a75-4294-927d-2b56a87a9fbd","year":2019},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:14.998391Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:073e16130574fb4aeff0e2ec791a1c6bd8a205dcbc3a0e63e18e48ee23ab38d8","observation_id":"c253695e-ba9d-41a6-a8f8-9730d06f2a5c","resolution":{"observed_at":"2026-08-08T10:31:15.293517Z","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-08T10:31:15.273948Z","title":"Nodeformer: A scalable graph structure learning transformer for node classification","venue":null,"work_id":"0dcee4b9-31ed-4c49-a092-2dcd64162b82","year":2022},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:15.002771Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:775b299223be8b95d932d6e316b6ffba8edc6969fb9441283206a2d4d69aa646","observation_id":"192efc73-01c9-4193-970c-767f53d3d13d","resolution":{"observed_at":"2026-08-08T10:31:15.278491Z","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-08T10:31:15.259082Z","title":"Simplifying and empowering transformers for large-graph representations","venue":null,"work_id":"0a67d4eb-6051-4e6a-9cb4-e3951b670bbc","year":2023},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:15.007187Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:91a93b28fdb13f50b9b6c31ba90ba4b28dfe8283cacfbb904f645f1fb1a07e85","observation_id":"a381c61b-efbb-4046-ba0b-59715ae6101b","resolution":{"observed_at":"2026-08-08T10:31:15.263719Z","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-08T10:31:15.242613Z","title":"Less is more: on the over-globalizing problem in graph transformers","venue":null,"work_id":"71498cbb-9084-4f11-9e90-16c2699b61a1","year":2024},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:15.011785Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:4d8d2421d4171cb447b85399f329edd210f134083430a81a6c251d31237863c6","observation_id":"ba2670d2-5db5-42c5-88f6-1962741a1ef8","resolution":{"observed_at":"2026-08-08T10:31:15.247283Z","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-08T10:31:15.225109Z","title":"Representation learning on graphs with jumping knowledge networks","venue":null,"work_id":"01644561-28b9-42c2-8222-81e45ec97667","year":2018},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:15.016352Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:00c6dd21e40453bfc18be19c78fc3f07b3f77adedf53f416374ca909743e19f5","observation_id":"156d03a5-6cd7-4b4f-b95e-9e63c4a57f86","resolution":{"observed_at":"2026-08-08T10:31:15.231170Z","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-08T10:31:15.209628Z","title":"FPGNN: fair path graph neural network for mitigating discrimination","venue":null,"work_id":"9aeb52aa-80aa-480d-a31a-7d0cc6d88943","year":2023},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:15.020624Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:6c4293d78a72c0313e20fa09f23fd3d84fd649fa952e7f308326786642836117","observation_id":"59c030e0-6aef-4d00-af74-f09aa658286a","resolution":{"observed_at":"2026-08-08T10:31:15.214018Z","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-08T10:31:15.194618Z","title":"Learning fair representations via rebalancing graph structure","venue":null,"work_id":"41e5a7ab-772c-4e47-94a8-c380b5081495","year":2024},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:15.025329Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:1c11a3b8959ea25013d794f30a5386f01494ef00cac85610cf3e33b88b083137","observation_id":"2947c8b8-da04-42ca-8ee3-be154b61ef1c","resolution":{"observed_at":"2026-08-08T10:31:15.199368Z","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-08T10:31:15.178839Z","title":"Disentangled contrastive learning for fair graph representations","venue":null,"work_id":"314e1623-a4db-4f93-a226-e7a4f9615e84","year":2025},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:15.030214Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:2e7338378ce056c6f7f77429e30de02064f7f326c52098227b4a3a57c682398c","observation_id":"29879048-9cf7-4bd2-8a0d-4b8f772e3eef","resolution":{"observed_at":"2026-08-08T10:31:15.183509Z","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-08T10:31:15.158553Z","title":"Hierarchical Graph Transformer with Adaptive Node Sampling","venue":null,"work_id":"eb8056d3-41ce-4e72-bea2-d915bf147e61","year":2022},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:15.035143Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:7418c156a30040fb54061d9171fdddfecb7bbfc001185181e430cbc1fb4e66ce","observation_id":"06709ab4-a53e-40bf-b319-36e0f3f794d7","resolution":{"observed_at":"2026-08-08T10:31:15.164160Z","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":"2110.13094","last_updated":"2021-10-25T16:43:32Z","snapshot_observed_at":"2026-08-08T01:25:28.252960Z","submitted_at":"2021-10-25T16:43:32Z","title":"Gophormer: Ego-Graph Transformer for Node Classification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.13094","snapshot_observed_at":"2026-08-08T10:31:15.042310Z","title":"Gophormer: Ego-Graph Transformer for Node Classification","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:15.042310Z"},"links":{"cited_paper":"/paper/2110.13094","citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:c1544ae771fafdeb3ad4785dde607604309d473ba0e06f526bbe67ad29f47280","observation_id":"bed5e314-d5dd-4d90-b3df-47d5e96e7de1","resolution":{"observed_at":"2026-08-08T10:31:15.042310Z","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-08T10:31:15.138145Z","title":"Beyond homophily in graph neural networks: Current limitations and effective designs","venue":null,"work_id":"90e1cee8-baa3-4ba5-87d2-14e77390f821","year":2020},"citing_paper":{"arxiv_id":"2502.08101","last_updated":"2025-02-12T03:56:35Z","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-08T10:31:15.048034Z"},"links":{"citing_paper":"/paper/2502.08101"},"observation_digest":"sha256:311ce8cacd8722fcd6180cc638ccf37cea98ae506d995527ce29c65a6257ded8","observation_id":"b008b53d-f147-4ded-adb4-37326efff07e","resolution":{"observed_at":"2026-08-08T10:31:15.144929Z","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.08101","last_updated":"2025-02-12T03:56:35Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T10:25:19.119107Z","submitted_at":"2025-02-12T03:56:35Z","title":"Rethinking Tokenized Graph Transformers for Node Classification"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":36},"total_outbound_references":43},"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 43 of 43 outbound references and 1 inbound Pith citation observation for arXiv:2502.08101."}